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}}}$$

Highest voted questions in Algorithms

0 votes
0 answers
4321
I think this function is wrongans b is correct. but implementation of function is incorrect . plz check
0 votes
1 answer
4322
T(n) = 16T(n/4) + n!i got its ans as logn* n!is it correct ?
0 votes
1 answer
4323
0 votes
1 answer
4324
0 votes
1 answer
4327
Consider a set of 20 elements.To find maximum and minimum element in the given set, the minimum number of comparisons required is _________? (using DAC Max-Min algorithm)...
0 votes
0 answers
4328
Solution for recurrence relation T(n)=T(n/2 + 2)+n using recursion tree method?
0 votes
1 answer
4333
Can someone plz help me understand union find algo?Or provide a good resource other thah GfGeeks,for this
0 votes
0 answers
4334
i'm confused where and when to use these two formula, someone explain plz
0 votes
2 answers
4339
0 votes
3 answers
4340