Data Structures Unit 5 Handwritten Notes AKTU (BCS301)

AKTU · BTECH · Semester 3 · Data Structures · Unit 5 · Handwritten Notes

AKTU Data Structures (BCS301) Unit 5 handwritten notes for B.Tech Semester 3 – Graphs. Topics: Graphs, Minimum Spanning Tree, Shortest Path & Transitive…

Open the interactive reader to study this resource on AcademicArk.

Unit 5: Graphs – AKTU syllabus topics

  • Graphs: Graph Representations (Adjacency Matrix & List), Graph Traversal (DFS & BFS)
  • Minimum Spanning Tree
  • Shortest Path & Transitive Closure

Most asked AKTU PYQ questions from Unit 5

  1. Q5b. Apply Prim’s algorithm to find a minimum spanning tree in the following weighted graph as shown below. (10 marks, 2021-22)
  2. Qa. Find the minimum spanning tree using Prim’s algorithm for the graph shown below: - (7 marks, 2023-24)
  3. Q2d. Write the Dijkstra algorithm for shortest path in a graph and also find the shortest path from ‘S’ to all remaining vertices of graph in the following graph: (10 marks, 2022-23)
  4. Q5a. Use Dijkstra’s algorithm to find the shortest paths from source to all other vertices in the following graph. (10 marks, 2021-22)
  5. Q6b. Describe the Dijkstra algorithm to find the shortest path. Find the shortest path in the following graph with vertex 'S' as source vertex. (10 marks, 2019-20)
  6. Qe. Consider the following graph and using Dijkstra Algorithm find the shortest path. (7 marks, 2023-24)
  7. Q6a. What is spanning tree? Write down the Prim’s algorithm to obtain minimum cost spanning tree. Use Prim’s algorithm to find the minimum cost spanning tree in the following graph: (10 marks, 2022-23)
  8. Q6b. 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: (10 marks, 2022-23)
  9. Q2d. Find the minimum spanning tree in the following graph using Kruskal's algorithm: (10 marks, 2019-20)
  10. Q6a. Explain warshall's algorithm with the help of an example. (10 marks, 2019-20)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Other Data Structures units

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes