Podcast
Questions and Answers
What is a graph in terms of abstract data type?
What is a graph in terms of abstract data type?
- An array of vertices and edges
- A pair of sets of vertices and edges connecting them (correct)
- A set of vertices and edges separately
- A collection of items connected by edges
What represents each node in the graph?
What represents each node in the graph?
- Vertex (correct)
- Path
- Adjacency
- Edge
What is the set of edges connecting the pairs of vertices in the graph?
What is the set of edges connecting the pairs of vertices in the graph?
- Adjacency
- V
- E (correct)
- Path
What is an edge in a graph?
What is an edge in a graph?
What is adjacency in a graph?
What is adjacency in a graph?
What is a path in a graph?
What is a path in a graph?
What is one of the most popular operations on graphs?
What is one of the most popular operations on graphs?
What is the set of vertices in the graph?
What is the set of vertices in the graph?
What is the algorithm that traverses a graph by visiting each vertex in descending order of depth?
What is the algorithm that traverses a graph by visiting each vertex in descending order of depth?
What data structure is used by the DFS traversal to record the unvisited nodes?
What data structure is used by the DFS traversal to record the unvisited nodes?
What is the type of graph that has edges that possess a direction that goes either away from a vertex or towards the vertex?
What is the type of graph that has edges that possess a direction that goes either away from a vertex or towards the vertex?
What is the type of graph that has edges that are not directed at all?
What is the type of graph that has edges that are not directed at all?
What is the adjacency matrix used to represent in a graph?
What is the adjacency matrix used to represent in a graph?
What is the adjacency list used to represent in a graph?
What is the adjacency list used to represent in a graph?
What algorithm is used to traverse a graph by visiting every vertex at a given depth level before going on to the next?
What algorithm is used to traverse a graph by visiting every vertex at a given depth level before going on to the next?
What is the data structure used by the BFS traversal to maintain track of the unvisited nodes?
What is the data structure used by the BFS traversal to maintain track of the unvisited nodes?
Flashcards are hidden until you start studying
