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

Filter

Most viewed questions in Algorithms

1 votes
0 answers
2371
Made Easy algorithms
How many maximum and minimum element comparisons are required to merge 2 sorted arrays of n and m elements into a single sorted array using merge sort procedure?
How many maximum and minimum element comparisons are required to merge 2 sorted arrays of n and m elements into a single sorted array using merge sort procedure?
User Avatar
0 votes
1 answer
2372
Binary Stream
We have a run of 0's followed by the run of 1's and we have to find the point where first 1 will be present. We only know the start of the sequence but we have no idea about the end. what should the best case complexity of this problem? Describe your approach.
We have a run of 0's followed by the run of 1's and we have to find the point where first 1 will be present. We only know the start of the sequence but we have no idea ab...
User Avatar
0 votes
1 answer
2374
Where to study from recurrence relations from scratch
According to gate CS, where is recurrence relations are used? How to learn to use them in Algorithms in solving T(n) Questions. Kindly mention the video lecture source to study recurrence relations and all the ways to solve them.
According to gate CS, where is recurrence relations are used?How to learn to use them in Algorithms in solving T(n) Questions.Kindly mention the video lecture source to s...
User Avatar
0 votes
4 answers
2376
complexity of function
User Avatar
1 votes
2 answers
2377
Sorting
What is the time complexity to divide an array of elements N into $Log N$ parts ? plz explain ?
What is the time complexity to divide an array of elements N into $Log N$ parts ? plz explain ?
User Avatar
1 votes
1 answer
2378
Calculate the time complexity
Let f(n) = Ω(n), g(n) = O(n) and h(n) = θ(n). Then [f(n) ⋅ g(n)] + h(n) is _______.
Let f(n) = Ω(n), g(n) = O(n) and h(n) = θ(n). Then [f(n) ⋅ g(n)] + h(n) is _______.
User Avatar
1 votes
2 answers
2382
Made easy test series
User Avatar
1 votes
0 answers
2384
Recurrence Realtion Soution and Time Complexity
$T(n)= \begin{Bmatrix} 2^{n}T(n-1)+c& n>0\\ 1 & n=0 \end{Bmatrix}$
$T(n)= \begin{Bmatrix} 2^{n}T(n-1)+c& n>0\\ 1 & n=0 \end{Bmatrix}$
User Avatar
1 votes
1 answer
2385
quick sort
is it quick sort is inplace algorithm. according to me it takes o(logn) space in best case and as i know any algo takes more then 0(1) spcae count as not inplace algo then why quick sort is inplace plz explain clearly
is it quick sort is inplace algorithm. according to me it takes o(logn) space in best case and as i know any algo takes more then 0(1) spcae count as not inplace algo...
User Avatar
2 votes
1 answer
2387
#GRAPH_ALGORITHM
I want to know in which condition we should apply BFS and DFS for GRAPH Search ? And why?
I want to know in which condition we should apply BFS and DFS for GRAPH Search ? And why?
User Avatar
1 votes
1 answer
2390
Self doubt
what is significance of loop Invariant? when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
what is significance of loop Invariant?when we use a loop in an algo we check it , if it properly runs then fix it in that, then why do check separately loop invariant ?
User Avatar
Page: