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
1 answer
181
Quicksort
In Quick sort of the following numbers, if the pivot is chosen as the first element, what will be the order of the numbers after the use of partition function ? Assume we are sorting in increasing order. 11, 15, 9, 13, 17, 7, 5, 12, 6, 18
In Quick sort of the following numbers, if the pivot is chosen as the first element, what will be the order of the numbers after the use of partition function ? Assume we...
User Avatar
0 votes
1 answer
183
Algo
User Avatar
0 votes
1 answer
184
Asymptotic notations
Can we write f(2$^{n/a}$) = Θ(2$^{n}$) for any integer a >0?
Can we write f(2$^{n/a}$) = Θ(2$^{n}$) for any integer a >0?
User Avatar
3 votes
1 answer
185
Google
$Find \ Time \ Complexity :$ $T(n) =$ $n^{\frac{1}{3}}$ . T($n^{\frac{2}{3}}$) + $\Theta (n)$
$Find \ Time \ Complexity :$ $T(n) =$ $n^{\frac{1}{3}}$ . T($n^{\frac{2}{3}}$) + $\Theta (n)$
User Avatar
1 votes
2 answers
187
Analysis of algorithms
Is ln(n!)=theta(n ln(n))?
Is ln(n!)=theta(n ln(n))?
User Avatar
0 votes
1 answer
188
Analysis of algorithms
If big oh is possible for an algorithm but big Omega is not,then is it small o?
If big oh is possible for an algorithm but big Omega is not,then is it small o?
User Avatar
0 votes
0 answers
189
Ace academy test series
Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect?
Time Complexity in C will be O(n) right? and big omega (n) is also big omega (n^2), then why is c incorrect?
User Avatar
0 votes
0 answers
191
I have a algorithm and i want to prove with induction, need help!
Hello, i have a algorithm and i want to prove it with induction how can i do that ? Also i want to worst case run time analyze but i am not very good please help me please. Thank you so much!
Hello, i have a algorithm and i want to prove it with induction how can i do that ?Also i want to worst case run time analyze but i am not very good please help me please...
User Avatar
0 votes
1 answer
195
Madeeasy Algorithm
How to solve this recurrence relation T(n)= T(0.09n) + T(0.91n) + cn where c is constant and T(1)=1 options are-
How to solve this recurrence relationT(n)= T(0.09n) + T(0.91n) + cnwhere c is constant and T(1)=1options are-
User Avatar
0 votes
0 answers
197
Algorithms
How option B is incorrect.
How option B is incorrect.
User Avatar
0 votes
1 answer
198
Algorithms
What is the logic applied here.
What is the logic applied here.
User Avatar
0 votes
1 answer
199
Algorithms
Focus on the word constraint , I am little confused (in meaning of the word)here. What should be the answer 2 or 16.
Focus on the word constraint , I am little confused (in meaning of the word)here. What should be the answer 2 or 16.
User Avatar
Page: