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

0 votes
2 answers
2671
Gate Sample Practise
Which of the following is not O(n^2)? (a) (15^10) * n + 12099 (b) n^1.98 (c) n^3 / (sqrt(n)) (d) (2^20) * n
Which of the following is not O(n^2)?(a) (15^10) * n + 12099 (b) n^1.98(c) n^3 / (sqrt(n)) (d) (2^20) * n
User Avatar
1 votes
2 answers
2672
Sample question for practise doubt
Consider the following 2 functions: f(n)= n3, if 0 ≤ n < 10,000 = n2, otherwise g(n)= n, if 0 ≤ n < 100 = n2 + 5n, otherwise Which of the following option is correct? (a) f(n) is O(n3) (b) g(n) is O(n3) (c) O(f(n)) is same as O(g(n)) (d) g(n) is O(1)
Consider the following 2 functions:f(n)= n3, if 0 ≤ n < 10,000= n2, otherwiseg(n)= n, if 0 ≤ n < 100= n2 + 5n, otherwise Which of the following option is correct?(a) ...
User Avatar
2 votes
1 answer
2673
Based on GATE2005-IT-53
https://gateoverflow.in/3814/gate2005-it-53 i am confused about how the while loop breaks if a=''DBC" and b="BD"? i suppose here both occurence of B and D will have zero count in count arrray when for loop is checked. please explain?
https://gateoverflow.in/3814/gate2005-it-53i am confused about how the while loop breaks if a=''DBC" and b="BD"?i suppose here both occurence of B and D will have zero co...
User Avatar
0 votes
1 answer
2674
Minimum number of spanning tree
For finding minimum number of spanning tree using kirchoff rule we construct adjacency matrix and find cofactors. so my question is what if we have 6*6 matrix or more than that then how to solve it .
For finding minimum number of spanning tree using kirchoff rule we construct adjacency matrix and find cofactors.so my question is what if we have 6*6 matrix or more than...
User Avatar
0 votes
1 answer
2675
T(n) =T(n^(1/2))+1
User Avatar
1 votes
1 answer
2676
What would be Huffman coding for :
What would be huffman coding for following : Character Frequency a 10 l 15 i 12 o 3 u 4 s 13 t 1 Explain this with suitable diagram..
What would be huffman coding for following : CharacterFrequencya10l15i12o3u4s13t1Explain this with suitable diagram..
User Avatar
0 votes
0 answers
2677
What is the value of the following recurrence?
T(n) = 3T(n/5) + lgn * lgn
T(n) = 3T(n/5) + lgn * lgn
User Avatar
0 votes
1 answer
2678
What is the value of the following recurrences?
1 :- T(n) = T(n-2) + n2 2 :- T(n) = 4T(n/3) + nlgn 3 :- T(n) = 3T(n/3 - 2) + n/2
1 :- T(n) = T(n-2) + n22 :- T(n) = 4T(n/3) + nlgn3 :- T(n) = 3T(n/3 - 2) + n/2
User Avatar
2 votes
3 answers
2679
Ace practice book
how to apply master's method for this recurrence relation $T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$
how to apply master's method for this recurrence relation $T\left ( n \right )= {}\sqrt{n}T\left ( {\sqrt{n}} \right )+n$
User Avatar
0 votes
1 answer
2681
recursive equation doubt
somewhere at the end solving a recursive equation we get like - 2^n+2^n-1+2^n-2+......+2^0 Someone please simplify in layman terms how come from 2^0 to 2^n we have (n+1) terms?
somewhere at the end solving a recursive equation we get like - 2^n+2^n-1+2^n-2+......+2^0Someone please simplify in layman terms how come from 2^0 to 2^n we have (n+1) t...
User Avatar
0 votes
1 answer
2682
Doubt
CAn anyone explian about 2-way merge sort ? (You can take example from GATE1999-1.14, ISRO2015-42)
CAn anyone explian about 2-way merge sort ?(You can take example from GATE1999-1.14, ISRO2015-42)
User Avatar
3 votes
1 answer
2685
Test by Bikram | Mock GATE | Test 4 | Question: 15
What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges? $O\left ( V+E \right )$ $O\left ( V \right )$ $O\left ( V^{2} +E \right )$ $O\left ( E\log V \right )$
What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges?$O\left ( V+E \right )$$O\left...
User Avatar
2 votes
1 answer
2687
Test by Bikram | Mock GATE | Test 4 | Question: 14
The worst case running time to search for an element in binary search tree with $2^{\log_2 n}$ elements is represented as $\Theta\left(n^{x \log_2 y}\right)$ . The value of $x$ + $y$ is _____.
The worst case running time to search for an element in binary search tree with $2^{\log_2 n}$ elements is represented as $\Theta\left(n^{x \log_2 y}\right)$ .The value o...
User Avatar
0 votes
3 answers
2690
MadeEasy Subject Test: Algorithms - Time Complexity
for an O(log n) algorithum , x takes 12 second to execute his data Y runs the same algorithum on same machine and it took him 20 sec for data size 32 the data size of X is ????
for an O(log n) algorithum , x takes 12 second to execute his data Y runs the same algorithum on same machine and it took him 20 sec for data size 32 the data size of X i...
User Avatar
Page: