Data Structures Unit 5 – Graphs: AKTU previous year questions
29 AKTU questions from Unit 5 (Graphs) asked in 2020–2026, tagged by marks, year and topic. In short: about 28 marks of every paper come from this unit; the most asked topic is Graphs (12 times); 16 questions came back in a later year. The latest ones are listed below; on the page you can filter them by 2-mark or long questions, topic and repeats.
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)
- Explain the following graph terminologies with examples: (i) Graph (ii) Weighted Graph (iii) Degree of a Vertex (iv) Connected and Disconnected Graph (v) Cycle in a Graph (vi) Directed and Undirected Graph (vii) MST (7 marks, 2025, Graphs)
- Find the minimum spanning tree using Prim’s algorithm for the graph shown below: - (7 marks, 2024, Minimum Spanning Tree)
- Write a program in C language to compute the indegree and outdegree of every vertex of a directed graph when the graph is represented by an adjacency matrix. (7 marks, 2024, Graphs)
- Consider the following graph and using Dijkstra Algorithm find the shortest path. (7 marks, 2024, Shortest Path & Transitive Closure)
- What is the number of edges in a regular graph of degree d and n vertices. (2 marks, 2024, Graphs)
- Write an algorithm to obtain the connected components of a graph. (2 marks, 2024, Graphs)
- Write an algorithm for Breadth First Search (BFS) traversal of a graph. (2 marks, 2023, Graphs)
Most asked Unit 5 topics
- Graphs – asked 12 times
- Shortest Path & Transitive Closure – asked 9 times
- Minimum Spanning Tree – asked 8 times
Unit 5 question pattern
- 2-mark questions: 9 asked in 2020–2026
- 7-mark questions: 8 asked in 2020–2026
- 10-mark questions: 12 asked in 2020–2026
- About 28 marks from Unit 5 in every paper
- 16 questions were asked again in a later year
Unit 5 questions year by year
- 2026: 3 Unit 5 questions asked (16 marks across that year's papers)
- 2025: 3 Unit 5 questions asked (21 marks across that year's papers)
- 2024: 5 Unit 5 questions asked (25 marks across that year's papers)
- 2023: 4 Unit 5 questions asked (32 marks across that year's papers)
- 2022: 4 Unit 5 questions asked (32 marks across that year's papers)
- 2021: 5 Unit 5 questions asked (34 marks across that year's papers)
- 2020: 5 Unit 5 questions asked (34 marks across that year's papers)