This page, http://www.cs.uiowa.edu/~hzhang/c19/, is always under construction.

Grades of C- or higher in Computer Science I.

Instructor:
Hantao Zhang
Office: 201B MLH Email: hzhang@cs.uiowa.edu Tel: 353 2545 Office hours: MWF, 1:00-2:00pm |
Teaching assistant:
Stanley Ziewacz
Office: 201C MLH Email: sziewacz@cs.uiowa.edu Tel: 353 2546 Office hours: Tu, 10:00-11:30am. Th, 9:00-10:45am, 201C MLH |

Attention

The final exam will be 2:15-4:15pm, Wednesday, December 16, 2009, in the classroom.

Please use
ICON
to check your scores.

I need to hear from anyone who has a disability, which may require some modification of seating, testing or other class requirements so that appropriate arrangements may be made. Please contact me during my office hours.

FOR ALL THE POLICIES THAT ARE NOT MENTIONED HERE, PLEASE SEE THE WEBPAGE FOR UNDERGRADUATE OF THE DEPARTMENT OF COMPUTER SCIENCE . PLEASE ALSO SEE THE WEBPAGE OF COLLEGE OF LITERAL ARTS AND SCIENCE .

- Discrete Mathematics with Applications 3/E, by Susanna Epp, published by Thomson/Cengage, ISBN:0-534-35945-0 Errata Link

Students should be prepared to put in considerable time and effort into reading to become familiar with these topics and gain experience with these techniques. At the end of the semester, students should have the knowledge required to identify areas which they would like to investigate in more depth in related courses.

LATE-DUE HOMEWORK ARE NOT ACCEPTED.

- Homework 1: (due 09/04/09)

page 16: 13, 26, 28, 43, 46, 49, 51;

page 27-28: 15, 31, 41, 42.

- Homework 2: (due 09/14/09)

page 41-42: 9, 23, 29, 30, 42

page 55-56: 17, 19, 25, 32

page 73: 21.b, 34, 36.

- Homework 3: (due 09/21/09)

page 86-88: 8(b,c), 10, 18(c,d), 22(b), 27;

page 96-97: 8, 10, 12, 25, 45,

page 108-110: 9(b), 12(b, e, f), 27, 29, 43(b).

- Homework 4: (due 10/05/09)

page 226-227: 2, 7, 11, 16;

page 233-234: 10, 17, 21, 28;

page 242-243: 2, 5.

- Homework 5: (due 10/12/09)

page 267-268: 11, 19(b,c), 21(b-f), 25, 28(c);

page 281-282: 13, 21(b), 29.

- Homework 6: (due 10/23/09)

page 290-292: 7, 8, 19, 27, 39(d);

page 304-306: 14(b,c), 22;

page 318-320: 7, 14(c,e), 16.

- Homework 7: (due 11/6/09)

page 582-583: 10(b,c);

page 592-594: 16, 17, 25, 28, 35, 46, 48.

- Homework 8: (due 11/13/09)

page 507-509: 7(b), 9, 11, 14, 16, 18, 21, 24.

- Homework 9: (due 11/20/09)

page 608-610: 9, 12, 24, 29, 40, 42;

page 646-648: 7, 16, 17(b), 20.

- Homework 10: (due 12/07/09)

page 664: 40;

page 680-682: 11, 22, 24, 47;

page 696-697: 4(b)(d), 21;

page 703-704: 4, 17, 24.

There will be two midterm exams and one final exam. All midterms will be held during class time.

You are expected to study all the material in each chapter covered in the readings even if that material is not explicitly discussed in class or in the homework. You are also expected to study the extra material presented in class which is not in the textbook. Material presented in class, but not in the book may appear on tests.

The lecture notes are a supplement to the course textbook. They
are supposed to help you understand the textbook material better,
*they are not a replacement for either the textbook or the lecture
itself*.

- Ch01: The Logic of Compound Statements 3-in-1 PDF
- Ch01b: The Logic of Compound Statements 3-in-1 PDF
- Ch01c: The Logic of Compound Statements 3-in-1 PDF
- Ch02: The Logic of Quantified Statements 3-in-1 PDF
- Ch03: Proof methods 3-in-1 PDF
- Ch03: Number Theory 3-in-1 PDF
- Ch04: Sequences and Summation 3-in-1 PDF
- Ch04: Mathematical Induction 3-in-1 PDF
- Ch05: Set Operations 3-in-1 PDF
- Ch06: Counting 3-in-1 PDF
- Ch06: More on Counting 3-in-1 PDF
- Ch06: Discrete Probability 3-in-1 PDF
- Ch07: Functions 3-in-1 PDF
- Ch08: Recursion 3-in-1 PDF
- Ch10: Relations 3-in-1 PDF
- Ch10: Equivalence and Partial Orders 3-in-1 PDF
- Ch11: Graphs 3-in-1 PDF
- Ch11: Trees 3-in-1 PDF
- Ch11: Minimum Spanning Tree 3-in-1 PDF
- Ch11: Topological Sort and Graph Traversal 3-in-1 PDF
- Ch12: Regular Expressions and Finite-State Automata 3-in-1 PDF

Updated 08-18-2009