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

Most answered questions in Algorithms

1 votes
0 answers
4321
What is the complexity of this code..??
1 votes
0 answers
4322
1 votes
0 answers
4323
0 votes
0 answers
4324
How to calculate the recurrence relation for Recursive Fibonicci series using the substitution method .How to guess and how to start and finally how to evaluate the tim...
1 votes
0 answers
4325
Which grows faster when n increases?$I. n^{\frac{1}{3}}<\frac{n}{logn}II. n^{\frac{1}{3}}>\frac{n}{logn}$
0 votes
0 answers
4327
2 votes
0 answers
4328
What is the worst case time complexity to sort on array A [0 to n] where the elements at index A [2i] (at even array index) is in its correct position ?(a) O(n2)(b) O(n l...
0 votes
0 answers
4329
Can somebody please explain what does linearly ordered distinct element.
2 votes
0 answers
4330
0 votes
0 answers
4332
0 votes
0 answers
4333
0 votes
0 answers
4334
What is the time complexity of heapify and building a heap?
0 votes
0 answers
4335
0 votes
0 answers
4336
0 votes
0 answers
4337
0 votes
0 answers
4338
isn't this fuction is constant? answer should be A no? please corrrect me here...
0 votes
0 answers
4339
0 votes
0 answers
4340
if dijkstra's shortest path algorithm takes 8 seconds for a graph of 1000 nodes then approx. how much time would it take for a graph of 1000000 nodes?