6.1200J Mathematics for Computer Science
6.1200J Mathematics for Computer Science (Spring 2024, MIT OCW). Instructors: Prof. Eric Demaine, Dr. Zachary Abel, and Dr. Brynmor Chapman. 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. (from ocw.mit.edu)
| Lecture 06 - Asymptotics |
Last week we saw some techniques for evaluating and approximating sums. Today we will use those techniques to solve a well-known physics problem. We then explore asymptotic notation, including Big-O, Little-o, Big-Ω, and Little-ω.
Go to the Course Home or watch other lectures: