MULTIPLE CHOICE.

Choose the one alternative that best completes the statement

or answers the question.
Use the figure below to answer the following question(s).

1) Which of the graphs has an Euler circuit?

A) Graph 2 only
B) Graph 1 only
C) Graphs 1 and 3
D) Graph 3 only
E) None of the above

2) Which of the graphs has an Euler path but no Euler circuits?

A) Graph 3 only
B) Graphs 1 and 2
C) Graph 2 only
D) Graph 1 only
E) None of the above

An undercover police officer is assigned the job of once a night walking each of
the 48 blocks of a certain section of town described by the street grid shown
below. The walk starts and ends at A. The officer wants to minimize the total
number of blocks he has to walk each night.

3) How many vertices of odd degree are there in the graph representing this problem?
A) 22
B) 20
C) 18
D) 24
E) None of the above

4) An optimal eulerization of the graph representing this problem can be obtained by adding
A) 12 edges.
B) 10 edges.
C) 11 edges.
D) 9 edges
E) None of the above

5) An optimal semi-eulerization of the graph representing this problem can be obtained by

adding
A) 12 edges.
B) 10 edges.
C) 11 edges.
D) 9 edges
E) None of the above

6) In an optimal trip through the neighborhood, what are the number of streets the officer
will walk down more than once?
A) 9 streets
B) 11 streets
C) 12 streets
D) 10 streets
E) None of the above

Use the figure below to answer the following question(s).

7) In the graph we start at vertex A and travel to C. If we are using Fleury's algorithm, which
vertex will we not travel to next?

A) B
B) D
C) E
D) We can travel to either B, D, or E.
E) None of the above

8) The number of paths from A to F is

A) 3.
B) 6.
C) 8.
D) 1.
E) None of the above

Solve the Problem.

9) In a complete graph with 12 vertices (A through L), the total number of Hamilton circuits
(including mirror-image circuits) that start at vertex A is
A) 11!.
B) 10!.
C) 12!.
D) 13!.
E) None of the above

10) The following graph

A) has several Hamilton circuits, all of which contain the edge AD.
B) has no Hamilton circuit.
C) has a single Hamilton circuit (and its mirror-image circuit).
D) has several Hamilton circuits, none of which contain the edge BC.
E) None of the above

A delivery truck must deliver packages to 5 different store locations (A, B, C, D,

and E). The trip must start and end at A. The graph below shows the distances (in
miles) between locations. We want to minimize the total distance traveled.

11) How many Hamilton circuits would we have to check if we use the repetitive nearest
neighbor algorithm?
A) 12
B) 4
C) 5
D) 30

E) None of the above

12) The nearest-neighbor algorithm applied to the graph yields the following solution:
A) A, E, C, D, B, A.
B) A, D, B, E, C, A.
C) A, B, C, D, E, A.
D) A, C, D, B, E, A.
E) None of the above

13) The cheapest-link algorithm applied to the graph yields the following solution:
A) A, C, D, B, E, A.
B) A, D, B, E, C, A.
C) A, E, C, D, B, A.
D) A, B, C, D, E, A.
E) None of the above

Solve the Problem.

14) The brute-force algorithm for solving the Traveling Salesman Problem is
A) an approximate and efficient algorithm.
B) an approximate and inefficient algorithm.
C) an optimal and inefficient algorithm.
D) an optimal and efficient algorithm.
E) None of the above

Solve the problem.

15) Which of the following four graphs is a tree?

A) Graph 1 and Graph 4

B) Graph 1 and Graph 3
C) Graph 2 and Graph 3
D) Graph 2 and Graph 4
E) None of the above

16) Suppose T is a tree with 21 vertices. Then

A) T has no bridges.
B) T has one bridge.
C) T has 20 bridges.
D) T can have any number of bridges.
E) None of the above

17) How many spanning trees does the following graph have?

A) 4
B) 8
C) 3
D) 5
E) None of the above

The question(s) that follow refer to the problem of finding the minimum spanning
tree for the weighted graph shown below.

18) Using Kruskal's algorithm, which edge should we choose second?

A) CD
B) AB
C) AC

D) BD
E) None of the above

19) Using Kruskal's algorithm, which edge should we choose third?

A) AC
B) CD
C) AB
D) BD
E) None of the above

20) The total weight of the minimum spanning tree is

A) 60.
B) 34.
C) 39.
D) 49.
E) None of the above

MULTIPLE CHOICE. Choose the one alternative that best completes the statement
or answers the question.
1) D

2) D

3) B

4) A

5) A

6) C

7) C

8) B

9) A

10) A

11) C

12) D

13) D

14) C

15) B

16) C

17) A

18) C

19) D

20) C