Sukumar Ghosh, 201P Maclean Hall, 319-335-0738, sukumar-ghosh@uiowa.edu
Class meeting time: 11:00A - 12:15P Tusdays and Thursdays in 118 MLH
Semester hours: 3
Office hours: 2:30-4:00P Tusdays and Thursdays, or by appointment

Robert Robinson, robert-r-robinson@uiowa.edu, office: 201N MLH
Office hours: Mondays 9.00-10.30 AM and Fridays 1.00-2.30 PM

Discrete Mathematics and Its Applications (8th Edition), by Rosen, McGraw-Hill, the e-Text will be made available to all registered students via ICON Direct from the ICON course website.

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

There will be six home assignments (3% x 6=18%), four quizzes (5% x 4 = 20%), two midterm exams (16% x 2 = 32%) and a final exam (30%). Quizzes and midterm examinations will be held during the class period. The duration of each quiz is 15 minutes and will be given at the beginning of the class period.

Exam 1: October 1, 2019, Tuesday (in class)
Exam 2: October 29, 2019, Tuesday (in class)
Final Exam date, tima and place will be announced later

Letter grades will be tentatively assigned as follows:

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

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

Course webpage http://www.cs.uiowa.edu/~ghosh/1919.html

Assignments will be posted on ICON/CANVAS, and completed assignments must be submitted via ICON/CANVAS. Late assignments will not be accepted without prior approval.

Please follow this link for CLAS Teaching Policies and Resources

August 26-30, 2019 Week 1. Introduction and Scope Read Chapters 1.1-1.3

September 3-6, 2019 Week 2. Logic and Proof Read Chapters 1.4-1.8

September 9-13, 2019 Week 3. Sets and Functions Read Chapters 2.1-2.3

September 16-20, 2019 Week 4. Sequences and Sums Read Chapters 2.4-2.5

September 23-27, 2019 Week 5. Algorithms and Complexity Read Chapters 3.1-3.3

September 30-October 11, 2019 Weeks 6 and 7. Modular Arithmetic and Cryptography Read Chapters 4.1-4.6

October 14-18, 2019 Week 8. Induction and Recursion Read Chapters 5.1-5.4

October 21-25, 2019 Week 9. Counting: Permutation and Combination Read Chapters 6.1-6.5

November 4-15, 2019 Week 11-12. Discrete Probability Read Chapters 7.1-7.4

November 18-22, 2019 Week 13. Advanced Counting Read Chapters 8.1-8.3, 8.5

December 2-6, 2019 Week 14. Relations Read Chapters 9.1-9.6

December 9-13, 2019 Week 15. Graphs and Trees Read Chapters 10, 11