##
Honor-CSCE 222 Discrete Structures for Computing

Fall 17

**Instructor**: Sing-Hoi Sze

**Email**: shsze@cse.tamu.edu

**Meeting**: TR 11:10-12:25 HRBB 126

**Office Hours**: TR 10-11 HRBB 328B or by appointment

### Exams

- Midterm 1 (Oct. 5): up to sums
- Midterm 2 (Nov. 7): up to permutations and combinations
- Final Exam (Dec. 8): 3-5

### 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).
- One final exam (30%).

### Prerequisites