Updating search results...

Search Resources

1 Result

View
Selected filters:
  • asymptotic-notation-and-growth-of-functions
Mathematics for Computer Science
Conditional Remix & Share Permitted
CC BY-NC-SA
Rating
0.0 stars

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds:

Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations
Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting
Discrete Probability Theory

A version of this course from a previous term was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science).

Subject:
Applied Science
Computer Science
Engineering
Mathematics
Statistics and Probability
Material Type:
Full Course
Provider:
MIT
Provider Set:
MIT OpenCourseWare
Author:
Meyer, Albert
Rubinfeld, Ronitt
Date Added:
09/01/2005