MATH 2310 - Discrete Mathematics

Course Information

Course Description

The course provides the discrete portion of the mathematical background needed by students in electrical and computer engineering. Here is an (approximate) list of topics we are planning to cover (the numbers refer to sections in Rosen's book):

The grading will be based on several half-hour quizzes (40%), the midterm (20%), and the final exam (40%). Homework will be regularly assigned and discussed in class. Although the homework is not counted in grading, the quizzes and tests will consist of similar problems so doing it is very essential.

It is your responsibility to be aware of any changes in the syllabus announced in class. Students are responsible for all information given when they are absent.

It is University policy that no grade, including an incomplete, can be changed after one year. Exceptions must be authorized by the Academic Standing Committee.

All students without legitimate conflicts (approved by the instructor) will take the final exam at the scheduled time. Do not make travel plans that conflict with the final exam.

Homework:
Sep. 9: read Section 1.1 (pp.1-5); pp. 16-18, #2 (e,f), 3 (c,d), 5 (a,b,c,h), 7 (b,d), 17.
Sep. 10: read Sections 1.1, 1.2; pp. 17-19, #7 (f), 23, 27; p. 28, #9, 15.
Sep. 14: read Section 2.1; pp. 119-120, #1, 4, 12, 24, 29.
Sep. 16: read Section 2.2; pp. 130-132, #1-3, 29, 50-52.
Sep. 17: pp. 130-132, #18, 19, 30, 53; read Section 2.3 up to Example 5; p. 146, #1, 3, 7.
Sep. 21: read Section 2.3, Definitions 5, 7-10 and corresponding examples; pp. 146-147, #10-13, 17, 19 (a-c), 29-31.
Sep. 23: p. 147, #15, 16, 32, 35.
Sep. 24: read Section 11.1; p. 756, #1, 2, 5(a,b), 9, 10, 13.
Sep. 28: read Section 11.2; p. 760, #1, 3, 12-14.
Sep. 30: read Section 11.3; pp. 765-766, #1, 3, 6, 7, 8.
Oct. 1: read (relevant parts of) Section 2.4; pp. 161-162, #3, 7, 13, 15, 16, 19, 20.
Oct. 5: p. 162, #21, 23; read (relevant parts of) Section 4.1; pp. 279-280, #3-7.
Oct. 7: p. 280, #10, 15, 19, 21.
Oct. 8: p. 280, #13, 16, 23, 25; read Section 4.3 up to Example 6; p. 308, #1d), 3a), 12, 13, 15, 16.
Oct. 14: review Sections 4.1, 4.3; p. 280, #20, 22; p. 308, #14.
Oct. 15: read Section 5.1; pp. 344-345, #1, 7, 8, 11, 12, 16, 21.
Oct. 19: p. 345, #27, 31-33; read Section 5.3; pp. 360-361, #2, 3, 5, 6, 13, 17.
Oct. 21: pp. 361-362, #19, 20, 27, 30, 31.
Oct. 22: read Section 5.4; p. 369, #3, 4, 7, 9, 13-15.
Oct. 26: review the material in Chapters 1, 2 and 11 (including old homeworks and quizzes 1-3).
Oct. 28: review the material in Chapters 4 and 5 (including Section 5.4, old homeworks and quizzes 4-5).
Oct. 29: read Section 7.1; pp. 456-457, #1 (a,b), 5 (a-e), 9 (a, c, e, g).
Nov. 2: pp. 458-459, #25, 27, 29, 40, 41.
Nov. 4: pp. 457-459, #14, 42; read Section 7.2 (up to Example 5 inclusive); p. 471, #3(c,d,e), 4(a,b).
Nov. 5: p. 471, #3(f), 4(c,d,e,f), 7, 8, 11.
Nov. 9: read Section 7.5; pp. 504-505, #1, 3, 5, 10, 11, 13, 17, 18.
Nov. 12: read Section 7.6; p. 513, #5, 6, 8, 9, 13, 15, 25, 26.
Nov. 16: read Section 9.1; pp. 596-597, #13, 15, 21.
Nov. 18: review sections 7.2, 7.5, 7.6.
Nov. 19: read Section 9.2; pp. 608-610, #1, 5, 13, 23, 25, 26, 29, 31-33.

Quizzes and tests:
Quiz 1: Thursday, Sep. 17 (on Logic, Sets, sections 1.1, 1.2, 2.1, 2.2). Solutions.
Quiz 2: Thursday, Sep. 24 (on Set Operations, Functions, sections 2.2, 2.3). Solutions.
Quiz 3: Thursday, Oct. 1 (on Boolean Algebra, sections 11.1, 11.2). Solutions.
There will be no quiz on October 8.
Quiz 4: Thursday, Oct. 15 (on Summations, Mathematical Induction, Recursive Definitions, sections 2.4, 4.1, 4.3). Solutions.
Quiz 5: Thursday, Oct. 22 (on Basics of Counting, Permutations and Combinations, sections 5.1, 5.3). Solutions.
Midterm: Thursday, Oct. 29 (on all the topics covered so far). Solutions.
Quiz 6: Thursday, Nov. 5 (on Recurrence Relations, section 7.1). Solutions.
There will be no quiz on November 12.
Quiz 7: Thursday, Nov. 19 (on Recurrence Relations, Inclusion-Exclusion Principle, sections 7.2, 7.5, 7.6). Solutions.

GRADES