Sukumar Ghosh, 201P Maclean Hall, 319-335-0738, sukumar-ghosh@uiowa.edu
Class meeting time: 10:30 - 11:20 AM MWF in room W128 CB
Semester hours: 3
Office hours: 2:30-3:30 PM MWF, or by appointment

1. Po-Yuan (Farley) Lai, poyuan-lai@uiowa.edu
Office: 201N Maclean Hall, phone: 319-353-2547, office hours: 3:30-5:00PM TTh
2. Vivek Sardeshmukh, vivekbhaskar-sardeshmukh@uiowa.edu
Office: 101C MLH, phone: 319-353-2328, office hours: 11:30AM-12:30PM TTh
3. Preethi Ambati, pambati@iowa.uiowa.edu
Office: 301 MLH, phone: 319-335-0738, office hours: 11:30-1:30 PM Fridays

Discrete Mathematics and Its Applications (7th Edition), by Rosen, McGraw-Hill, ISBN 978-0-07-338309-5

This is an introduction to mathematical methods used in studying problems of computer science. The topics covered include: mathematical logic; proof techniques, especially mathematical induction; set theory, functions, and relations; procedures, recursion, and operation counts; recurrence relations; analysis of algorithms; counting methods, permutations and combinations; graphs and trees.

There will be six home assignments (4% x 6=24%), four quizzes (4% x 4 = 16%), two midterm exams (15% x 2 = 30%) and a final exam (30%).

Exam 1: September 30, 2011, Friday, (in class)
Exam 2: October 28, 2011, Friday, (in class)
Final Exam on Thursday, 12/15/11 (7:30 AM-9:30 AM) in W128 CB

Letter grades will be assigned roughly as follows:

A+ = 95-100     B+ = 80-84      C+ = 65-69      D+ = 50-54      F = 0-39
A  = 90-94      B  = 75-79      C  = 60-64      D  = 45-49
A- = 85-89      B- = 70-74      C- = 55-59      D- = 40-44

The instructor reserves the right to make minor modifications in the grading scale.

First day handout
Some trivial details
Frequently asked questions
Tentative Course Plan

Homework 1 Assigned 9/9, due 9/16
Homework 2 Assigned 9/16, due 9/23
Homework 3 Assigned 10/7, due 10/14
Homework 4 Assigned 10/21, due 10/28
Homework 5 Assigned 11/4. due 11/11
Homework 6 Assigned 11/18, due 11/30

August 22-26, 2011 Week 1. Introduction and Scope Read Chapters 1.1-1.3

August 29-September 2, 2011 Week 2. Logic and Proof Read Chapters 1.4-1.8

September 5-September 9, 2011 Week 3. Sets and Functions Read Chapters 2.1-2.3

September 12-September 16, 2011 Week 4. Sequence and Summation Read Chapters 2.4

September 19-September 23, 2011 Week 5. Algorithms and Complexity Read Chapters 3.1-3.3

September 26-September 30, 2011 Week 6. Integers and modular arithmetic Read Chapters 4.1, 4.3

October 3- October 7, 2011 Week 7. Modular arithmetic, cryptography Read Chapters 4.3 -- 4.6

October 10- October 14, 2011 Week 8. Induction and Recursion Read Chapters 5.1 -- 5.4

October 17- October 21, 2011 Week 9. Counting Read Chapters 6.1 -- 6.4

October 24- October 28, 2011 Week 10. Counting (continued) Read Chapters 6.1 -- 6.4

October 31- November 4, 2011 Week 11. Discrete Probability Read Chapters 7.1 -- 7.4

November 7- November 11, 2011 Week 12. Advanced Counting -- Relations Read Chapters 8.1 -- 8.2, 9.1 -- 9.6

November 14- November 18, 2011 Week 13. Graphs Read Chapters 10.1 -- 10.6

November 28- December 2, 2011 Week 14. Graphs (continued) Read Chapters 10.1 -- 10.6 Interesting facts about the Traveling Salesman Problem

December 5- December 9, 2011 Week 14. Trees Read Chapters 11.1 -- 11.4