ICS 6D – Discrete Mathematics

ICS 6D – Discrete Mathematics – Winter 2009

During the first two weeks, all adds and drops will be handled using the electronic add drop (EAD) system. (In other words, I will not sign add cards or drop cards during the first two weeks).
If for some reason you cannot add using EAD, contact me.
I will sign drop cards until the midterm, but you are responsible for making sure you can really drop or add the class at any time.

If you have questions about the course material, please send email to the instructor/TA given at the top of the page, but you have to include "ICS 6D" in the subject line, and include your full name in the first line of your message, i.e. “This is a question from [first name] [last name]”. By following these instructions, you will ensure that your email will get through our spam filters, and that we know who you are.

Course announcements will be sent via email to all students enrolled in the class. If you are not enrolled in the course or you are not receiving these announcements for some other reason, you can view the archive by clicking here. Also, let the TA know if you are not receiving these emails and he’ll add your email to the email list.

You can discuss and collaborate on homework and prepare for the midterms through the Noteboard created for this course. You should not post or copy solutions to homework problems on this noteboard, or through any other medium. That will amount to plagiarism and honor code violation, resulting in both the students who give and take help failing in this course.

Midterm Exam: Wed, Feb 11, in class, 1 - 1:50 pm.
Final Exam: Wed, Mar 18 1:30 - 3:30 p.m.
Quizzes will be on Wednesdays at the beginning of the class. The lowest quiz score will be dropped when computing your quiz grade. Missing a quiz gets zero points for that quiz.
Homework assignments will generally be due Monday at your discussion sections, on the Homework assignments webpage. Homework will be graded for completion and not correctness by default, although some chosen exercises will be graded for the actual correctness. You will be given solution sets for the homework for further study. The lowest homework score will be dropped when computing your homework grade.

[Rosen] Kenneth H. Rosen, Discrete Mathematics and Its Applications, 6th edition, McGraw Hill, 2003. (ISBN-10: 0-07-288008-2; ISBN-13: 978-0-07-288008-3). This book is required, and it should be available at the UCI bookstore.

List of topics, by week. Numbers in parentheses are sections from [Rosen]. Note that the following schedule is approximate.

Week 1: Logic (1.1), Propositional Equivalences (1.2); Predicates and Quantifiers (1.3)
Week 2: Nested Quantifiers (1.4); Rules of Inference (1.5)
Week 3: Sets (2.1, 2.2); Functions (2.3);
Week 4: Integers and Division (3.4); Primes and Greatest Common Divisors (3.5);
Week 5: Integers and Algorithms (3.6);
Week 6: Counting, Pigeonhole principle, (5.1, 5.2); Permutation and combination (5.3);
Week 7: Binomial coefficients (5.4); Generalized permutations and combinations (5.5);
Week 8: Mathematical and Strong Induction, and Well-ordering (4.1, 4.2);
Week 9: Recursive and Structural induction (4.3, 4.4); Recurrence relations (7.1);
Week 10: Solving linear recurrence relations (7.2); Divide and conquer (7.3).

Last modified: January 5, 2009