ECS 20 (Prof. Franklin, Winter 2016)
Lectures: MWF 1:10pm-2pm (100 Hunt)
Discussion Sections: T
5:10-6pm, F 9am-9:50am, M 9am-9:50am, W 5:10pm-6pm
TA's: Carlos
Rojas crojas@ucdavis.edu (.5) , Liangtong Xia ltxia@ucdavis.edu (.5),
Shaopeng Zhu spzhu@ucdavis.edu (.25)
Office Hours (Franklin): W 11am-1pm (3021 Kemper)
Office Hours (Liangtong Xia): W 7pm-9pm, F 8am-9am, F 10am-11am (53 Kemper)
Office Hours (Carlos Rojas): M 10am-1pm (67 Kemper)
Office Hours (Shaopeng Zhu): F 4:15pm-6:15pm (55 Kemper)
Final Exam: Sat 19 March 8am-10am
Textbooks: The main textbook for this course is "Discrete
Mathematics with Ducks" (1st ed.), Sarah-Marie Belcastro, CRC Press,
2012.
Grade: Your grade will based on homework assignments (15%), one
in-class midterm (35%), and a final exam (50%). The midterm and final
will be closed-book and closed-notes. The date of the midterm is
tentatively scheduled for Wed 10 Feb 2016, and is tentatively planned
to cover Chapters 1-3.
Discussion Section Guidelines There will be no discussion
section on Monday 4 January. It is not required that you attend your
discussion section. They are intended as a supplement for students
that want more coverage of a topic. If you do decide to go to
discussion section, you can go to any one of them that you find
convenient, as long as it doesn't get too crowded in any particular
classroom.
Homework Assignments: The homework assignments can be found
here. Don't wait until the last
moment to start work on the homework problems. Due to the large
number of students, we cannot accept late homeworks. We will factor
in from your other graded work if you have to miss a homework for a
valid reason (like an extended illness with a doctor's note).
Homework Guidelines: Students may work on homework assignments
in groups, but ach student must turn in his or her own write-up of
each solution for each problem (in his or her own words, not copying
from other students or any other source). Violating this guideline
would be considered cheating, and may result in disciplinary action of
some kind. Violating this guideline is also likely to make it much
harder to prepare for the midterm and final.
Tentative Syllabus: Each chapter should take about two or three lectures:
Chapt 1 (Counting and Proofs): 1.1-1.5
Chapt 2 (Sets and Logic): 2.1-2.5
Chapt 3 (Graphs and Functions): 3.1-3.7
Chapt 4 (Induction): 4.1-4.2
Chapt 5 (Algorithms with Ciphers): 5.1-5.4
Chapt 6 (Binomial Coefficients and Pascal's Triangle): 6.1-6.8
Chapt 7 (Balls and Boxes and PIE: Counting Techniques): 7.1-7.5
Chapt 8 (Recurrences): 8.1-8.3
Chapt 10 (Trees): 10.1-10.4