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
Learning Resource Types
notes
Lecture Notes
theaters
Lecture Videos
menu_book
Open Textbooks
assignment
Problem Sets
auto_stories
Readings
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.)
