CSCE 222 Discrete Structures for Computing
Spring 24
Instructor: Sing-Hoi Sze
Email: shsze@cse.tamu.edu
Meeting: MWF 12:40-1:30 ZACH 310
Office Hours: MWF 11-12 PETR 427 or on zoom
Exams
- Midterm 1 (Feb. 23): up to sums
- Midterm 2 (Apr. 1): up to binomial theorem
- Final Exam (May 3): 10:30-12:30
Homeworks
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).
- Final exam (30%).
Prerequisites