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

0 votes
2 answers
1982
METest_Algo
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8. Please help me verify it.
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8.Please help me verify it.
User Avatar
0 votes
2 answers
1983
MadeEasy Subject Test: Algorithms - Sorting
a. i>0,K>0, a[K]> a[max] b. i>0,K<0, a[K]< a[max] c. i<0,K>0, a[K]> a[max] d. i>0,K>0, a[K]< a[max]
a. i>0,K>0, a[K] a[max]b. i>0,K<0, a[K]< a[max]c. i<0,K>0, a[K] a[max]d. i>0,K>0, a[K]< a[max]
User Avatar
2 votes
1 answer
1984
Self made
Find the time complexity of the following recurrance relation: T(n) = T(n - 1) + sin(n) , 'n' is measured in degree(s) Options are: A) $theta$(n) B) $theta$(1) C) $theta$(logn) D) $theta$(n.logn)
Find the time complexity of the following recurrance relation:T(n) = T(n - 1) + sin(n) , 'n' is measured in degree(s)Options are:A) $theta$(n) B) $t...
User Avatar
2 votes
2 answers
1988
merge sort no. of levels when input is n ??
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
HOW NO. OF LEVELS IS LOG N + 1 CAN ANYONE HELP ME , how to solve this and get log n + 1
User Avatar
1 votes
1 answer
1990
ACE-TestSeries:-Algorithm Time Complexity
Determine the time complexity of the program segment given below: k = n; while ( k > 0) { i = 1; for(j = 1; j <= n; j+=i) i++; k/=2; } $\Theta\left(n^2\right)$ $\Theta(n \log n)$ $\Theta(\log^2 n)$ $\Theta\left(\log n \sqrt n\right)$
Determine the time complexity of the program segment given below:k = n; while ( k 0) { i = 1; for(j = 1; j <= n; j+=i) i++; k/=2; }$\Theta\left(n^2\right)$$\Theta(n \log...
User Avatar
0 votes
2 answers
1992
Asymptotic Notation
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?
User Avatar
1 votes
1 answer
1994
Algorithms::Ace academy test series question
Can anyone explain me the answer in detail?
Can anyone explain me the answer in detail?
User Avatar
Page: