Discrete Structures's Full Profile
This course has been designed to provide you with a clear, accessible introduction to discrete mathematics. Discrete mathematics describes processes that consist of a sequence of individual steps (as compared to calculus, which describes processes that change in a continuous manner). The principal topics presented in this course are logic and proof, induction and recursion, discrete probability, and finite state machines. As you progress through the units of this course, you will develop the mathematical foundations necessary for more specialized subjects in computer science, including data structures, algorithms, and compiler design. Upon completion of this course, you will have the mathematical know-how required for an in-depth study of the science and technology of the computer age.
Days of the Week:
Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
- Level of Difficulty: All Levels
- Size: One-on-One
- Cost: Free
- Institution: Saylor
- Topics: Design, Calculus, General Mathematics, Logic, Probability
The mission of the Saylor Foundation is to make education freely available to all. Guided by the belief that technology has the potential to circumvent barriers that prevent many individuals from participating in traditional schooling models, the Foundation is committed to developing and advancing inventive and effective ways of harnessing technology in order to drive the cost of education down to zero
Saylor Offers Courses In:
Questions about Discrete Structures
Want more info about Discrete Structures?
Get free advice from education experts and Noodle community members.