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}}}$$

Highest voted questions in Algorithms

1 votes
1 answer
2221
suppose a problem A reduces to problem B & reduction is done at $O(n^2)$ time.if the problem is solved in $O(n^3)$ time then what about the time of problem A___??$O(n^2)$...
1 votes
2 answers
2222
consider 2 function below1.f(n)=n2.g(n)=n^1+sinxwhich is true1.f(n)is g(n)2.f(n) is big omega(g(n))3.g(n) is O(f(n))4.none
1 votes
1 answer
2224
Big oh estimate forf(x)=(x+1)log($x^2 +1$)+3$x^2$ is given as1.O(xlogx)2.O($x^2$)3.O($x^3$)4O($x^2$logx)
1 votes
1 answer
2225
soluation for the recurrence relation isf(x)=2T(floor(rootn))+logn1.O(nlogloglogn)2.O(nloglogn)3.O(loglogn)4O(lognloglogn)
1 votes
1 answer
2226
given 2 sorted list of size m and n the number of comparison are required in worst case by merge sort algorithsm is1.mn2.max(m,n)3.min(m,n)4.m+n-1
1 votes
0 answers
2227
What is the best way to find the space complexity of a particular function ?
1 votes
1 answer
2229
1 votes
0 answers
2230
$T(n) = T(\lceil \frac{n}{2}\rceil ) + T(\lfloor \frac{n}{2}\rfloor) + 1$$\Theta(n \log n)$$\Theta(\log n)$$\Theta(\log_2 n)$$\Theta(n)$
1 votes
2 answers
2231
1 votes
1 answer
2232
2n is the order of 3n . Is it True or False ? State with reason.
1 votes
1 answer
2233
If f(n)=O(g(n)) then 2f(n)=O(2g(n)). Is this statement true ?
1 votes
1 answer
2234
The number of elements that can be sorted in time using heap sort ?
1 votes
1 answer
2238
We can show that the clique problem is $NP$-hard by proving thatCLIQUE $\leq$ P 3-CNF_SATCLIQUE $\leq$ P VERTEX_COVERCLIQUE $\leq$ P SUBSET_SUMNone of the above
1 votes
1 answer
2239
Match the following $:$$\begin{array}{} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Bucket sort} & \text{i.} & O(n^3\lg n) \\ \text{b.} & \text...
1 votes
0 answers
2240