CS2210:0001 Discrete Structures
Fall 2018

Instructor

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: 3:00-4:30P Tusdays and Thursdays, or by appointment

Teaching Assistants

To be announced.

Textbook

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

Course Outline

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.

Tests and assignments

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 a class period. One of the four quizzes will not be announced ahead of time.

Examination Schedule

Exam 1: September 25, 2018, Tuesday (in class)
Exam 2: October 23, 2018, Tuesday (in class)
Final Exam date will be announced later

Letter grades will be tentatively assigned roughly 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/1918.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.

The College of Liberal Arts and Sciences Teaching Policies

Please follow this link for CLAS Teaching Policies and Resources

Lecture Notes

August 20-24, 2018
Week 1. Introduction and Scope
Read Chapters 1.1-1.3
August 27-31, 2018
Week 2. Logic and Proof
Read Chapters 1.4-1.8
September 4-7, 2018
Week 3. Sets and Functions
Read Chapters 2.1-2.3
September 10-14, 2018
Week 4. Sequences and Sums
Read Chapters 2.4-2.5
September 17-21, 2018
Week 5. Algorithms and Complexity
Read Chapters 3.1-3.3
September 24-October 5, 2018
Weeks 6-7. Modular arithmetic, prime numbers, cryptography
Read Chapters 4.1-4.6
October 8-12, 2018
Week 8. Induction and Recursion
Read Chapters 5.1-5.4
October 15-19, 2018
Weeks 9-10. Counting
Read Chapters 6.1-6.5
October 29-November 2, 2018
Week 11. Discrete Probability
Read Chapters 7.1-7.4
November 6-10, 2018
Week 12. Advanced Counting: Recurrence relation
Read Chapters 8.1-8.2, 8.5
November 13-17, 2018
Week 13. Relations
Read Chapters 9.1-9.3
November 27-30, 2018
Week 14. Graphs
Read Chapters 10.1-`10.8
December 3-7, 2018
Week 15. Trees
Read Chapters 11.1-11.5