MTH150: Discrete Mathematics

* Course home page for this semester
Cross Listed:
Offered:
Fall & Spring
Prerequisites:
This course is a prerequisite or co-requisite for:
This course should be of interest to electrical engineers, especially those interested in designing and analyzing algorithms.
Description:
Logic, functions, algorithms, mathematical reasoning, mathematical induction, recurrence relations, techniques of counting, equivalence relations, graphs, trees, as well as specific questions given by the "Towers of Hanoi," and Euler's "7 bridges of Konigsberg problem." Required for computer science majors.
Topics covered:
Related courses:
General Theory of Algorithms; Complexity Theory; MTH236