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

1 votes
1 answer
2045
T(n) = 4T(sqrt(n)) + (logn)^5Find Time complexity.(n=2^k)Give detailed answer , how to derive it.
1 votes
1 answer
2048
What will be the time complexity of:T(n)=n½ * T(n½) + n ?I tried by substitution by taking m=n^½​​​​​​​​​​​​​​​ but I'm not getting the a...
1 votes
0 answers
2050
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ?a)O(n)b)θ(n)c)Ω(n)d)None of these
1 votes
1 answer
2051
1 votes
0 answers
2053
1 votes
1 answer
2054
For a simple, undirected, weighted graph each edge havind distinct weight, How is it possible that there can be more than $1$ second best minimum spanning tree?
1 votes
1 answer
2055
1 votes
0 answers
2056
$T(n)= \begin{Bmatrix} 2^{n}T(n-1)+c& n>0\\ 1 & n=0 \end{Bmatrix}$
1 votes
0 answers
2057
1 votes
1 answer
2059
T(n) = T(n/4) + T(3n/4) + n if n>1 = 1 if n =1T(n) = ??