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

Hot questions in Algorithms

0 votes
1 answer
1922
1 votes
2 answers
1923
Could a binary search tree be built using o(n lg n) comparisons in the comparisonmodel? Explain why or why not.
2 votes
1 answer
1924
Which of the given options provides the increasing order of asymptotic complexity of functions $f1$, $f2$, $f3$ and $f4$? $f1(n) = 2^n \\ f2(n) = n^{(3/2)} \\ f3(n) = nl...
1 votes
0 answers
1925
0 votes
2 answers
1926
0 votes
0 answers
1927
Hii guys.Someone please have a look at this and tell me if I got it right.for(i=1;i<=n;i++)for(j=1;j<=i^2;j++)for(k=1;k<=j;k++)printf("welcome");what is the time complexi...
0 votes
0 answers
1928
1.Time complexity to construct a binary search tree of n distinct elements?2.Meaning of Unique BST? 3.same 1 for but unique BST?3.if either preorder or postorder is give...
0 votes
0 answers
1929
0 votes
0 answers
1931
Arrange the following functions in decreasing asymptotic order:f(n)= 32^ng(n)= n!n3(a) f(n),g(n)(b) g(n),f(n)
0 votes
1 answer
1932
n sorted subarrays each of size log n. find single sorted array with all elements.find time complexity
4 votes
1 answer
1933
Show how to solve the fractional knapsack problem in $O(n)$ time.
0 votes
1 answer
1935
0 votes
1 answer
1936
0 votes
0 answers
1937
1 votes
0 answers
1939
0 votes
0 answers
1940