...
April 6, 2025

GATE 2006

Question 12 To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in linear time, the data structure to be used is: A […]
April 6, 2025

GATE 2006-IT

Question 10 A problem in NP is NP-complete if A It can be reduced to the 3-SAT problem in polynomial time B The 3-SAT problem can […]
April 6, 2025

GATE 2005

Question 38 Let G(V,E) be an undirected graph with positive edge weights. Dijkstra’s single source shortest path algorithm can be implemented using the binary heap data structure […]