1 .		Questions 1 through 4 refer to the following digraph. Vertex C has
2 .		Vertex D is
3 .		Which of the following is not a cycle in the digraph?
4 .		Suppose that the vertices of the digraph represent card players playing in a tournament and the arcs represent matches already played. An arc going from vertex X to vertex Y means that card player X beat card player Y. (No ties are possible in card games.) Which of the following statements [A), B), C), or D)] is not true?
5 .		Questions 5 through 9 refer to a digraph with 5 vertices (A, B, C, D, and E) and 7 arcs. A is incident to C and D and incident from B; B is incident from D and E; C is incident to D; and D is incident to E. Vertex B has
6 .		Vertex C has
7 .		How many cycles are there in the digraph that start and end at A?
8 .		How many cycles are there in the digraph that start and end at C?
9 .		Suppose that the vertices of the digraph represent individuals and there is an arc going from vertex X to vertex Y if and only if X “likes” Y. Which of the following statements [A), B), B), or D)] is not true?
10 .		Questions 10 through 15 refer to the project digraph in Figure 8.2. (The numbers in parentheses represent hours.) The number of tasks in the project is
11 .		The length of the critical path for the entire project is
12 .		Using the priority list C, F, G, E, B, A, D and the priority-list model to schedule this project with two processors results in a completion time of
13 .		Using the decreasing time algorithm to schedule this project with two processors results in a completion time of
14 .		Using the critical path algorithm to schedule this project with two processors results in a completion time of
15 .		The optimal completion time for this project using two processors is
Answer choices in this exercise are randomized and will appear in a different order each time the page is loaded.