Question 1

Which of the following is true about graph traversals?

Accepted Answer

A)   a single path to each item is assumed
B)   all algorithms are nonrecursive
C)   the algorithm should find the shortest path to a given item
D)   the type of collection used is irrelevant to the traversal algorithmE) A) and C)
F) B) and C)

Question 2

In the __init__ method code for the LinkedVertex class, what is the missing code? def __init__(self, label) :
Self.label = label
Self.edgeList = list()

Accepted Answer

A)   self.size += 1
B)   self.mark = False
C)   return iter(result) 
D)   result = self.labelE) None of the above
F) A) and B)

Question 3

On a weighted graph, the vertices are labeled with numbers.

Accepted Answer

A) True 
 B)False

Question 4

In a breadth-first traversal of a graph, what type of collection is used in the generic algorithm?

Accepted Answer

A)   queue
B)   set
C)   stack
D)   heapE) All of the above
F) B) and D)

Question 5

The number of edges connected to a vertex describes which of the following?

Accepted Answer

A)   a complete graph
B)   the neighbor of a vertex
C)   the degree of a vertex
D)   whether a graph is connectedE) All of the above
F) A) and D)

Question 6

All graphs, except weighted graphs, are collections of vertices connected by edges.

Accepted Answer

A) True 
 B)False

Question 7

Which of the following is NOT true about an adjacency matrix?

Accepted Answer

A)   it stores information about the graph in a grid
B)   the grid cell contains a 0 if there is no edge between vertices
C)   a graph with four vertices contains 16 cells
D)   it can be represented by an array of listsE) B) and C)
F) A) and C)

Question 8

In Python, you need to define infinity as a long integer.

Accepted Answer

A) True 
 B)False

Question 9

Dijkstra's algorithm consists of two steps: the initialization step and the execution step.

Accepted Answer

A) True 
 B)False

Question 10

In an undirected graph, two or more edges connect the same pair of vertices.

Accepted Answer

A) True 
 B)False

Exam 12: Graphs

In Python, you need to define infinity as a long integer.

Correct Answer
verified

All graphs, except weighted graphs, are collections of vertices connected by edges.

Correct Answer
verified

The number of edges connected to a vertex describes which of the following?

Correct Answer
verified

In the init method code for the LinkedVertex class, what is the missing code? def init(self, label) : Self.label = label Self.edgeList = list() < missing code >

Correct Answer
verified

In an undirected graph, two or more edges connect the same pair of vertices.

Correct Answer
verified

On a weighted graph, the vertices are labeled with numbers.

Correct Answer
verified

Dijkstra's algorithm consists of two steps: the initialization step and the execution step.

Correct Answer
verified

In a breadth-first traversal of a graph, what type of collection is used in the generic algorithm?

Correct Answer
verified

Which of the following is true about graph traversals?

Correct Answer
verified

Which of the following is NOT true about an adjacency matrix?

Correct Answer
verified

Exam 12: Graphs

In Python, you need to define infinity as a long integer.

Correct AnswerverifiedShow Answer

All graphs, except weighted graphs, are collections of vertices connected by edges.

Correct AnswerverifiedShow Answer

The number of edges connected to a vertex describes which of the following?

Correct AnswerverifiedShow Answer

In the __init__ method code for the LinkedVertex class, what is the missing code? def __init__(self, label) : Self.label = label Self.edgeList = list() < missing code >

Correct AnswerverifiedShow Answer

In an undirected graph, two or more edges connect the same pair of vertices.

Correct AnswerverifiedShow Answer

On a weighted graph, the vertices are labeled with numbers.

Correct AnswerverifiedShow Answer

Dijkstra's algorithm consists of two steps: the initialization step and the execution step.

Correct AnswerverifiedShow Answer

In a breadth-first traversal of a graph, what type of collection is used in the generic algorithm?

Correct AnswerverifiedShow Answer

Which of the following is true about graph traversals?

Correct AnswerverifiedShow Answer

Which of the following is NOT true about an adjacency matrix?

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

In the init method code for the LinkedVertex class, what is the missing code? def init(self, label) : Self.label = label Self.edgeList = list() < missing code >

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified