...
March 14, 2025

GATE 2008

Question 79 Let xn denote the number of binary strings of length n that contain no consecutive 0s. The value of x5 is A 5 B […]
March 20, 2025

GATE 2007

Question 41 In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of […]
March 20, 2025

GATE 2007

Question 49 Let w be the minimum weight among all edge weights in an undirected connected graph. Let e be a specific edge of weight w. […]
March 22, 2025

NTA UGC NET Aug 2024 Paper-2

Question 8 Match List -I with List – II. List – I     List – II A) Dijkstra’s Algorithms   I) Find the shortest path […]