 |  Graphs 20 Flashcards |  Start |
 | What are the two main components of a graph? |  Card: 1 / 20 |
| A finite set of vertices (nodes) and a finite set of ordered pairs called edges. | Card: 2 / 20 |
| Fill in the blank: An adjacency matrix for a graph is a ______ that indicates the presence of edges between vertices. | Card: 3 / 20 |
| 2D array | Card: 4 / 20 |
| True or False: In an adjacency matrix, the space complexity is O(V²) regardless of the number of edges. | Card: 5 / 20 |
| True | Card: 6 / 20 |
| Which representation of a graph uses an array of lists to store adjacent vertices? A) Adjacency Matrix B) Adjacency List C) Incidence Matrix D) Edge List | Card: 7 / 20 |
| B) Adjacency List | Card: 8 / 20 |
| What does the Floyd Warshall algorithm solve? | Card: 9 / 20 |
| The All Pairs Shortest Path problem. | Card: 10 / 20 |
|  Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only | |
| Riddle: I connect vertices in a graph, but I have no direction when undirected. What am I? | Card: 11 / 20 |
| An edge | Card: 12 / 20 |
| True or False: The adjacency list representation is more space-efficient for sparse graphs compared to the adjacency matrix. | Card: 13 / 20 |
| True | Card: 14 / 20 |
| Fill in the blank: A minimum spanning tree is a spanning tree with the ______ of the weights of the edges. | Card: 15 / 20 |
| Minimum sum | Card: 16 / 20 |
| What is the time complexity of Depth First Search (DFS) for a graph? | Card: 17 / 20 |
| O(V + E) | Card: 18 / 20 |
| Which algorithm is NOT used to find a minimum spanning tree? A) Prim's Algorithm B) Kruskal's Algorithm C) Dijkstra's Algorithm D) Both A and B | Card: 19 / 20 |
| C) Dijkstra's Algorithm | Card: 20 / 20 |
| Completed! Keep practicing to master all of them. |  Restart |
