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

4 votes
1 answer
1801
Which of the following represents most appropriate asymptotic solution for given reccurance:(A) O(n)(B) O(log n)(C) O(log log n)(D) O(log n)2
0 votes
0 answers
1802
Given a set of n distinct integers. It is desired to determine smallest of these integers using comparisons. Which is true?A) n + O(1) comparisonsB) n + O(logn) compariso...
0 votes
0 answers
1806
2 votes
0 answers
1807
https://gateoverflow.in/39620/gate2016-2-41HOW WE ARE DOING IN O(M+N) TIME ......WHAT IS PROCEDURE TO DO THAT ?
0 votes
0 answers
1809
7 votes
3 answers
1810
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
0 votes
0 answers
1811
0 votes
0 answers
1812
What is the time complexity of kirchoff's theorem used for finding number of spanning trees possible of undirected graphs?
4 votes
0 answers
1813
for(int i=0; i < n; i++) { for(int j=0; j < (2*i); j+=(i/2)) { cout<<"Hello Geeks"; } }is it o(nlogn)??
0 votes
1 answer
1814
0 votes
1 answer
1815
The average number of comparisons made by binary search for an unsuccessful search in array A
0 votes
0 answers
1816
What is the smallest value of $n$ (where $n$ is a natural number) such that an algorithm whose running time is $100\sqrt{n}$ runs faster than an algorithm whose running t...
18 votes
3 answers
1818
Consider the quick sort algorithm on a set of $n$ numbers, where in every recursive subroutine of the algorithm, the algorithm chooses the median of that set as the pivot...