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 […]

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 […]

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 […]

Question 62 A. If some NP-complete problem p is in P that P =NP B. TSP is in NP C. SAT is in NP D. Hamilton […]