FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 12: Graphs

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Multiple Choice

Review LaterAdd Note

Review Later

In the following code to add an edge in the LinkedDirectedGraph class, what is the missing code? def addEdge(self, fromLabel, toLabel, weight) : FromVertex = self.getVertex(fromLabel) < missing code > FromVertex.addEdgeTo(toVertex, weight) Self.edgeCount += 1

A) self.getVertex(toLabel) = fromVertex
B) fromVertex.addEdgeTo(fromVertex, weight)
C) self.weight += 1
D) toVertex = self.getVertex(toLabel)

E) A) and D)
F) C) and D)

Correct Answer

verified

Show Answer

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

Which of the following is NOT true after the initialization step in Dijkstra's algorithm?

A) the cells in the included list are all False, except for the cell that corresponds to the row of the source vertex in the results grid
B) the distance in a row's distance cell is either 0, infinity, or a positive number
C) the shortest path from the source to a vertex is found and the vertex's cell is marked in the included list
D) the vertex in a row's parent cell is either the source vertex or undefined

E) None of the above
F) A) and B)

Correct Answer

verified

Show Answer

Question 3

True/False

Review LaterAdd Note

A graph has a single length attribute, similar to the lists, queues, and stacks.

The adjacency matrix representation of a graph stores graph information in an array of lists.

In a connected graph, there must be an edge from each vertex to every other vertex.

A topological order assigns a rank to each edge such that the vertices go from lower-to higher-ranked edges.

In a complete graph with six vertices, the degree of a vertex is five.

In an adjacency matrix, a 1 is used to represent an edge between two vertices.

What are edges called that emanate from a given source vertex?

In a complete undirected graph with five vertices how many cells will contain a value of 1 in an adjacency matrix?

In the implementation of a graph, the len function returns the number of the graph's vertices.

Which term best describes a neighbor?

Which of the following is NOT a process for which a graph can serve as a model?

Removing a vertex also entails removing any edges connecting it to other vertices.

A spanning tree has the fewest number of edges possible while still retaining a connection between all the vertices in the component.

A simple path in a graph is one in which a path passes through the same vertex at least twice.

To find the shortest path, you can use a wighted graph and sum the edge of the weights between two vertices.

The adjacency list supports finding all the vertices adjacent to a given vertex more efficiently than the adjacency matrix.

A a depth-first traversal cannot be implemented recursively.

Which of the following is true about graphs?