Textbook: Linear and Discrete Mathematics
(excerpts from books by Goodaire, Parmenter, Kolman and Hill)
Custom edition for the Georgia Institute of Technology
Pearson/Prentice Hall (ISBN 0-536-50344-3)
Date Chapter.Section/Topics or Page/Suggested Problems (* = hard)
M Jan 7 5.1 Mathematical Induction.
T 8 Problems: pp. 156-7, # 4, 5, 8
W 9 5.1 Strong Induction and Well Ordering
Th 10 Problems: pp. 158-9, # 16, 26*, 39*, 40
F 11 5.1 Divisibility, Prime Divisors
M 14 5.2 Recursive Definitions
T 15 Problems: pp. 167-170, # 1, 5, 6, 30, 45, 48, 50, 53
W 16 5.3 Two Term Recurrence Relations
Th 17 Problems: pp. 174-176, # 1, 7, 20, 23
F 18 8.2 Rates of growth: O() and o() notation.
M 21 *** holiday (Martin Luther King Day) no class ***
T 22 Problems: pp. 263-265, # 2, 5, 7, 13, 21, 24*
W 23 6.1 Counting; Inclusion Exclusion
Th 24 Problems: pp. 190-192, # 5, 10, 11; pp. 198-9, # 14, 20, 21
F 25 6.2 Tree Diagrams; Multiplication Principle
M 28 *** first examination ***
T 29 Problems: pp. 209-210, # 1, 3, 10, 16
W 30 7.1 and 7.2 Permutations and Combinations
Th 31 Problems: pp. 214-6, # 1, 3, 11, 21, 23, 25
F Feb 1 7.7 Binomial Coefficients and Binomial Theorem
M 4 5.4 and 7.7 Negative Binomial Coefficients. Extended Pascal Triangle
T 5 Problems: pp. 244-245, # 1, 5, 13, 14, 18, 22, 23*
W 6 7.4 Basic Probability Theory
Th 7 Problems: pp. 222-223, # 1, 3, 5, 16, 19, 29, 32
F 8 7.5 Counting in Probability
M 11 5.4 Generating Functions for Sums
T 12 Problems: pp. 235-6, # 1, 4, 14, 18
W 13 5.4 Generating function for partitions
Th 14 Problems: pp. 181-183, # 1, 2, 4, 9
F 15 9.1 and 11.2 Graphs and Digraphs (progress report due)
M 18 9.2 Paths, Cycles
T 19 Problems: pp. 287-8, # 6, 8; pp. 294-6, # 10, 12, 21, 22, 25
W 20 9.2 Adjacency Matrix; Transitive Closure
Th 21 Problems: pp. 299-301, # 1, 4, 6, 8
F 22 9.3 Graph Isomorphisms
M 25 10.1 Euler Cycles and Paths
T 26 Problems: pp. 309-311, # 1, 3, 9, 25
W 27 10.2 Hamiltonian Cycles & Paths
Th 28 Problems: pp. 317-319, # 1, 6, 12, 14, 23
F 29 12.1 Trees (Final drop date)
M Mar 3 12.2 Spanning Trees
T 4 Problems: pp. 377-9, # 2, 6, 10, 16; pp. 383-4, # 3, 10
W 5 8.1; 12.3-5 Algorithms; Depth First and Breadth-First Search
Th 6 Problems: pp. 390-3, # 1, 2; pp. 402-3, # 1, 6, 11
F 7 13.1 Planar Graphs
M 10 13.2 Graph Coloring; Bipartite graphs
T 11 Problems: pp. 417-9, # 1, 3, 4, 20
W 12 13.2 Chromatic Polynomial
Th 13 Problems: pp. 425-427, # 2, 4, 8, 11, 15, 27
F 14 *** second examination ***
M 17 *** holiday (Spring Recess) no class ***
T 18 *** holiday (Spring Recess) no class ***
W 19 *** holiday (Spring Recess) no class ***
Th 20 *** holiday (Spring Recess) no class ***
F 21 *** holiday (Spring Recess) no class ***
M 24 2.1-2.2 Row Echelon Forms, Augmented Matrices, Elementary Operations
T 25 Problems: pp. 94-5, # 1, 3, 5
W 26 2.1-2.2 Gaussian Elimination and Back Substitution (GEBS Algorithm)
Th 27 Problems: pp. 113-7, # 8, 9, 13
F 28 2.1-2.2 Gauss-Jordan Reduction (GJR Algorithm)
M 31 2.1-2.2 Complexity Analysis for the GEBS Algorithm
T Apr 1 Problems: pp. 450-3, # 5, 6, 11, 15, 28, 30, 32
W 2 7.1 Eigenvalues and eigenvectors
Th 3 Problems: pp. 461-2, # 6, 10, 15
F 4 7.2 Similarity and Diagonization
M 7 7.2 Projection Matrices for Eigenspaces
T 8 Problems: p. 462, # 18, 25 26, 27
W 9 *** third hour exam ***
Th 10 Problems: pp. 41-2, # 1, 2, 3
F 11 1 & 2.1-2 Linear Programming
M 14 3.1 Linear Programming
T 15 Problems: p. 43, # 4, 5
W 16 3.2 Simplex Algorithm; Slack Variables
Th 17 Problems: p. 44, # 6, 7
F 18 3.2 Simplex Algorithm; Basic Tableaux
M 21 4.1 Artificial Variables (big M method)
T 22 Problems: p. 44, # 8, 9
W 23 4.1 Artificial Variables (two-phase method)
Th 24 Problems: Review for final.
F 25 Review (Last day of classes)
Final exam: Wednesday, 30 April 2008 at 2:50-5:40 p.m. in Skiles 249.
Be aware that the tentative final exam information available on the Registrar web site is subject to change.
homepage for Belinfante's Math 2602.
Revised: 2008 March 24