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

Questions without an upvoted answer in Algorithms

0 votes
0 answers
2
Calculate the minimum and maximum number of element comparisons involved in 2 way merge sort assuming n is power of 2.
1 votes
1 answer
7
0 votes
1 answer
8
The number of edges present in the forest generated by the $\text{DFS}$ traversal of an undirected graph $G$ with $100$ vertices is $40$. The number of connected componen...
0 votes
0 answers
15
Given the array \( [4, 3, 2, 1, 5] \), which of the following sorting algorithms can successfully sort the array in exactly two passes?Bubble SortInsertion Sort Selectio...
1 votes
0 answers
21
Consider the following three functions defined for all positive integers $n \geq 0$.\[\begin{array}{l}f(n)=|\sin (n)+n|, \\g(n)=n, \\h(n)=|\sin (n)| .\end{array}\]Which o...
0 votes
1 answer
25
0 votes
1 answer
26
Worst case time complexity of heap sort for n elementsO(nlogn)O(logn)O^2O(n)
0 votes
1 answer
27
0 votes
1 answer
28
In the following question common lcs numbers are 4 so first 3 option should be correct or only first...there is no only written in 2,3 like only 2 or 3 so we can mark 2,3...
0 votes
1 answer
29
int func(int n){if(n <= 1)return n;elsereturn 3*func(n-3) - 3*func(n-2); }The running time of the above function is
0 votes
1 answer
30
$\text{Please explain True or False and Why ?}$$\text{1. f(n) = O(f(n/2))}$$\text{2. f(n) = O($f(n)^{2}$) }$
To see more, click for the full list of questions or popular tags.