ECS 20 (Prof. Franklin, Fall 2012)

Lectures: 1:40pm-3:00pm Tues-Thurs (Haring 1227)
Discussion Section 20-A01: 9:00am-9:50am Thurs (Hoagland 168)
Discussion Section 20-A02: 3:10pm-4:00pm Fri (Cruess 107)
TA's: Julia Matsieva (jmatsieva@ucdavis.edu), Yu Liu (ywliu@ucdavis.edu)
Office Hours (Franklin): 10:00am-1:00pm Tues (Kemper 3021)
Office Hours (Matsieva): 10:00am-1:00pm Thurs (Kemper 053)
Office Hours (Liu): 1:00pm-3:00pm Fri (Kemper 053)
Final Exam: 3:30pm-5:30pm Mon 10 Dec

Textbooks: The textbook for this course is Schaum's Outline of Theory and Problems of Discrete Mathematics (3rd edition), Seymour Lipschutz, Marc Lipson. A list of typos in the textbook can be found here.

Grade: Your grade will based on four in-class quizzes (60%), and final exam (40%). The in-class quizzes are tentatively scheduled for Thurs 18 Oct (on Sections 1 and 2), Thurs 1 Nov (on Sections 3 and 4), Thurs 15 Nov (on Section 5 and 6), and Thurs 29 Nov (on Section 11 and the handout on Mathematical Induction). There will be homework assignments that are highly recommended that you complete, but which will not count towards your final grade.

Tentative Schedule:

Thurs 27 Sept, Tues 2 Oct: Set theory
Reading: Section 1 (all except 1.8)
Homework: 1.1, 1.2, 1.3, 1.4, 1.5, 1.6. 1.7, 1.9, 1.14, 1.15, 1.16, 1.17, 1.18, 1.19, 1.20

Thurs 4 Oct, Tues 9 Oct: Relations
Reading: Section 2 (all)
Homework: 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.7, 2.8, 2.9, 2.10, 2.13, 2.14, 2.15, 2.16, 2.18

Thurs 11 Oct, Tues 16 Oct, Thurs 18 Oct: Functions and Algorithms
Reading: Section 3 (all except 3.7).
Homework: 3.1, 3.3, 3.5, 3.6, 3.7, 3.15, 3.16, 3.17, 3.18, 3.19, 3.20, 3.24

Tues 23 Oct, Thurs 25 Oct: Logic and Propositional Calculus.
Reading: Section 4 (all).
Homework: 4.1, 4.2, 4.3, 4.4, 4.5, 4.6, 4.7, 4,8a, 4.9bc, 4.10, 4.15, 4.16, 4.17

Tues 30 Oct, Thurs 1 Nov, Tues 6 Nov: Techniques of Counting.
Reading: Section 5 (all).
Homework: 5.1, 5.2, 5.4, 5.5, 5.7, 5.8, 5.9, 5.10, 5.13, 5.14, 5.16, 5.20, 5.23, 5.24

Thurs 8 Nov: Recurrence Relations.
Reading: Section 6 (6.6-6.8 only).
Homework: 6.11, 6.31, 6.32

Tues 13 Nov, Thurs 15 Nov, Tues 20 Nov: Integer Algorithms, Mathematical Induction
Reading: Section 11 (11.1-11.6, handout on mathematical induction.
Homework: 1.24, 1.25, 11.1, 11.2, 11.4, 11.5, 11.8, 11.9. 11.14, 11.15, 11.19, 11.21

Tues 27 Nov, Thurs 29 Nov: Basic Probability.
Reading: Section 7 (7.1-7.3 only).
Homework: 7.1, 7.2, 7.3, 7.4, 7.5, 7.6, 7.7, 7.8, 7.9, 7.10, 7.11, 7.12, 7.13, 7.14

Tues 4 Dec: Basic Graph Theory.
Reading: Section 8 (8.2-8.4 only).
Homework: 8.1, 8.2, 8.3, 8.4, 8.5

Thurs 6 Dec:
Final Review.