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

Most viewed questions in Algorithms

0 votes
0 answers
2221
ACE Test Series
User Avatar
1 votes
0 answers
2222
solve this
$T(n) = 2t(\frac{n}{2}) + \frac{n}{\log n } ; T(1 ) =1$
$T(n) = 2t(\frac{n}{2}) + \frac{n}{\log n } ; T(1 ) =1$
User Avatar
3 votes
2 answers
2229
CMI2014-B-07c
Consider the code below, defining the function $A$: A(m, n, p) { if (p == 0) return m+n; else if (n == 0 && p == 1) return 0; else if (n == 0 && p == 2) return 1; else if (n == 0) return m; else return A(m, A(m,n-1,p), p-1); } Compute $A(2, 2, 3)$ and $A(2, 3, 3)$.
Consider the code below, defining the function $A$:A(m, n, p) { if (p == 0) return m+n; else if (n == 0 && p == 1) return 0; else if (n == 0 && p == 2) return 1; else if ...
User Avatar
1 votes
1 answer
2230
Advance test algorithms
Is there Any short cut to do these questions fast ?
Is there Any short cut to do these questions fast ?
User Avatar
3 votes
1 answer
2231
asymptotic notation
a) T(n) = √n T(√n) + n b) T(n) = 4T(n/2) + n2 √(2)
a) T(n) = √n T(√n) + nb) T(n) = 4T(n/2) + n2 √(2)
User Avatar
1 votes
1 answer
2232
master theorem
is the time complexity for this fuction is O(n)?
is the time complexity for this fuction is O(n)?
User Avatar
1 votes
2 answers
2233
Paragraph from Coreman. Can anyone explain me this in simplified manner.
HI i am trying to understand what author is trying to explain in the below para. However i understood the meaning of Theta(n^2) but if anyone can explain me this para in simplified way it will be great help.
HI i am trying to understand what author is trying to explain in the below para. However i understood the meaning of Theta(n^2) but if anyone can explain me this para in ...
User Avatar
1 votes
1 answer
2234
Hashing
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n - k + k( 1-\frac{1}{k})^n$ ??
User Avatar
2 votes
4 answers
2235
GATE Overflow | Algorithms | Test 1 | Question: 19
Is an array that is sorted in decreasing order a max-heap? always yes always no sometimes only yes but not in presence of duplicates
Is an array that is sorted in decreasing order a max-heap?always yesalways nosometimes onlyyes but not in presence of duplicates
User Avatar
1 votes
0 answers
2236
Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
User Avatar
1 votes
1 answer
2238
qUICK sORT
Consider the following sequence of letters (Assume always select last element as pivot and array index starts with 0) Q, U, I, C, K, S, O, R, T, E, X, A, M, P, L, E What is the position of pivot element after completion of first pass?
Consider the following sequence of letters (Assume always select last element as pivot and array index starts with 0)Q, U, I, C, K, S, O, R, T, E, X, A, M, P, L, EWhat is...
User Avatar
Page: