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

Recent questions in Algorithms

0 votes
0 answers
1741
I came across a term solving a Recurrence Relation using recursion method and it was - 2log(n) = n.How's this being solved? Thanks.
1 votes
1 answer
1743
In Randomized Quick sort, Can we have partitioning algorithm that never gives worst case as $O(n^2)$ for every input?
2 votes
2 answers
1745
0 votes
0 answers
1746
Show that $k \ln k = \Theta(n)$ implies $k=\Theta (n/\ln n)$
1 votes
0 answers
1747
Give an algorithm for finding the diameter of the binary tree
0 votes
0 answers
1749
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
0 votes
1 answer
1750
The left-to-right post-order traversal of a tree $T$ yields the following sequence of nodes:$$\text{D K E F B G L M H I J C A.}$$For each node of $T$, the deg...
0 votes
3 answers
1751
2 votes
1 answer
1752
5 votes
1 answer
1755
How do we come up with this formula for number of spanning tree of a n vertex complete graph Kn= $n^{n-2}$
3 votes
1 answer
1756
How to know that whether a sorting algorithm is online or offline ? For example , Insertion sort is online but Merge Sort is offline..Please explain ..
0 votes
1 answer
1757
i think answer must be O(1) , as whether n is power of 2 or not,result of if condition is always true
3 votes
1 answer
1758
The average successful search time taken by binary search on a sorted array of 5 CONSECUTIVE integers starting with 1?My Answer is - 2.2Kindly tell me is it correct or no...
2 votes
1 answer
1759
Use the recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=T(n-1)+T($\frac{n}{2}$)+n. Use substitution method to verify the answer.
1 votes
1 answer
1760
Consider the modified merge sort where we divide array into 5 equal sub arrays instead if 2(as in standard merge sort).What is the time complexity if modified merge sort?...