March 14, 2025
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
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
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
Question 8 Match List -I with List – II. List – I List – II A) Dijkstra’s Algorithms I) Find the shortest path […]
March 22, 2025
Question 58 Match List – I with List – II. List – 1 (Recurrence Relations) List – II (Complexity) (A) Т(n) = 2T(n/2) +n […]
April 2, 2025
Question 29 Let f and g be functions of natural numbers given by f(n)=n and g(n)=n2 Which of the following statements is/are TRUE? A f ∈ […]
April 3, 2025
Question 52 Consider the C function given below. Assume that the array listA contains n (> 0) elements, sorted in ascending order. int ProcessArray(int *listA, int […]
April 3, 2025
Question 51 Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling […]
April 3, 2025
Question 62 The number of distinct minimum spanning trees for the weighted graph below is _______. A 6 B 7 C 8 D 9 AlgorithmsMinimum-Spanning-TreeVideo-Explanation Question […]
April 5, 2025
Question 19 What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? A Θ(n2) B Θ(n2 log n) […]
April 5, 2025
Question 31 The number of elements that can be sorted in Θ(log n) time using heap sort is A Θ(1) B Θ(√logn) C Θ (logn/loglogn) D […]
April 5, 2025
Question 12 The running time of quick sort algorithm depends heavily on the selection of: A No. of inputs B Arrangement of elements in an array […]