Finite Math A
Chapter 5 Assignments/Schedule
“The Mathematics of Getting Around”
Pd 2, 6
Wed
9/2 B
*1 hr
delay*
Fri
9/4 A
Pd 4,7
Thurs
9/3 C
Tues
9/8 B
Fri
9/11 A
Mon
9/14 B
Wed
9/16 A
5.1 Euler Circuit Problems
5.2 What is a Graph
5.3 Graph Concepts and
Terminology
Supplement: Adjacency Matrix
HW 5A: pg 191-193
#2c, #4c, #6, #8, #12, #16a
Thurs
9/10 C
Mon
9/14 B
5.4 Graph Models
5.5 Euler Theorems
5.6 Fleury’s Algorithm
5.7 Eulerizing Graphs
Tues
9/15 C
Thurs
9/17 B
Review Chapter 5
HW 5C: pg 193-194
#17, #18, #19, #24ab, #26ab, #28ab
Worksheet 5D: Finding Euler Circuits
and Paths
Worksheet 5E: Eulerizing Graphs
*DUE AT END OF CLASS
TOMORROW*
Chapter 5 Study Guide
Tues
9/8 B
Test Chapter 5
Worksheet 5B: Adjacency Matrix
*DUE AT END OF PERIOD*
**EXTRA CREDIT DUE BY 3PM TODAY**