Return to course home page

Math 114. Discrete Structures. Fall 2019.

Tentative class schedule with homework assignments

This schedule is subject to change. Assignments shown in gray italics may change. The ones shown in black will not.

You are strongly encouraged to read ahead whenever you have time.

Most problems are worth 1 point each. Problems (usually long and/or tricky) that are worth 2 points are marked by *.

Important Deadlines
Sep 4Last day to add a course without instructor's permission
Sep 11Last day to drop a course online without permission
Sep 17Last day to drop a course a serious and compelling reason and without a "W" on the transcript
Nov 15Last day to drop a course with a serious and compelling reason
Date Read before class Chapter Sections covered or to be covered Homework due (by 2:00 pm) Optional
Aug 22 Introduction - First class
2 2.6 Matrices
Aug 27 4.1, 4.2 4 4.1 Divisibility and Modular Arithmetic
4.2 Integer Representations and Algorithms
Aug 29 4.3 4.3 Primes and Greatest Common Divisors
Sep 3 4.4, 4.5 4.4 Solving Congruences
4.5 Applications of Congruences
Sep 5 4.6, 5.1 5 4.6 Cryptography
5.1 Mathematical Induction		 Homework 1
2.6: 2, 4(ac), 10, 14, 26
4.1: 4, 10(def), 20,
4.2: 2(ab), 4(ab),
4.3: 4(abc), 14, 24(bd), 28, 33(ab), 40(abc)		 4.2: 8, 18, 19, convert 73453218 to its hexadecimal expansion and AB07B316 to its octal expansion
4.3: 22, 23
Sep 10 5.2, 5.3 5.2 Strong Induction and Well-Ordering
5.3 Recursive Definitions and Structural Induction
Sep 12 6.1 6 6.1 The Basics of Counting Homework 2
4.4: 4, 8, 10, 16, 20, 26
4.5: 15, 20(ab)
4.6: 4, 8
5.1: 20, 22, 32, 62, 78 		4.4: 18*,19*
5.1: 46 (may use 45), 54
Sep 17 6.2 6.2 The Pigeonhole Principle
Sep 19 6.3 6.3 Permutations and Combinations Homework 3
5.2: 10, 12, 14
5.3: 4, 8, 12, 18
6.1: 16, 22*, 26, 30, 34, 40		 Optional Problems on M.I.
5.2: 18
5.3: 36, 38
6.1: 44, 50
Sep 24 - Review
Sep 26 - Test 1 (sections 2.6-6.1)
Oct 1 6.4 6 6.4 Binomial Coefficients and Identities
Oct 3 6.5 6.5 Generalized Permutations and Combinations Homework 4
6.2: 4, 12, 14, 36
6.3: 10, 12, 14, 16, 22*, 24, 26, 28, 32		 Optional Problems on Pigeonhole Principle
6.3: 36, 42, 44
Oct 8 8.1 8 8.1 Applications of Recurrence Relations
Oct 10 8.2 8.2 Solving Linear Recurrence Relations Homework 5
6.4: 6, 8, 20, 22, 28
6.5: 10*, 12, 14, 18, 22, 24, 30, 40		 6.4: 10, 24, 30, 38
6.5: 20, 44, 46, 50, 62
Oct 15 8.5 8.5 Inclusion-Exclusion
Oct 17 8.6 8.6 Applications of Inclusion-Exclusion Homework 6
8.1: 8, 12, 14, 24
8.2: 4(ade), 12, 14, 20, 22		 8.1: 6, 10
8.2: 40
Oct 22 10.1, 10.2 10 10.1 Graphs and Graph Models
10.2 Graph Terminology and Special Types of Graphs
Oct 24 10.3 10.3 Representing Graphs and Graph Isomorphism Homework 7
8.5: 2, 6, 8, 12, 14, 16, 18
8.6: 4, 6, 10, 12, 14, 16, 26		 8.6: 18, 22, 24
Oct 29 - Review
Oct 31 - Test 2 (sections 6.2-8.6)
Nov 5 10.4 10 10.4 Connectivity
Nov 7 10.5 10.5 Euler and Hamilton Paths Homework 8
10.1: 16, 20
10.2: 6, 18, 20, 22, 26, 36, 40, 42(abcd), 60
10.3: 6, 18, 20, 36, 38		 10.2: 50, 64
10.3: 32*, 42, 44, 64
Nov 12 10.6 10.6 Shortest-Path Problems
Nov 14 10.7 10.7 Planar Graphs Homework 9
10.4: 12, 14, 18, 20, 24, 32, 34, 36
10.5: 4, 14, 18, 28, 34, 40, 62		 10.4: 22, 30, 46, 56
10.5: 48, 64
Nov 19 10.8 10.8 Graph Coloring
Nov 21 11.1 11 11.1 Introduction to Trees Homework 10
10.6: 2, 6(b), 8(c), 10(c)
10.7: 6, 8, 12, 16, 24, 26		 10.6: 18, 20
10.7: 18, 28, 36
Nov 26 11.2 11 11.2 Applications of Trees
Nov 28 Thanksgiving recess - no classes, no office hours
Dec 3 Review Homework 11
10.8: 4, 6, 12(for the graph in ex. 6), 20, 28
11.1: 2, 12, 14, 16, 18, 20
11.2: 2, 4		 10.8: 26
11.1: 24, 26
11.2: 20, 22, 24, 26*
Dec 5 Test 3 (sections 10.1-11.2)
Dec 10 Review
Dec 12 Consultation day. Office hours: 9:00 AM - 12:00 PM and 1:00 PM - 3:00 PM
Dec 13 Consultation day. Office hours: 10:00 AM - 11:30 AM
Dec 19 Final exam (cumulative): 3:30-5:30 pm.


 Return to course home page
This page was last revised on 8 December 2019.