Data Structures Unit 5 – Graphs: important questions for AKTU
Unit 5 (Graphs) questions that AKTU repeats most often. This unit carries about 28 marks per paper. Start with the repeated questions, then the most asked topics.
Most repeated Unit 5 questions
- Find the minimum spanning tree using Prim’s algorithm for the graph shown below: - (7 marks, 2024, Minimum Spanning Tree) – also asked in 2022, 2023, 2020, 2026
- Apply Prim’s algorithm to find a minimum spanning tree in the following weighted graph as shown below. (10 marks, 2022, Minimum Spanning Tree) – also asked in 2020, 2023, 2024, 2026
- Consider the following graph and using Dijkstra Algorithm find the shortest path. (7 marks, 2024, Shortest Path & Transitive Closure) – also asked in 2022, 2023, 2020
Most important Unit 5 topic
- Graphs (Unit 5: Graphs) – asked 12 times in 2020, 2021, 2022, 2023, 2024, 2025
Most asked Unit 5 topics
- Graphs – asked 12 times
- Shortest Path & Transitive Closure – asked 9 times
- Minimum Spanning Tree – asked 8 times
More Unit 5 previous year questions
- Define the Minimum spanning tree. (2 marks, 2026, Minimum Spanning Tree)
- Use Prim’s Algorithm to compute MST for the given weighted graph (7 marks, 2026, Minimum Spanning Tree)
- Write and explain the Floyd Warshall algorithm to find the all-pair shortest path. Use the Floyd Warshall algorithm to find shortest path among all the vertices in the given graph: (7 marks, 2026, Shortest Path & Transitive Closure)
- Explain the Depth-First Search (DFS) algorithm with the help of an example graph. Which data structure is used for DFS and BFS? (7 marks, 2025, Graphs)
- Explain two ways to represent a graph in memory and compare their advantages: (i) Adjacency matrix (ii) Adjacency List (7 marks, 2025, Graphs)
Unit 5 syllabus topics
- Graphs
- Minimum Spanning Tree
- Shortest Path & Transitive Closure