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{2024-1} & \textbf{2024-2} & \textbf{2023} & \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1&2&2& 2 &3&2&1&2&3
\\\hline\textbf{2 Marks Count} &4&2&2& 2 &3&4&2&2.83&4
\\\hline\textbf{Total Marks} &9&6&6& 6 &9&10&\bf{6} & \bf{7.67}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Algorithms

0 votes
0 answers
2204
0 votes
2 answers
2205
0 votes
0 answers
2207
Show that the worst case running time of heap sort is Ω(nlogn).
1 votes
0 answers
2209
Please solve this without master's or extended master's theoremT(n) = 2T (n/2) + n/log n
1 votes
1 answer
2212
0 votes
0 answers
2213
4 votes
1 answer
2214
There are two sorted list each of length $n$. An element to be searched in the both the lists. The lists are mutually exclusive. The maximum number of comparisons require...
1 votes
0 answers
2215
how to find median of an array in O(N) time
2 votes
0 answers
2216
what is minimum number of elements that need to be hashed into a hash table of size m with chaining in order to make sure that at least one hash location has a chain of l...