Professional Documents
Culture Documents
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
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
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
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
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
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
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.
D) BD
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