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

Hot questions in Algorithms

1 votes
0 answers
3001
1 votes
0 answers
3002
When can we can't apply master theorem.ghive some examples with explanation?
9 votes
2 answers
3003
The lower bound on the no. of comparisons required to sort n numbers is __________ ?
0 votes
1 answer
3004
What will be the time complexity?voidfun(){int i, j;for (i=1; i<=n; i++)for (j=1; j<=log(i); j++)printf("hello");}
1 votes
1 answer
3010
In the following C function, let n >= m.int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m,n); }How many recursive calls are made by this function? (A) (logn)?(B...
0 votes
0 answers
3011
is there any problem which can be solved by top down approach of dynamic programming but can not solve by bottom up approach or vice versa?
5 votes
1 answer
3012
The time complexity of recurrencerelationT(n) = T(n/3) + T(2n/3) + O(n) is(A) O(Ig n) (B) O(n)(C) O(nIgn) (D) O(n^2 )
1 votes
1 answer
3013
how do find which notations satisfy what propertiesfor example : big O doesnt satisfy symmetric but satisfies reflexive and transitivehow can this be found for various no...
2 votes
1 answer
3014
what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?
1 votes
2 answers
3015
g(n)=Ώ(n)h(n)=O(n)g(n) . h(n) =?
1 votes
1 answer
3017
0 votes
2 answers
3019
f(n) + o(f(n)) = thetha(f(n))Does this hold? o is small -oh notation.
2 votes
2 answers
3020