1 .		Questions 1 to 7 refer to a graph with 5 vertices (A, B, C, D, and E) and 9 arcs. A is incident from C, D, and E; B is incident to D and E and incident from C; D is incident to C and incident from E. Vertex A has
2 .		Questions 1 to 7 refer to a graph with 5 vertices (A, B, C, D, and E) and 9 arcs. A is incident from C, D, and E; B is incident to D and E and incident from C; D is incident to C and incident from E. Vertex E has
3 .		Questions 1 to 7 refer to a graph with 5 vertices (A, B, C, D, and E) and 9 arcs. A is incident from C, D, and E; B is incident to D and E and incident from C; D is incident to C and incident from E. Vertex D is
4 .		Questions 1 to 7 refer to a graph with 5 vertices (A, B, C, D, and E) and 9 arcs. A is incident from C, D, and E; B is incident to D and E and incident from C; D is incident to C and incident from E. Which of the following is not a path from vertex B to vertex A in the digraph?
5 .		Questions 1 to 7 refer to a graph with 5 vertices (A, B, C, D, and E) and 9 arcs. A is incident from C, D, and E; B is incident to D and E and incident from C; D is incident to C and incident from E. How many cycles are there in the diagraph that start and end at A?
6 .		Questions 1 to 7 refer to a graph with 5 vertices (A, B, C, D, and E) and 9 arcs. A is incident from C, D, and E; B is incident to D and E and incident from C; D is incident to C and incident from E. How many cycles are there in the digraph that start and end at B?
7 .		Questions 1 to 7 refer to a graph with 5 vertices (A, B, C, D, and E) and 9 arcs. A is incident from C, D, and E; B is incident to D and E and incident from C; D is incident to C and incident from E. 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), C), or D)] is not true?
8 .		Questions 8 to 13 refer to the following project digraph. (The numbers in parentheses represent hours.) The number of tasks in the project is
9 .		Questions 8 to 13 refer to the following project digraph. (The numbers in parentheses represent hours.) The number of direct precedence relations in the project is
10 .		Questions 8 to 13 refer to the following project digraph. (The numbers in parentheses represent hours.) The length of the critical path from B is
11 .		Questions 8 to 13 refer to the following project digraph. (The numbers in parentheses represent hours.) The length of the critical path for the entire project is
12 .		Questions 8 to 13 refer to the following project digraph. (The numbers in parentheses represent hours.) Using the priority list C, E, G, F, B, A, D and the priority-list model to schedule this project with two processors results in a completion time of
13 .		Questions 8 to 13 refer to the following project digraph. (The numbers in parentheses represent hours.) The optimal completion time for this project is
14 .		The decreasing time algorithm is
15 .		A project consists of all independent tasks. If we schedule the project with six processors, then the critical path algorithm always gives
Answer choices in this exercise are randomized and will appear in a different order each time the page is loaded.