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

Hot questions in Algorithms

11 votes
1 answer
2301
GATE CSE 1990 | Question: 2-vii
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Strassen's matrix multiplication algorithm} & (p) & \text{Greedy method} \\\hline (...
User Avatar
0 votes
0 answers
2302
sorting
Is there any other way to know how many swaps will be required in any sorting algorithm (like quick merge) other than following the normal method( because it take lot of time in normal method)
Is there any other way to know how many swaps will be required in any sorting algorithm (like quick merge) other than following the normal method( because it take lot of ...
User Avatar
0 votes
3 answers
2303
Asympotic Notation
$100n\log n = O(n\log n)$ How they are equal?
$100n\log n = O(n\log n)$How they are equal?
User Avatar
0 votes
0 answers
2304
Made easy workbook
User Avatar
0 votes
0 answers
2305
SELF DOUBT PLEASE ANSWER IT
https://gateoverflow.in/222060/algo-self-doubt
https://gateoverflow.in/222060/algo-self-doubt
User Avatar
0 votes
0 answers
2306
Algo: Time Complexity
What is the time complexity of the following piece of code in the terms of n? $Main()$ { $n=2^{2^k};$ $for(i=1; i<=n; i++)$ { $j=2;$ $while(j<=n)$ { $j=j^2;$ } } }
What is the time complexity of the following piece of code in the terms of n?$Main()${$n=2^{2^k};$$for(i=1; i<=n; i++)${ $j=2;$ $while(j<=n)$ { $j=j^2;$ }}...
User Avatar
2 votes
2 answers
2308
Test by Bikram | Algorithms | Test 2 | Question: 13
Which one of the following is a topological sort for the above graph? $1, 6, 2, 5, 3, 4$ $4, 5, 6, 3, 2, 1$ $2, 4, 5, 6, 3, 1$ $6, 4, 5, 2, 1, 3$
Which one of the following is a topological sort for the above graph?$1, 6, 2, 5, 3, 4$$4, 5, 6, 3, 2, 1$$2, 4, 5, 6, 3, 1$$6, 4, 5, 2, 1, 3$
User Avatar
2 votes
1 answer
2309
MadeEasy Test Series 2018: Algorithms - Dynamic Programming
The number of balance parenthesis possible with 5-pairs of parenthesis _________. [ Assume ( ) and (( )) is balance parenthesis but not ) ( ]
The number of balance parenthesis possible with 5-pairs of parenthesis _________. [ Assume ( ) and (( )) is balance parenthesis but not ) ( ]
User Avatar
0 votes
0 answers
2310
selfdoubt
consider x[1, ..., n] and y[1, ..., n] be two arrays each containing n-numbers both of which are already sorted. what is the time complexity to find median by combining the two array if we use merge procedure....? actually it is O(n) but i want to know is it due to 2n-1 comparisions???
consider x[1, ..., n] and y[1, ..., n] be two arrays each containing n-numbers both of which are already sorted. what is the time complexity to find median by combining t...
User Avatar
0 votes
1 answer
2311
Gate_2019_Mock_Paper
Please explained in detail
Please explained in detail
User Avatar
0 votes
0 answers
2312
Number of comparison
User Avatar
0 votes
1 answer
2313
recurrence relation
what is the recurrence relation for binary search and linear search? please explain how to derive them.
what is the recurrence relation for binary search and linear search?please explain how to derive them.
User Avatar
2 votes
1 answer
2314
algorithms
User Avatar
3 votes
0 answers
2315
PGEE 2018
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
User Avatar
1 votes
2 answers
2316
Binary Search
What is the worst case complexity for searching for a key in a sorted array using Binary Search??
What is the worst case complexity for searching for a key in a sorted array using Binary Search??
User Avatar
0 votes
0 answers
2317
cormen 3rd edition 7.2-6
Argue that for any constant 0<α≤1/2, the probability is approximately 1−2α that on a random input array, PARTITION produces a split more balanced than 1−α to α. Please explain how the probability is calculated?
Argue that for any constant 0<α≤1/2, the probability is approximately 1−2α that on a random input array, PARTITION produces a split more balanced than 1−α to α....
User Avatar
0 votes
0 answers
2318
Self DouBt
https://gateoverflow.in/549/gate1992-01-ix In this question why union find algo is used so the tym complexity became O(ElogN) ......E is no. of edges N is no. of vertices Instead of this we can use bfs to detect cycle in O(N+E) .... so what should be the answer??
https://gateoverflow.in/549/gate1992-01-ixIn this question why union find algo is used so the tym complexity became O(ElogN) ......E is no. of edges N is no. of verticesI...
User Avatar
0 votes
0 answers
2320
self doubt
User Avatar
Page: