Difference between revisions of "Discrete Math"
Jump to navigation
Jump to search
m |
|||
| Line 9: | Line 9: | ||
I'm in the midst of taking this class (once every couple weeks). I'll finish this in May probably. | I'm in the midst of taking this class (once every couple weeks). I'll finish this in May probably. | ||
| + | |||
| + | |||
| + | {{workinprogress}} | ||
{{math}} | {{math}} | ||
| − | |||
[[category:Classes]] | [[category:Classes]] | ||
Revision as of 00:42, 1 March 2005
Official Description
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
This is useful for Computer Science majors, but neither rigorous nor comprehensive.
What actually happens
I'm in the midst of taking this class (once every couple weeks). I'll finish this in May probably.
If this article looks incomplete, that's because it hasn't been finished. Please take that into account before going through and making changes like a madman.
