CSCE 222 Discrete Structures for Computing
Fall 09
Instructor: Sing-Hoi Sze
Email: shsze@cse.tamu.edu
Meeting: MWF 11:30-12:20 HRBB 124
Office Hours: MWF 10:30-11:30 HRBB 328B or by appointment
TA: Wen Yuan
Email: yuanw@cse.tamu.edu
Office Hours: R 10:30-12:00, F 1-2:30 HRBB 427A
Peer Teacher: Evin Schuchardt
Email: evin@cse.tamu.edu
Web site: http://people.tamu.edu/~eschuchardt
Office Hours: TR 2-4 Reed-McDonald 111C
Exams
- Midterm 1 (Oct. 5): up to sequences and sums.
- Midterm 2 (Nov. 6): up to permutations and combinations.
- Final Exam (Dec. 16): 10:30-12:30.
Handouts
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
- Sets, logic and proofs.
- 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