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

Recent questions in Algorithms

0 votes
0 answers
3781
Let (x′, y′) correspond to gcd(b, a mod b), i.e. gcd(b, a mod b) = x′ ·b + y′ · (a mod b). Then show that gcd(a, b) = y′ &midd...
85 votes
18 answers
3783
61 votes
5 answers
3785
21 votes
4 answers
3790
2 votes
1 answer
3793
1 votes
1 answer
3794
how to apply master's theorem in given problemt(n) = 3t(n/4) + nlogn.please explain ..
0 votes
1 answer
3795
set up a recurrence relation for the number of n digit sequences on integers 0,1,2,3 having an even number of 0's
1 votes
2 answers
3798
time complexity for merging m sorted lists, each with n/m elements