Home
Subjects
Create
Search
Log in
Sign up
Upgrade to remove ads
Only $2.99/month
Home
Science
Computer Science
Data Structures
Data Structures 212-224
STUDY
Flashcards
Learn
Write
Spell
Test
PLAY
Match
Gravity
Terms in this set (13)
212. If a graph node has an odd degree (1016)
A. It cannot be both a start and and end of a traversal
B. It cannot be visited
C. It cannot have parallel edges
D. It can be both the start and the end of the same traversal
It cannot be both a start and an end of a traversal
213. The "Bridges of Koenigsberg" cannot be solved because (1017)
A. The degree of at least one vertex is odd
B. There are an odd number of vertices
C. There are not enough bridges
D. There are too many bridges
E. There is a bridge between the islands
F. The vertices have an odd number of edges
G. The problem cannot be represented as a graph
The degree of at least one vertex is odd, The vertices have an odd number of edges
214. Graphs are composed of (1017)
A. Edges and vertices
B. Vertices and connections
C. Connected and disconnected graphs
D. Nodes and vertices
E. Vertices and edges
F. Directed and indirected graphs
Edges and Vertices, Vertices and Edges
215. If two vertices are connected by the same edge (1018)
A. They are the same
B. They are adjacent
C. They are parallel
D. They are related
They are adjacent
216. If one or more edges of a graph are "one-way" (1018)
A. The problem it represents cannot be solved
B. It is a directed graph
C. It has an odd degree
D. The graph is directed
E. It is a connected graph
F. It is a depth-first graph
G. It is a spanning tree
It is a directed graph, The graph is directed
217. Which is a method of representing a graph in memory? (1020)
A. A vertices array and an edges array
B. An array of edges and a list of paths
C. A list of Vertices and a list of edges
D. A list of vertices and nodes
E. An array of vertices and an adjacency a matrix
F. A spanning tree
G. A linked list
A vertices array and an edges array, An array of vertices and an adjacency matrix
218. A list which contains an entry for each vertex and a list of edges in each entry is a(n) (1023)
A. Vertex list
B. Edge list
C. Adjacency list
D. Cyclic list
E. Traversal list
Cyclic list
219. The implementation hierarchy of the UnweightedGraph class is (1024)
A. The Graph interface, the AbstractGraph class and the UnweightedGraph abstract class
B. The AbstractGraph interface, the Graph class and the UnweightedGraph class
C. The Unweighted graph interface,the AbstractGraph class and the Graph class
D. The Graph interface, the AbstractGraph class and the UnweightedGraph class
E. The AbstractGraph interface, the Graph abstract class and the UnweightedGraph class
The graph interface, the abstractGraph class and the unweightedGraph class
220. The process of visiting each node in the graph exactly once is (1037)
A. A reversal
B. Solving the problem
C. A traversal
D. A spanning tree
E. Traversing the graph
F. A convolution
G. A binary search
A traversal, Traversing the graph
221. Which is a way of traversing a graph? (1037)
A. In-order
B. Post-order
C. Pre-order
D. Cyclic
E. Breadth-first
F. Spanning
G. Depth-first
Breadth-first, Depth-first
222. The depth-first search method returns a(n) (1038)
A. Boolean
B. Array
C. Spanning tree
D. Tree
E. Integer
F. Vertex
G. List
Spanning tree, Tree
223. What sort of problem cannot be solved by a depth-first search? (1041)
A. Finding a Hamiltonian cycle
B. Detecting whether there is a cycle in the graph
C. Detecting whether a graph is directed
D. Detecting whether there is a path between two vertices
E. Finding all connected vertices
F. Finding a Jeffersonian cycle
G. Detecting whether a graph is connected
Detecting whether a graph is directed, Finding a Jeffersonian cycle
224. Which problem can be solved with a graph? (1042)
A. The bridge resonance problem
B. The end-of-semester problem
C. The connect-the-dots problem
D. The linear search problem
E. The nine-tails problem
F. The Towers of Hanoi problem
G. The connected circles problem
The nine-tails problem, The connected circles problem
YOU MIGHT ALSO LIKE...
Algorithms and programming in python
43 terms
Algorithms graphs
43 terms
CSCI 161 Final
107 terms
Data Structures Midterm
64 terms
OTHER SETS BY THIS CREATOR
PHP Final
2 terms
UX/UI - Quiz 2
15 terms
Intro to MGMT & Organization - Final
7 terms
Intro to MGMT & Organization Midterm
37 terms
OTHER QUIZLET SETS
Section A
95 terms
VN 100 Elimination
43 terms
o.chem lab final
29 terms
Bio Final Exam
56 terms