Register

Web Page

Searching, Sorting, Hashing, Asymptotic worst case time and Space complexity, Algorithm design techniques: Greedy, Dynamic programming, and Divide‐and‐conquer, Graph search, Minimum spanning trees, Shortest paths.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2 &3&2&3&2&0&2&2&3&3&0&2.2&3
\\\hline\textbf{2 Marks Count} & 2 &3&4&4&2&4&2&3&2&3&2&2.9&4
\\\hline\textbf{Total Marks} & 6 &9&10&11&6&8&6&8&7&9&\bf{6}&\bf{8}&\bf{11}\\\hline
\end{array}}}$$

Filter

Highest voted questions in Algorithms

1 votes
1 answer
2263
Self Made
If a graph contains a positive weight cycle reachable from source, Can we find a well defined shortest path using Dijkstra/Bellman-Ford algorithm?
If a graph contains a positive weight cycle reachable from source, Can we find a well defined shortest path using Dijkstra/Bellman-Ford algorithm?
User Avatar
1 votes
1 answer
2264
UGC NET CSE | September 2013 | Part 3 | Question: 2
$\alpha - \beta$ cutoffs are applied to Depth first search Best first search Minimax search Breadth first search
$\alpha - \beta$ cutoffs are applied toDepth first searchBest first searchMinimax searchBreadth first search
User Avatar
1 votes
2 answers
2265
UGC NET CSE | December 2014 | Part 2 | Question: 25
A full binary tree with $n$ leaves contains $n$ nodes $\log_{2} n$ nodes $2n –1$ nodes $2^{n}$ nodes
A full binary tree with $n$ leaves contains$n$ nodes $\log_{2} n$ nodes $2n –1$ nodes$2^{n}$ nodes
User Avatar
1 votes
1 answer
2266
http://gateoverflow.in/31625/gate1990-what-is-the-asymptotic-behaviour-of-t-n
while solving recurrence i got this series..now how to proceed further? $1+\frac{n+1}{2}+\frac{(n+1)n}{2^{2}}+\frac{(n+1)n(n-1))}{2^{3}}+..\frac{(n+1)n(n-1)(n-2)(n-3)...3.2.1}{2^{n+1}}$
while solving recurrence i got this series..now how to proceed further?$1+\frac{n+1}{2}+\frac{(n+1)n}{2^{2}}+\frac{(n+1)n(n-1))}{2^{3}}+..\frac{(n+1)n(n-1)(n-2)(n-3)...3....
User Avatar
1 votes
1 answer
2267
Self Made
Can we find Negative weight cycles reachable from source in a graph using Dijkstra's Algorithm??
Can we find Negative weight cycles reachable from source in a graph using Dijkstra's Algorithm??
User Avatar
1 votes
1 answer
2268
UGC NET CSE | September 2013 | Part 2 | Question: 9
The amortized time complexity to perform ____ operation(s) in Splay trees is O(Ig n) Search Search and Insert Search and Delete Search, Insert and Delete
The amortized time complexity to perform ____ operation(s) in Splay trees is O(Ig n)SearchSearch and InsertSearch and DeleteSearch, Insert and Delete
User Avatar
1 votes
0 answers
2271
Heap Sort
Why is the space complexity of heap sort O(1) and not O(log n) even if Heap sort internally calls max_heapify whose space complexity is O(log n) due to the stack (recursion)? And if it is O(log n), it should not be an in-place sorting algorithm.
Why is the space complexity of heap sort O(1) and not O(log n) even if Heap sort internally calls max_heapify whose space complexity is O(log n) due to the stack (recursi...
User Avatar
1 votes
3 answers
2272
UGC NET CSE | December 2012 | Part 3 | Question: 14
Let $T(n)$ be a function defined by $T(n) =1$ and $T(n)=2T (n/2) + \sqrt{n}$, which of the following is true? $T(n) = O(\sqrt{n})$ $T(n) = O(\log_2 n)$ $T(n) = O(n)$ $T(n) = O(n^2)$
Let $T(n)$ be a function defined by $T(n) =1$ and $T(n)=2T (n/2) + \sqrt{n}$, which of the following is true?$T(n) = O(\sqrt{n})$$T(n) = O(\log_2 n)$$T(n) = O(n)$$T(n) = ...
User Avatar
1 votes
1 answer
2273
UGC NET CSE | June 2014 | Part 3 | Question: 63
The solution of the recurrence relation of $ T(n)=3T\left(floor \left(\frac{n}{4}\right)\right)+n$ is $O(n^{2})$ $O(n/g n)$ $O(n)$ $O(l g n)$
The solution of the recurrence relation of $ T(n)=3T\left(floor \left(\frac{n}{4}\right)\right)+n$ is$O(n^{2})$$O(n/g n)$$O(n)$ $O(l g n)$
User Avatar
1 votes
2 answers
2276
TestBook Test Series: Algorithms - Time Complexity
On which of the following recurrence relation Masters theorem can not be applied ? A. T(n)= 2T(n/2) + n (log n). B. T(n) = T(n/2) + 1. C. T(n) = 8T(n/2) + (log n). D. T(n) = 7(T(n/4) + n2.
On which of the following recurrence relation Masters theorem can not be applied ?A. T(n)= 2T(n/2) + n (log n).B. T(n) = T(n/2) + 1.C. T(n) = 8T(n/2) + (log n).D. T(n) = ...
User Avatar
1 votes
1 answer
2278
Non Comparison Based Algo
User Avatar
1 votes
2 answers
2280
mergesort
Given the following list of numbers: [21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40] which answer illustrates the list to be sorted after 3 recursive calls to mergesort? [16, 49, 39, 27, 43, 34, 46, 40] [21,1] [21, 1, 26, 45] [21]
Given the following list of numbers:[21, 1, 26, 45, 29, 28, 2, 9, 16, 49, 39, 27, 43, 34, 46, 40]which answer illustrates the list to be sorted after 3 recursive calls to...
User Avatar
Page: