Honor-CSCE 222 Discrete Structures for Computing
Fall 12
Instructor: Sing-Hoi Sze
Email: shsze@cse.tamu.edu
Meeting: TR 9:35-10:50 HRBB 126
Goals
- Provide mathematical foundations for analysis of algorithms.
- Provide an introduction to finite automata and Turing machines.
Textbook
- Rosen K.H. Discrete Mathematics and its Applications.
McGraw-Hill.
Topics
- Logic, proofs, and sets.
- Functions, sequences and sums.
- Algorithms and complexity.
- Induction and recursion.
- Counting and recurrences.
- Relations.
- Models of computation.
Grading
- Homework assignments (30%): written assignments handed out every one
or two weeks.
- Two midterms (20% each).
- One final exam (30%).
Prerequisites