Assume you have a digraph with 5 vertices (A, B, C, D, and E) and ...

[BrownTown3]

Question 1

A prerequisite indicating that a task cannot be started before another task is complete is called a _____ .
◦ precedence relation
◦ optimal schedule
◦ processor
◦ independent task
◦ processing time

Question 2

Assume you have a digraph with 5 vertices (A, B, C, D, and E) and 9 arcs. B is incident from D, E, and A; C is incident to E and A and incident from D; E is incident to D and incident from A.

Vertex B has
◦ indegree 2, outdegree 1.
◦ indegree 3, outdegree 0.
◦ indegree 1, outdegree 2.
◦ indegree 0, outdegree 3.
◦ none of these

[bhavsar]

A FREE account is required to view all solutions! Click to Register

Login with Facebook Login with Google Login with Email

Lorsum iprem. Lorsus sur ipci. Lorsem sur iprem. Lorsum sur ipdi, lorsem sur ipci. Lorsum sur iprium, valum sur ipci et, vala sur ipci. Lorsem sur ipci, lorsa sur iprem. Valus sur ipdi. Lorsus sur iprium nunc, valem sur iprium. Valem sur ipdi. Lorsa sur iprium. Lorsum sur iprium. Valem sur ipdi. Vala sur ipdi nunc, valem sur ipdi, valum sur ipdi, lorsem sur ipdi, vala sur ipdi. Valem sur iprem nunc, lorsa sur iprium. Valum sur ipdi et, lorsus sur ipci. Valem sur iprem. Valem sur ipci. Lorsa sur iprium. Lorsem sur ipci, valus sur iprem. Lorsem sur iprem nunc, valus sur iprium.

Answer Preview

Only 25% of students answer this correctly

[khang]

Assume you have a digraph with 5 vertices (A, B, C, D, and E) and 9 arcs. B is incident from D, E, and A; C is incident to E and A and incident from D; E is incident to D and incident from A.

Vertex A has
◦ indegree 2, outdegree 1.
◦ indegree 3, outdegree 0.
◦ indegree 0, outdegree 3.
◦ indegree 1, outdegree 2.
◦ none of these

[yotaSR5]

indegree 1, outdegree 2.

[Arii_bell]

Assume you have a digraph with 5 vertices (A, B, C, D, and E) and 9 arcs. B is incident from D, E, and A; C is incident to E and A and incident from D; E is incident to D and incident from A.

Vertex E is
◦ incident to vertex C only.
◦ incident to vertex B only.
◦ incident to vertices B and D.
◦ incident to vertex A only.
◦ none of these

[anoriega3]

incident to vertices B and D.

[asmith134]

Assume you have a digraph with 5 vertices (A, B, C, D, and E) and 9 arcs. B is incident from D, E, and A; C is incident to E and A and incident from D; E is incident to D and incident from A.

Which of the following is not a path from vertex C to vertex B in the digraph?
◦ C, A, B
◦ C, E, B
◦ C, E, D, B
◦ C, D, E, B
◦ all of these are paths from C to B.

[lucas dlamini]

C, D, E, B

[AEWBW]

Assume you have a digraph with 5 vertices (A, B, C, D, and E) and 9 arcs. B is incident from D, E, and A; C is incident to E and A and incident from D; E is incident to D and incident from A.

How many cycles are there in the digraph that start and end at C?
◦ 2
◦ 0
◦ 1
◦ 3
◦ none of these

[makaylafy]

2