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

Hot questions in Algorithms

#3141
594
views
1 answers
2 votes
The problem of finding the set of vertices reachable from a given vertex in a graph can be solved in timeA. O(|V|^2)B. O(|V| + |E|)C. O(|V||E|)D. none of these
#3142
340
views
0 answers
2 votes
https://gateoverflow.in/664/gate2000-2-17
#3143
761
views
1 answers
3 votes
How to apply back substiution method on following recursive equation to find time complexity:T(n)= 2 T(n/2) + (n/log n) , where "n" is input.
#3144
194
views
0 answers
1 votes
https://gateoverflow.in/1076/gate2004-82?show=141252#c141252Can somenone please explain this questionI really dont understand the difference made by the statement "counte...
#3145
1.3k
views
1 answers
7 votes
Given an undirected weighted graph $G = (V, E)$ with non-negative edge weights, we can compute a minimum cost spanning tree $T = (V, E')$. We can also compute, for a give...
#3146
201
views
0 answers
0 votes
Suppose an array A={a1,a2,…………an} contains a set of n distinct coins types where each ai € N for 1<=n. Suppose also that a1<a2<a3……………<an the coin han...
#3147
242
views
1 answers
0 votes
for(i=0;i<=n;i++) for(j=i;j<=n;j++) for(k=j;k<=n;k++) S++;
#3148
5.7k
views
1 answers
1 votes
Consider an algorithm A which solves problems by dividing them into seven sub-problems each with half the size of the original problem, recursively solving each subproble...
#3149
4.9k
views
1 answers
5 votes
A Hash Function $f$ defined as $f(key)= key \mod 7$. With linear probing while inserting the keys $37,38,72,48,98,11,56$ into a table indexed from $0$, in which location ...
#3150
575
views
2 answers
1 votes
fib(n){if(n==0)return 0;if(n==1)return 1;return(fib(n-1) + fib(n-2));}for fib(4) the number of function calls by dynamic programmming is 7and without dynamic programming ...
#3151
493
views
2 answers
2 votes
what the time complexity forT(n)=5T(n/2)+n^2a. nb.n^2
#3152
740
views
1 answers
1 votes
What is the ans and give reason
#3153
2.2k
views
2 answers
1 votes
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.
#3154
577
views
0 answers
1 votes
Which is not O(n^2)?a) (15^10) *n +12099b) n^1.98c) n^3 / sqrt(n)d) (2^20)*n
#3155
193
views
1 answers
1 votes
What is the upper bound of n! Please provide a logical deduction to prove that its $n^{n}$.
#3156
464
views
1 answers
3 votes
Where I can find best algorithm video.
#3157
1.6k
views
1 answers
1 votes
How to find number of BFS and DFS traversals for any complete graph? I am trying to find a formula for it.
#3158
492
views
1 answers
0 votes
Is the answer for question 20 correct?
#3159
242
views
0 answers
0 votes
T(n)= T(n-1) + T(n-2) – T(n-3)Given is the recurrence relation for Time Complexity.Is this type of recurrence relation for Time Complexity possible ?If yes, then please...
#3160
392
views
0 answers
1 votes
consider a problem defined on input of size n, if it is solved usuing greedy strategy then its time complexity is never less thana) O(n^2)b)O(n log n)c)O(logn)d) O(n)