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

Most answered questions in Algorithms

3 votes
1 answer
2371
CAN SOMEONE SOLVE THE NUMBER OF COMPARISIONS FOR COMPUTING MIN AND MAX IN AN ARRAY USING DIVIDE N CONQUER??RECURRENCE RELATION IS$ T(n) = 2 T(\frac{n}{2}) + 2 $IT SHOULD ...
0 votes
1 answer
2372
How to find space complexity of fibbo series ..
0 votes
1 answer
2373
0 votes
1 answer
2374
The tightest lower bound on the number of comparisons, in worst case for comparison based sorting is of the order of ?(A)$n$(B)$n^2$(C)$nlogn$(D)$n \space{log\space n}^2$...
1 votes
1 answer
2375
which sorting algorihm is used if we have a telephone directory wit 1,00,000 entries ?
0 votes
1 answer
2376
0 votes
1 answer
2377
prove that if(n)=o(g(n)) if and only if g(n)=Ώ(f(n))? it comes under transitive property
0 votes
1 answer
2379
Is Quick Sort an in-place algorithm?I read somewhere that although its space complexity is O(logn) [best case], it is referred to as an in place algo by Wikipedia because...
1 votes
1 answer
2380
$\begin{bmatrix} 0& 29& 19& 25& 22\\ 20& 0& 21& 23& 21\\ 19& 21& 0& 21& 20\\ 25& 23& 21& 0& 32\\ 22& 21& 20& 22& 0 \end{bmatrix}$Find the shortest tour for given graph us...
0 votes
1 answer
2382
Consider the Knapsack incidence with n=3(items) with weights {w1,w2,w3}={2,3,4} and profits are {p1,p2,p3}={1,2,5}Given the capacity is 5,{W/M = 5 } Find the optimal solu...
1 votes
1 answer
2383
If a graph has k-independent components, it it n-k+1 colorable
3 votes
1 answer
2384
1 votes
1 answer
2385
A machine takes 200 second to sort 200 names, using bubble sort . In 800 seconds , it can approximately sort how many names?
2 votes
1 answer
2386
Given two singly linked list of size n. The time complexity of computing the union and intersection of two linked list is.a) O(n) and O(nlogn)b) O(n) and O(n)c) O(nlogn) ...
2 votes
1 answer
2388