Register

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

Filter

Hot questions in Algorithms

0 votes
2 answers
1981
Test Series
User Avatar
0 votes
0 answers
1982
Floyd-Warshall and Bellman Ford(Cormen)
What are the asymptotic running times for INSERT, EXTRACT-MIN, and DECREASE-KEY of Floyd Warshall and Bellman Ford Algorithm?
What are the asymptotic running times for INSERT, EXTRACT-MIN, and DECREASE-KEY of Floyd Warshall and Bellman Ford Algorithm?
User Avatar
0 votes
2 answers
1983
class notes
find time complexity f(int n){ int i=1; while(i<n) { int j=n; while(j>0) j=j/2; i=i*2; } }
find time complexityf(int n){int i=1;while(i<n){int j=n;while(j>0)j=j/2;i=i*2;}}
User Avatar
1 votes
0 answers
1984
Test Series
User Avatar
0 votes
0 answers
1986
algorithms
int recfunc( int n ) 2 { if( ) 3 return n; 4 int i=0; 5 while(i<100){ 6 printf ("HELLO"); 7 i=i+1; } 8 int a; 9 a=2* recfunc(n/2); 10 while(j<a){ 11 printf("BYE !"); 12 j=j+1; } 13 return a; } what is the recurrence relation for this?
int recfunc( int n )2 { if( )3 return n;4 int i=0;5 while(i<100){6 printf ("HELLO");7 i=i+1;}8 int a;9 a=2* recfunc(n/2);10 while(j<a){11 printf("BYE !");12...
User Avatar
0 votes
0 answers
1987
Time Complexity
Running time of an algorithm T(n), where n is input size, is given by T(n)=T(n-6)+n2 if n>7 and T(n)=1 if n<=7. The algorithm is order of θ notation is__ ? The answer is given as θ(n3). Please provide solution.
Running time of an algorithm T(n), where n is input size, is given by T(n)=T(n-6)+n2 if n>7 and T(n)=1 if n<=7. The algorithm is order of θ notation is__ ?The answer is ...
User Avatar
0 votes
0 answers
1988
self doubt
Longest subarray having average greater than or equal to x. Given an array of N integers. The task is to find the longest contiguous subarray so that the average of its elements is greater than or equal to a given number X. What will be the approach to solve the problem?
Longest subarray having average greater than or equal to x. Given an array of N integers. The task is to find the longest contiguous subarray so that the average of its e...
User Avatar
0 votes
1 answer
1989
Time complexity
User Avatar
0 votes
0 answers
1990
DFS algorithms
state TRUE or FALSE. and why Running a DFS on an undirected graph G = (V;E) always produces the same number of cross edges, no matter what order the vertex list V is in and no matter what order the adjacency lists for each vertex are in.
state TRUE or FALSE. and whyRunning a DFS on an undirected graph G = (V;E) always produces the samenumber of cross edges, no matter what order the vertex list V is in and...
User Avatar
1 votes
3 answers
1992
Dijkstra Algorithm
I think answer should be Option(B). Path:<s,y><y,x><x,t> = 7-3-2=2
I think answer should be Option(B).Path:<s,y><y,x><x,t = 7-3-2=2
User Avatar
0 votes
1 answer
1993
#self doubt #Lcs
How many distinct function calls are there in LCS(m,n)=. How to calculate it?
How many distinct function calls are there in LCS(m,n)=. How to calculate it?
User Avatar
0 votes
0 answers
1994
Algorithm time complexity
suppose Merge sort algorithm takes 2 sec to sort a set of 64 keys then how much time will it take to sort a set of 512 keys ??
suppose Merge sort algorithm takes 2 sec to sort a set of 64 keys then how much time will it take to sort a set of 512 keys ??
User Avatar
0 votes
0 answers
1995
Asymptotic
User Avatar
0 votes
3 answers
1996
Time Complexity
What is the time complexity of the following? for(i=0; i < n *n ; i = i *i) print("*");
What is the time complexity of the following?for(i=0; i < n *n ; i = i *i)print("*");
User Avatar
0 votes
1 answer
1997
class book
C function let n>=m. int gcd(n,m) { if(n%m==0) return m; n=n%m; return gcd(m,n); } time complexity
C function let n>=m.int gcd(n,m){if(n%m==0) return m;n=n%m;return gcd(m,n);} time complexity
User Avatar
0 votes
0 answers
1999
#self doubt
https://gateoverflow.in/258/gate2003-66 if we are using binary search thn it should be O(logn) ,how it is O(log n)^2?
https://gateoverflow.in/258/gate2003-66if we are using binary search thn it should be O(logn) ,how it is O(log n)^2?
User Avatar
0 votes
0 answers
2000
#self doubt
solve by using tree method!
solve by using tree method!
User Avatar
Page: