DM Exam Review

Given the digraph, what is the indegree of vertex B?

• 0

• 1

• 2

• 3

Given the digraph, which of the following is a cycle?

• ABCA

• AECA

• ABDA

• AEDA

Given the table of tasks, which digraph represents this project?

• 
• 
• 
• 

Tags

CCSS.HSA.CED.A.3

Using the decreasing size algorithm, what is the last task in the priority list for the given project?

• D

• E

• F

• G

Using the backflow algorithm, find the critical time for A

• 8

• 13

• 20

• 21

The number of vertices in K₁₁ is

• 11

• 55

• 22

• 10

Use the nearest-neighbor algorithm to find a Hamilton Circuit starting at E. 

• E, A, C, D, B, E
• E, D, C, A, B, E
• E, D, C, B, A, E
• E, D, A, B, C, E

This graph will have a Euler's Path. 

• True
• False

This graph will have a Euler's Circuit

• True
• False

How many edges are on a completed graph with 5 vertices

• 5

• 10

• 24

• 120