Course Content

Other Courses

Tribhuvan university BCA BCA Curriculum Data Structures and Algorithms Old Questions 2023

Data Structures and Algorithms - Old Questions

Question Answer Details
Syllabus Notes Old Questions Unit Wise Questions Question Bank

11. How breadth first traversal and depth first traversal can be used for traversing a graph? Explain with example. Use Dijkstra's algorithm to find the shortest path from node A to all other nodes for the following graph.


10 marks
Asked in 2023

Answer

Back to Question Paper
AI Generated Answer

AI is thinking...