## COURSE DESCRIPTION

The course prepares Computer Science majors for advanced study by emphasizing components of Discrete Mathematics related to Computer Science. The topics include sets, functions and relations, logic, Boolean algebra, graph theory, proof techniques, and matrices. Examples will emphasize Computer Science applications.

**Prerequisites:** MATH 2011 or MATH 1220, either with C or better.

**Textbooks:**

- Edward A. Bender and S. Gill Williamson,
*A Short Course in Discrete Mathematics*, Dover, 2011. - Edward A. Bender and S. Gill Williamson,
*Mathematics for Algorithm and System Analysis*, Dover, 2011.

## RECENT UPDATE

**[01.01.2010]**
Students are strongly encouraged to use the university learning management
system. This learning management system provides a grade book
functionality and is regularly updated including the solution keys
for all problem sets and exams.