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{2024-1} & \textbf{2024-2} & \textbf{2023} & \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1&2&2& 2 &3&2&1&2&3
\\\hline\textbf{2 Marks Count} &4&2&2& 2 &3&4&2&2.83&4
\\\hline\textbf{Total Marks} &9&6&6& 6 &9&10&\bf{6} & \bf{7.67}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Algorithms

0 votes
2 answers
301
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}.What is the value of deg(v1)+ de...
0 votes
0 answers
302
0 votes
0 answers
303
3 votes
1 answer
305
1 votes
1 answer
309
In an array A[1..n] of n distinct elements, if i < j and A[i] A[j], then the pair (i,j) is called an inversion of A.How many inversions are there in the array A = {n,n-1...
0 votes
1 answer
310
0 votes
0 answers
311
The solution of the recurrence: T(n) = 2T(n/3) + nlgn by given Θ - notation bound isΘ(nlgn)Θ($n^{2}$)Θ(n)Θ($n^{2}$lgn)
1 votes
0 answers
312
0 votes
0 answers
313
0 votes
0 answers
314
0 votes
0 answers
315
0 votes
0 answers
316
0 votes
0 answers
317
0 votes
0 answers
318
0 votes
0 answers
319
0 votes
0 answers
320