Discrete Math

From Missouri Academy Wiki
Jump to navigation Jump to search

Official Description[edit]

Discrete Mathematics (17-215)
An introduction to discrete models; topics include sets, symoblic logic, relations combinatorics, mathematical induction, probability, vectors and matrices, and graph theory.

Overview[edit]

Theoretically useful for theoretical computer science majors.

What actually happens[edit]

You spend about three or four weeks developing a cursory knowledge of symbolic logic. Or rather, your class does as you wisely go get lunch instead because you had learned it all in a week in sixth grade, and moved on to more advanced logic. The rest of the semester follows about the same pattern, learn something simple in a ridiculous amount of time, while you eat lunch and actually learn it all in a weekend.

The supposed topics to be covered are listed above, but you don't even get to most of them, and when you do it's a pathetic introduction. If you have any choice in the matter, don't sign up for this class. Really, check out MathWorld instead.


Mathematics:

Precalculus   |   Calculus I   |   Calculus II   |   Multivariate Calculus   |   Differential Equations   |   Discrete Math