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

Recent questions in Algorithms

0 votes
0 answers
2201
Coreman
Show that the worst case running time of heap sort is Ω(nlogn).
Show that the worst case running time of heap sort is Ω(nlogn).
User Avatar
1 votes
0 answers
2203
Random
Please solve this without master's or extended master's theorem T(n) = 2T (n/2) + n/log n
Please solve this without master's or extended master's theoremT(n) = 2T (n/2) + n/log n
User Avatar
1 votes
1 answer
2206
TIME COMPLEXITY
User Avatar
0 votes
0 answers
2207
SELF DOUBT
User Avatar
4 votes
1 answer
2208
Binary search on two mutually exclusive arrays.
There are two sorted list each of length $n$ ... the search the moment we find the element. So tell me whose solution is correct? Why my solution should be incorrect?
There are two sorted list each of length $n$. An element to be searched in the both the lists. The lists are mutually exclusive. The maximum number of comparisons require...
User Avatar
1 votes
0 answers
2209
self doubt
how to find median of an array in O(N) time
how to find median of an array in O(N) time
User Avatar
2 votes
0 answers
2210
Hashing
what is minimum number of elements that need to be hashed into a hash table of size m with chaining in order to make sure that at least one hash location has a chain of length n?
what is minimum number of elements that need to be hashed into a hash table of size m with chaining in order to make sure that at least one hash location has a chain of l...
User Avatar
5 votes
1 answer
2215
minimum number of comparisons
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
User Avatar
2 votes
2 answers
2216
test series
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ? a) m+n-1 and m+n-1 b)m+n+1 and max(m,n) c)max(m,n) and min(m,n) d)m+n-1 and min(m,n) can someone give the worst case and best case with examples ?
To merge two lists of size m and n, how many comparisons we need to perform in the worst case and best case respectively ?a) m+n-1 and m+n-1b)m+n+1 and max(m,n)c)max(m,n)...
User Avatar
0 votes
0 answers
2219
Single source softest path via DFS
Hi Guys, BFS could be used for finding single source shortest path in unweighted graph. But could we use DFS also ? Please share your valuable opinion. PS: I think after little bit modification DFS could also be used but it's running time will increase.
Hi Guys,BFS could be used for finding single source shortest path in unweighted graph. But could we use DFS also ? Please share your valuable opinion.PS: I think after li...
User Avatar
1 votes
1 answer
2220
Strongly connected graph verification via BFS
Hi Guys, DFS could be used for finding directed graph is strongly connected or not. But could we use BFS also ? Please share your valuable opinion. ping @Kushagra Chatterjee, @Soumya29, @srestha, @Subarna Das and @VS ji.
Hi Guys,DFS could be used for finding directed graph is strongly connected or not. But could we use BFS also ? Please share your valuable opinion.ping @Kushagra Chatterje...
User Avatar
Page: