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

2 votes
2 answers
3021
merge sort no. of levels when input is n ??
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
User Avatar
0 votes
2 answers
3023
UGC NET CSE | December 2010 | Part 2 | Question: 22
A binary tree with $27$ nodes has _______ null branches. $54$ $27$ $26$ None of the above
A binary tree with $27$ nodes has _______ null branches.$54$$27$$26$None of the above
User Avatar
3 votes
1 answer
3024
Time Complexity for Recurrence relation
What will be the time complexity for the following recurrence relation? $T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$ According to me it is $\Theta (n(logn)^{3})$ . Please confirm.
What will be the time complexity for the following recurrence relation?$T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$According to me it is $\Theta (n(logn)^{3})$ . Please con...
User Avatar
1 votes
1 answer
3025
Generate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
Genearate atleast 3 solutions for 5 x 5 queen problem
User Avatar
1 votes
0 answers
3026
number of movements in Insertion sort
will A[i+1]=key; in the insertion sort be counted as a movement in best case?
will A[i+1]=key; in the insertion sort be counted as a movement in best case?
User Avatar
0 votes
1 answer
3027
asymptotic notation
f(n) = theta(n) , g(n) = Omega(n) , h(n) = O(n) then f(n) + [g(n) -h(n)] ?
f(n) = theta(n) , g(n) = Omega(n) , h(n) = O(n)then f(n) + [g(n) -h(n)] ?
User Avatar
2 votes
1 answer
3028
algorithm
time complexity of multiplying two long integers of n - digits each using divide and conquer method is a)O(n^2) b)O(n) c)O(n^3) d)O(n logn)
time complexity of multiplying two long integers of n - digits each using divide and conquer method isa)O(n^2)b)O(n)c)O(n^3)d)O(n logn)
User Avatar
0 votes
1 answer
3029
Time complexity
An unsorted list contain log(n) (base 2) distinct elements. The time complexity to find an element in this list that is neither maximum nor minimum is?
An unsorted list contain log(n) (base 2) distinct elements. The time complexity to find an element in this list that is neither maximum nor minimum is?
User Avatar
1 votes
0 answers
3030
Corman Algo
if f(n)=n/log n and c=2 Than f*(n)=?
if f(n)=n/log nand c=2 Than f*(n)=?
User Avatar
2 votes
1 answer
3031
time complexity
If F(n) = (log n)n then, is F(n) = O(n2) true? Also, what about F(n) = $\Theta$(n2)
If F(n) = (log n)n then, is F(n) = O(n2) true?Also, what about F(n) = $\Theta$(n2)
User Avatar
2 votes
1 answer
3032
#Back-substitution
How to solve the following recurrence by back substitution. T(n)= √2 *T(n/2) + c , for n>1 = a for n=1
How to solve the following recurrence by back substitution.T(n)= √2 *T(n/2) + c , for n>1 = a for n=1
User Avatar
0 votes
0 answers
3033
DYNAMIC PROGRAMMING
User Avatar
3 votes
1 answer
3035
Time Complexity
Is the answer D ?
Is the answer D ?
User Avatar
0 votes
0 answers
3036
Algo doubt
What is constant amortized time? How using Amortized Analysis, we could prove that the Dynamic Table scheme has O(1) insertion time when n insertion is being done? Can anybody please explain...
What is constant amortized time?How using Amortized Analysis, we could prove that the Dynamic Table scheme has O(1) insertion time when n insertion is being done?Can anyb...
User Avatar
3 votes
1 answer
3037
RADIX SORT
Consider an array of n integers ranges from 0, 1, ..., n5-1. What is the time complexity of RADIX-SORT when using base-10 representation?
Consider an array of n integers ranges from 0, 1, ..., n5-1. What is the time complexity of RADIX-SORT when using base-10 representation?
User Avatar
3 votes
1 answer
3039
min max using divide and conquer
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER?? RECURRENCE RELATION IS $ T(n) = 2 T(\frac{n}{2}) + 2 $ IT SHOULD COME TO $ \frac{3*n}{2} - 2 $ ??
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER??RECURRENCE RELATION IS$ T(n) = 2 T(\frac{n}{2}) + 2 $IT SHOULD ...
User Avatar
1 votes
1 answer
3040
Show the approach
Recurrence: $T\left ( n \right )\leq T\left ( \frac{n}{5} \right )+T\left ( \frac{7n}{10} \right )+\Theta \left ( n \right )$
Recurrence:$T\left ( n \right )\leq T\left ( \frac{n}{5} \right )+T\left ( \frac{7n}{10} \right )+\Theta \left ( n \right )$
User Avatar
Page: