Exam 8: The Mathematics of Scheduling: Chasing the Critical Path

A project consists of six tasks labeled A through F. The table shown below gives the processing times and precedence relations for the tasks. Construct the project digraph. -Consider the project shown above; use the priority list A, B, C, D, E, F to find the project finish time fin using N = 2 processors.

-Consider the project from problem 6; use the priority list A, B, C, D, E, F to find the project finish time fin using N = 2 processors.

Consider the project digraph shown below; what is the critical time for vertex D?

A project consists of six tasks labeled A through F . The table shown below gives the processing times and precedence relations for these tasks. Construct the project digraph.

Which of the digraphs below have an arc set of A = {GH, GO, GT, HO, HT, TO, OS}?

A project consists of seven tasks labeled A through G. The table shown below gives the processing times and precedence relations. Which project digraph represents this situation? -Consider the project shown above ; use the priority list B, D, F, E, A, G, C to find the project finish time fin using N = 3 processors.

-Consider the digraph shown above ; which vertices, if any, are incident to I?

Consider the project digraph shown below; apply the decreasing-time algorithm to find the project finish time fin using N = 2 processors.

-Consider the digraph shown above ; what is the outdegree of vertex A?

The catalog at your college gives the following information regarding math classes. A prerequisite for Calculus III is Calculus II. A prerequisite for Calculus II is Calculus I. Linear Algebra can only be taken after both Calculus II and Fundamentals of Mathematical Proofs have been taken. A prerequisite for Fundamentals of Mathematical Proofs is Calculus I. In order to take Real Analysis I, a student must have completed Calculus III and Linear Algebra. A prerequisite for Real Analysis II is Real Analysis I. Draw a digraph which models the relationships between the math classes Calculus I, Calculus II, Calculus III, Fundamentals of Mathematical Proofs, Linear Algebra, Real Analysis I, and Real Analysis II.

-Consider the digraphs shown above ; how many vertices from the digraph shown in figure 2 are incident to vertex O?

-Consider the digraph shown above ; which vertices, if any, are incident to E?

Consider the project digraph shown below; apply the decreasing-time algorithm to find the project finish time fin using N=2 processors.

A project consists of six tasks labeled A through F. The table shown below gives the processing times and precedence relations for the tasks. Construct the project digraph.

Consider the project digraph shown below; apply the critical-path algorithm to find the project finish time fin using N = 2 processors.

Consider the project digraph shown below; apply the decreasing-time algorithm to find the project finish time fin using N = 2 processors.

-Consider the digraphs shown above ; which of the digraphs have an outdegree of 3 at vertex G?

-Consider the project digraph shown above; apply the critical-path algorithm to find the project finish time fin using N = 3 processors.

Consider the project digraph shown below; what is the critical time for vertex A?

In a project, which of the following relations is true?