MTH 150: Discrete Mathematics

Note: If this course is being taught this semester, more information can be found at the course home page.

Cross Listed

(none)

Prerequisites

(none)

This course is a prerequisite or co-requisite for

This course is required for computer science majors. This course should be of interest to electrical engineers, especially those interested in designing and analyzing algorithms.

Description

(none)

Topics covered

Logic, mathematical reasoning, introduction to proofs, mathematical induction, set operations, algorithms, introduction to number theory, recurrence relations, techniques of counting, graphs, as well as specific questions given by the “Towers of Hanoi,” and Euler’s “7 bridges of Konigsberg problem.”

General Theory of Algorithms; Complexity Theory; MTH 236.