Discrete Mathematics
Credits: 3
Prerequisites: MA 110
Relations. Mathematical structures. Number theory. Algorithms. Complexity of algorithms. Cryptology. Recurrence relations. Graph theory. A shortest-path algorithm. Planar graphs. Trees. A maximal flow algorithm. Finite-state automata. Languages and grammar. Turing machines. The Church-Turing thesis. Unsolvable problems.
Course Overview & Topics
Section titled “Course Overview & Topics”- key concepts, software, etc
Professors
Section titled “Professors”- John Doe
- specific advice
- workload, assessments, teaching style
- professor specific advice