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

Most answered questions in Algorithms

0 votes
1 answer
2006
me test
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______ How to solve such examples. Rules for math of asymptotic notations(mul,div,add,sub of diif notations)
Let $f (n) = Ο(n), g(n) = \Omega(n)$ and $h(n) = \theta(n)$. Then $g(n) + f(n).h(n)$ is ______How to solve such examples.Rules for math of asymptotic notations(mul,div,a...
User Avatar
1 votes
1 answer
2007
me test series
how the tc is O(n^4)
how the tc is O(n^4)
User Avatar
2 votes
1 answer
2008
Equivalent Complexity
Given f(n) = ω(n2). Which of the following can never hold? a. f(n) = O (n3) b. f(n) = Ω (n2) c. f(n) = θ (n2) d. f(n) = ω (n)
Given f(n) = ω(n2).Which of the following can never hold?a. f(n) = O (n3)b. f(n) = Ω (n2)c. f(n) = θ (n2)d. f(n) = ω (n)
User Avatar
2 votes
1 answer
2010
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
3 votes
1 answer
2013
#distinct MSTs
......................................................
......................................................
User Avatar
2 votes
1 answer
2014
Algorithms:Asymptotic Notations
plz help me . how to solve that type of question
plz help me . how to solve that type of question
User Avatar
3 votes
1 answer
2017
From Geeksforgeeks
Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algorithm to determine if a given number x is in the array?
Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algori...
User Avatar
1 votes
1 answer
2018
Algorithms
A sorting algorithm is stable if duplicate elements remain in the same relative position after sorting. What is the meaning of this statement
A sorting algorithm is stable if duplicate elements remain in the same relative position after sorting.What is the meaning of this statement
User Avatar
2 votes
1 answer
2019
Time Complexity
T(n)=4T(n/2)+n TC using iterative method with steps in short :) T(1) = 1
T(n)=4T(n/2)+nTC using iterative method with steps in short :)T(1) = 1
User Avatar
Page: