Professional Documents
Culture Documents
Mathematical Excursions 4th Edition Aufmann Test Bank 1
Mathematical Excursions 4th Edition Aufmann Test Bank 1
a. (a) 4 verticles
(b) not connected
b. (a) 0 verticles
(b) connected
c. (a) 0 verticles
(b) not connected
d. (a) 4 verticles
(b) connected
e. (a) 2 verticles
(b) connected
ANSWER: d
a. (a) 6 verticles
(b) not connected
b. (a) 14 verticles
(b) connected
c. (a) 6 verticles
(b) connected
d. (a) 14 verticles
(b) not connected
e. (a) 10 verticles
(b) connected
ANSWER: c
a. (a) 7 verticles
(b) connected
b. (a) 7 verticles
(b) not connected
c. (a) 8 verticles
(b) not connected
d. (a) 8 verticles
(b) connected
e. (a) 10 verticles
(b) not connected
ANSWER: b
4. The table below shows all the nonstop airline flights available between five cities. Draw a graph to represent the
information, where each vertex represents a city and each nonstop flight between two cities is represented by an edge.
a.
b.
c.
d.
ANSWER: b
9. Use the Greedy Algorithm to find a Hamiltonian circuit starting at vertex D in the weighted graph shown below.
10. Use the Edge-Picking Algorithm to find a Hamiltonian circuit in the weighted graph shown below. Give the path and
its total weight.
ANSWER: ;
THE END
HURST & COMPANY’S BOOKS FOR YOUNG PEOPLE
A Volume of Cheerfulness in Rhyme and Picture
KINDERGARTEN LIMERICKS
By FLORENCE E. SCOTT
Pictures by Arthur O. Scott with a Foreword by Lucy Wheelock
The book contains a rhyme for every letter of the alphabet, each
illustrated by a full page picture in colors. The verses appeal to the
child’s sense of humor without being foolish or sensational, and will
be welcomed by kindergartners for teaching rhythm in a most
entertaining manner.