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

Recent questions in Algorithms

14 votes
5 answers
4141
How to find the complexity of T(n)=T(sqrt(n)) + 1 ?
Please tell me the complete steps how to solve this problem. $ T(n) = T ( \sqrt n )+ 1$
Please tell me the complete steps how to solve this problem.$ T(n) = T ( \sqrt n )+ 1$
User Avatar
1 votes
1 answer
4142
Time complexity of a while loop
Assuming n>2 A() { while(n>1) { n = n/2; } }
Assuming n>2 A() { while(n>1) { n = n/2; } }
User Avatar
2 votes
2 answers
4143
arrange the following in terms of asymptotic complexity
arrange the following in the increasing order of their asymptotic complexity in big theta notation $2^{2^{n}}, \log n ^{\log n} , (\frac{3}{2})^{n}, 2^{n}, \log n!$
arrange the following in the increasing order of their asymptotic complexity in big theta notation$2^{2^{n}}, \log n ^{\log n} , (\frac{3}{2})^{n}, 2^{n}, \log n!$
User Avatar
0 votes
1 answer
4145
Size of stack required is ?
A(n) { if(n>=1) { A(n-1); // statement 1 print n; //statement 2 A(n-1);// statement 3 } }
A(n) { if(n>=1) { A(n-1); // statement 1 print n; //statement 2 A(n-1);// statement 3 } }
User Avatar
0 votes
3 answers
4146
Asymptotic Notation
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly x.
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly ...
User Avatar
0 votes
1 answer
4147
DATA STRUCTURES
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort ru...
User Avatar
10 votes
2 answers
4148
ISRO2015-12
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately $50.2$ sec $6.7$ sec $72.7$ sec $11.2$ sec
A machine needs a minimum of $100$ sec to sort $1000$ names by quick sort. The minimum time needed to sort $100$ names will be approximately$50.2$ sec$6.7$ sec$72.7$ sec$...
User Avatar
1 votes
3 answers
4149
which of the following is correct
which of the following is correct?
which of the following is correct?
User Avatar
1 votes
1 answer
4150
doubt
How n + n/2 + n/4 + .... 1 can approximate it as an infinite GP? Is it =1+2+4+8+..........n/4 + n/2 +n ? =O(2^n) ?
How n + n/2 + n/4 + .... 1 can approximate it as an infinite GP?Is it =1+2+4+8+..........n/4 + n/2 +n ?=O(2^n) ?
User Avatar
0 votes
1 answer
4151
doubt
Is it loglog(2^2^2^2)=4 Let n=(2^(2^(2^2)))=2^16 Loglogn=4 T(n)=1+T(2^8)=2+T(2^4)=3+T(2^2)=4+T(2)=5 Let n= (2^(2^(2^(2^(2^2)))))=2^(2^65536) Loglog n = 65536
Is it loglog(2^2^2^2)=4Let n=(2^(2^(2^2)))=2^16Loglogn=4T(n)=1+T(2^8)=2+T(2^4)=3+T(2^2)=4+T(2)=5Let n= (2^(2^(2^(2^(2^2)))))=2^(2^65536)Loglog n = 65536
User Avatar
1 votes
2 answers
4152
What is the time complexity ?
time complexity question Sum=0 for(i=1; i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=1;k<=n;k++) { sum=sum+k; } } } }
time complexity questionSum=0 for(i=1; i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=1;k<=n;k++) { sum=sum+k; } } } }
User Avatar
1 votes
1 answer
4154
BFS DFS
User Avatar
0 votes
2 answers
4156
find the running time of the following nested loop
for(i=1;i<=n;i=i*2); for(j=1;j<=i;j=j+1); { }
for(i=1;i<=n;i=i*2);for(j=1;j<=i;j=j+1);{}
User Avatar
11 votes
3 answers
4157
find out the no. of spanning tree possible
How many spanning trees are possible from the graph given below? $24$ $34$ $44$ $54$
How many spanning trees are possible from the graph given below?$24$$34$$44$$54$
User Avatar
1 votes
1 answer
4158
Greedy method
what approch does the greedy method follows a)Top down b)Bottom up I heard the answer as Top down why it is? can any one explain me please
what approch does the greedy method followsa)Top down b)Bottom upI heard the answer as Top down why it is? can any one explain me please
User Avatar
0 votes
1 answer
4160
Time complexity
T(n+1)=T(n)+ceil[√(n+1)] , n>1 =1,n=1
T(n+1)=T(n)+ceil[√(n+1)] , n>1 =1,n=1
User Avatar
Page: