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
1 answer
3001
Recursive call count for merge sort
User Avatar
0 votes
3 answers
3002
time complexity Master's Theorem problem from CLRS
1) T(n)=T(n-1)+1/n. 2) T(n)=T(n-1) +1/log(n) 3)T(n)=3T((n/3) - 2)+n/2. 4)T(n)=T(n/2)+T(n/4)+T(n/8)+n. Use Masters theorem
1) T(n)=T(n-1)+1/n.2) T(n)=T(n-1) +1/log(n)3)T(n)=3T((n/3) - 2)+n/2.4)T(n)=T(n/2)+T(n/4)+T(n/8)+n.Use Masters theorem
User Avatar
3 votes
1 answer
3004
recurrence
User Avatar
0 votes
1 answer
3005
LCS problem
User Avatar
3 votes
1 answer
3006
Time Complexity
what is the tightest upper bound of T(n)=T(n-1)+2n
what is the tightest upper bound of T(n)=T(n-1)+2n
User Avatar
0 votes
1 answer
3007
Algorithms: Finding time complexity
T(n)=2T(log n)+c c is a constant. Base condition is if(n<2) return 1 What will be the tightest bound on time complexity?
T(n)=2T(log n)+c c is a constant. Base condition is if(n<2) return 1What will be the tightest bound on time complexity?
User Avatar
0 votes
0 answers
3010
doubt
User Avatar
3 votes
0 answers
3011
can dfs be used for verifying graph is bipartite or not??
i have read from made easy coaching that DFS cant be used to verify given graph is bipartite or not...but there are some refernces i have found on some site where DFS can be used...
i have read from made easy coaching that DFS cant be used to verify given graph is bipartite or not...but there are some refernces i have found on some site where DFS ca...
User Avatar
0 votes
1 answer
3012
Algo doubt
User Avatar
1 votes
2 answers
3013
DOUBT
Pls Explain how to do this.
Pls Explain how to do this.
User Avatar
0 votes
1 answer
3014
Back Edge
User Avatar
0 votes
1 answer
3016
Madeeasy test series
f(n)=Ω(n) g(n)=Ω($n^{2}$) then f(n)+g(n) is? 1)Ω(n) 2)ϴ(n) 3)Ω($n^{2}$) 4)Ο(n)
f(n)=Ω(n) g(n)=Ω($n^{2}$) then f(n)+g(n) is?1)Ω(n)2)ϴ(n)3)Ω($n^{2}$)4)Ο(n)
User Avatar
0 votes
2 answers
3017
doubt
Given 8 sorted lists, each list of size n/8. If we merge these lists into a single sorted list of n elements, how many comparisons are required in worst case using an efficient algorithm? How to do this..pls help..
Given 8 sorted lists, each list of size n/8. If we merge these lists into a single sorted list of n elements, how many comparisons are required in worst case using an eff...
User Avatar
0 votes
0 answers
3018
doubt
Which of the following statements is/are TRUE? I. Sorting 7 numbers takes 10 comparisons using binary tree II. Merge sort can be implemented to be stable Pls explain.
Which of the following statements is/are TRUE?I. Sorting 7 numbers takes 10 comparisons using binary treeII. Merge sort can be implemented to be stablePls explain.
User Avatar
Page: