Graphs in Data Structures - Gunalakshmi

How is a graph represented in memory?

• • Linked List

• • Adjacency Matrix

• • Hash Table

• • Tree Structure

Which set represents the vertices of the graph?

• {1,2}, {2,3}. {2,4}, {4,5}, {4,6}

• {1, 2, 3, 4, 5, 6,}

• {1, 2, 3, 4, 5, 6, 7}

• {1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

Which two vertices are adjacent vertices?

• 5 is adjacent to 6

• 3 is adjacent to 6

• 4 is adjacent to 1

• 3 is adjacent to 2

Which order of traversal is correct using depth-first?

• A B C G D E F

• A B D C E C G

• A B G C D F E

• A E C F D G C

Which order of traversal is correct using breadth-first?

• A B D E C F G

• A B C G D E F

• A B D C G E F

• A B DG C D E F

In which scenario is a weighted graph used?

• • When you only need a path between vertices

• • When there is no direction between vertices

• • When edges have associated values, such as cost or distance

• • When all vertices are directly connected to each other

Which graph traversal algorithm uses a stack data structure?

• 
  

• • BFS

• • Floyd-Warshall Algorithm

• • Dijkstra's Algorithm

• DFS

In which of the following graphs is every vertex reachable from every other vertex?

• • a) Weighted Graph

• • b) Undirected Graph

• • c) Connected Graph

• • d) Disconnected Graph

Which traversal technique is used for finding connected components in an undirected graph?

• • a) Dijkstra's Algorithm

• • b) DFS

• • c) Floyd-Warshall Algorithm

• • d) Prim's Algorithm

Which of the following is a depth-first traversal?

• • a) Exploring all neighbors of the current node first

• • b) Exploring one branch as deep as possible before backtracking

• • c) Using a queue

• • d) All of the above