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
1 answer
4201
1 votes
2 answers
4203
0 votes
1 answer
4205
2 votes
4 answers
4207
0 votes
1 answer
4208
f(n)= n^0.0000001g(n)=lg n(base 2)Is g(n)=O(f(n))...?For the large values of nn= 10^8 f(n)= 1.0000018 , g(n)=26.565n=10^10 f(n)=1.0000023, g(n)=33.21So I am getting ...
0 votes
1 answer
4209
Is sqrt(n)+ log n = omega(log n)? If yes then please explain why...?
2 votes
1 answer
4211
2 votes
1 answer
4212
Algorithm Power(n) Pre: n :: Integer, n 0 i = 1 while (i < n) print i i = i * 3 done
1 votes
3 answers
4213
for(int i=0; i<n; i++) for(int j=i+1; j<n; j++) for(int k=j+1; k<n; k++)
0 votes
1 answer
4214
for(i=1;i<=n;i++,x=1) { for(j=1;j<=i;j++) { for(k=1;k<=j;x+=a,k*=a) { } } }find time complexity?
1 votes
1 answer
4215
4 votes
3 answers
4216
int fun(int n) { int count=0; for(int i=n; i>0; i/=2) for(int j=0; j<i; j++) count += 1; return count ; }