GIVE NOW about ocw help & faqs contact us
6.1200J | Spring 2024 | Undergraduate

# Mathematics for Computer Science

#### Course Description

This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, …
This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability.

## Course Info

##### Instructors

- Prof. Erik Demaine
- Dr. Zachary Abel
- Dr. Brynmor Chapman

##### Departments

- Electrical Engineering and Computer Science
- Mathematics

##### Topics

- Engineering
  - Computer Science
    - Algorithms and Data Structures
- Mathematics
  - Computation

##### Learning Resource Types

theaters Lecture Videos
notes Lecture Notes
Readings
assignment Problem Sets
menu_book Open Textbooks
Zachary Abel shows how mathematical properties can be used to stack blocks so that the uppermost block is supported even as it is entirely extended past the table. (Image courtesy of the instructors.)

Browse Resources

# You are leaving MIT OpenCourseWare

Please be advised that external sites may have terms and conditions, including license rights, that differ from ours. MIT OCW is not responsible for any content on third party sites, nor does a link suggest an endorsement of those sites and/or their content.