Given below are some algorithms, and some algorithm design paradigms. List - I P. Dijkstra’s Shortest Path Q. Floyd-Warshall algor…
Match each algorithm in List I with the algorithm-design technique it primarily uses in List II. | List I: Algorithm | List II: D…
An algorithm performs (logN)1/2 find operations, N insert operations, (logN)1/2 delete operations, and (logN)1/2 decrease-key oper…
Consider the following C function: ```c int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0;…
Let f(n) = n and g(n) = n^(1 + sin n) where n is a positive integer. Which of the following statements is/are correct? I. f(n) = O…
Consider a complete binary tree where the left and the right subtrees of the root are max heaps. The lower bound for the number of…
Free account benefits
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.