Register

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

Filter

Highest voted questions in Algorithms

1 votes
1 answer
2181
Algorithms
Are these two same? O(n!) and O(n^n)
Are these two same?O(n!) and O(n^n)
User Avatar
1 votes
0 answers
2182
what to do if master theorem can not be applied
what if some recurrence relation is not solvable by master theorem we should apply 1)recursion method or 2)substitution mnethod which is easier and accurate e.g if s is replaced by 5 in following question solve
what if some recurrence relation is not solvable by master theorem we should apply 1)recursion method or 2)substitution mnethod which is easier and accurate e.g if ...
User Avatar
1 votes
1 answer
2183
Master theorem
T(n)=3T(n/4)+nlogn In this if we use master theorem then how is f(n)=Ω(nlog43+ϵ) ?
T(n)=3T(n/4)+nlognIn this if we use master theorem then how is f(n)=Ω(nlog43+ϵ) ?
User Avatar
1 votes
1 answer
2186
#Algo
On which of the following recurrence relation Master Theorem cannot be applied? A. T(n)=2T(n/2)+nlogn B. T(n)=T(n/2)+1 C. T(n)=8T(n/2)+logn D. T(n)=7T(n/4)+n2 I think we can apply on all. But plz correct me with reason.Thanks
On which of the following recurrence relation Master Theorem cannot be applied?A. T(n)=2T(n/2)+nlognB. T(n)=T(n/2)+1C. T(n)=8T(n/2)+lognD. T(n)=7T(n/4)+n2I think we can a...
User Avatar
1 votes
2 answers
2188
#algo
If a directed graph G is cyclic but can be made acyclic by removing one edge,then a depth-first search in G will encounter exactly one back edge??
If a directed graph G is cyclic but can be made acyclic by removing one edge,then a depth-first search in Gwill encounter exactly one back edge??
User Avatar
1 votes
1 answer
2193
UGC NET CSE | August 2016 | Part 3 | Question: 36
Match the following : ... $\text{a-iii, b-i, c-iv, d-ii}$ $\text{a-iii, b-i, c-ii, d-iv}$
Match the following :$\begin{array}{clcl} \text{a.} & \text{Prim’s algorithm} & \text{i.} & \text{$O(V^2E)$} \\ \text{b.} & \text{Bellman-Ford algorithm} & \text{ii.} ...
User Avatar
1 votes
0 answers
2195
Virtual Test series
User Avatar
1 votes
0 answers
2198
Virtual Test Series
User Avatar
1 votes
1 answer
2199
Sorting
Consider the problem of adding two n-bit binary integers, stored in two n-element arrays A and B. The sum of the two integers should be stored in binary form in an (n+1)-element array C.What is the time and space complexity of it. I think O(n) and O(1).PLz explain
Consider the problem of adding two n-bit binary integers, stored in two n-element arrays A and B. The sum of the two integers should be stored in binary form in an (n+1)-...
User Avatar
1 votes
1 answer
2200
GATEBOOK
User Avatar
Page: