Math Review Accountability Quiz

1

• Math Review Accountability Quiz
• Day 1
• Determine whether the graph is connected or
  nonconnected
• 2) Determine whether the vertex B is even or odd
• Determine whether the graph can be traced
• If the graph is Eulerian, find an Euler circuit.
  If it is not Eulerian, first Euleraize it, then
  find an Euler Circuit.
• 5) Represent the following with a graph

2
Todays Objective 10/7/2009

• SWBAT be ready for the Hamilton Circuit/Directed
  Graph test, and will pass the test with 80
  accuracy

3

• Math Review v
• Anticipatory Set
• Go over homework
• Review Algorithms
• Review Directed Graphs
• Closure

4
Anticipatory Set

• Hamilton Path
• Hamilton Circuit
• Complete Graph
• Weights
• Weighted Graph
• Weight of a path
• Directed Edge
• Directed Graph
• Directed path from X to Y.
• Length

5

• Math Review v
• Anticipatory Set v
• Go over homework
• Review Algorithms
• Review Directed Graphs
• Closure

6
Homework Review

• Pg 177 20
• Four news organizations made public a top secret
  report. The following graph indicates how this
  information could have passed among the four news
  organizations. Determines which organization
  first obtained this report

7
Homework Review

• Pg 177 22
• The following directed graph models the spread of
  a flu virus among a group of passengers on a
  cruise ship. Are there any people who could have
  introduced the flu to the group?

Yvonne
Amy
Rick
Luis
Ben
8
Homework Review

• Pg 177 24
• An amber alert emergency broadcast system has
  been set to transmit messages among several
  cities. The following table indicates how this
  system has been set up. Draw a directed graph
  modeling this emergency network. Can a message
  originate in one city and spread throughout the
  network?

9

• Math Review v
• Anticipatory Set v
• Go over homework v
• Review Algorithms
• Review Directed Graphs
• Closure

10
Review Algorithms

• Break into 3 groups of 9
• Each group will be assigned an algorithm
• Find the Minimum Hamilton Circuit with your
  algorithm
• Draw the graph and write your circuit on the
  poster paper, showing how you got that circuit
• Post paper
• Gallery walk to see other groups work

11
Group graph
Start the circuit at vertex A
12

• Math Review v
• Anticipatory Set v
• Go over homework v
• Review Algorithms v
• Review Directed Graphs
• Closure

13
Directed Graphs

• In a round robin singles pool tournament, each of
  six competitors plays each other once. The
  results of the tournament are shown in the
  following table.
• Use a directed graph to model this situation and
  determine a ranking order for the players using
  one and two stage dominance

14
Guided Practice

• Pg 184 7-13

15
Closure

• Last minute questions?
• Homework Page 184 7-13