Access Restriction

Author Tom Leighton ♦ Marten van Dijk
Source MIT OpenCourseWare
Content type Video
File Format MP4 / MPG4
Language English
Subject Domain (in DDC) Natural sciences & mathematics ♦ Mathematics ♦ General principles of mathematics
Subject Keyword formal logic notation ♦ proof methods ♦ induction ♦ sets ♦ relations ♦ graph theory ♦ integer congruences ♦ asymptotic notation ♦ growth of functions ♦ permutations ♦ combinations ♦ counting ♦ discrete probability ♦ Computer Science ♦ Probability and Statistics ♦ Applied Mathematics ♦ Electrical Engineering and Computer Science
Abstract This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
Educational Role Student
Age Range 18 to 22 years
Educational Use Self Learning
Interactivity Type Expositive
Education Level UG and PG
Learning Resource Type Video Lecture
Rights Holder Massachusetts Institute of Technology

Source: MIT OpenCourseWare