Analysis of Programs -- Honors (336H)

Instructor: Adam Klivans

Teaching Assistant: Xin Li

Course meets Tuesday and Thursday at 12:30 PM in RLM 7.116

Office Hours: Wed from 10:30 to 12pm in TAY 3.148

Xin Li's Office Hours: Tue from 2:30 - 4pm in TAY 3.108

Course Description

This course focuses on discrete mathematical tools of fundamental importance to the working computer scientist.

Tentative Syllabus

Induction. 1 week

Graph Theory. 2 weeks

Set Theory and Number Theory, 3-4 weeks.

Intro to combinatorics. 2-3 weeks.

Discrete Probability and Applications. 2 weeks

Recurrence Relations. 1 week.

Program Correctness. 1 weeks.

Grading

Homework: 30%, 2 midterms 35%, final exam 35%.

Textbook

We will roughly follow chapters from Rosen's "Discrete Mathematics and Its Applications" (Sixth Edition). Several lectures, however, will be based on other sources (for example my own experience).

Homework Policy

You may work in groups of three, but you must write up the solutions to the homeworks yourself.