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

1 votes
0 answers
2673
merge sort comparisons
User Avatar
1 votes
1 answer
2674
madeeasy
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ? A.O(n) B. θ(n) C. Ω(n) D. None of these Ans is given C Please explain how to solve such questions
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ?A.O(n)B. θ(n)C. Ω(n)D. None of theseAns is given CPlease explain how to solve such questio...
User Avatar
1 votes
0 answers
2675
algorithm
User Avatar
1 votes
1 answer
2677
Master Theorem
T(n) = 2T(n/2) + nlogn a. O(nlogn) b.n(log^2n) c.O(n^2)
T(n) = 2T(n/2) + nlogna. O(nlogn)b.n(log^2n)c.O(n^2)
User Avatar
0 votes
2 answers
2679
quick sort
User Avatar
2 votes
0 answers
2680
gate forum test series
The space complexity of which of the sorting algorithm depends on ordering of input? A) Heap-sort B) Merge sort C) Quick sort D) All of the above answer given : option C
The space complexity of which of the sorting algorithm depends on ordering of input?A) Heap-sortB) Merge sortC) Quick sortD) All of the aboveanswer given : option C
User Avatar
0 votes
0 answers
2681
NPTEL-Design and Analysis of Algorithms-Week1-Quiz-1-Q6
if T(n) = n2 √ n then T(n) = O(n2) T(n) = O(n2 log n) T(n) = O(n3) None of the above Im getting option 2 is it correct ?
if T(n) = n2 √ n thenT(n) = O(n2)T(n) = O(n2 log n)T(n) = O(n3)None of the aboveIm getting option 2 is it correct ?
User Avatar
1 votes
1 answer
2682
The minimum number of comparisons required
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............
User Avatar
1 votes
1 answer
2683
How to solve this recurrence relation?
Given RR as - T(n) = 2T(n/2)+n ; n>1 T(1) = 1 Solve this using only BACK SUBSTITUTION method? Note - I am stuck at T(n)= 2^k.T(n/2^k)+(2^k-1).n and I'm putting 2^k=n Please help me I am getting wrong answer!
Given RR as -T(n) = 2T(n/2)+n ; n>1T(1) = 1Solve this using only BACK SUBSTITUTION method? Note - I am stuck at T(n)= 2^k.T(n/2^k)+(2^k-1).nand I'm putting 2^k=n Please h...
User Avatar
–1 votes
0 answers
2684
recurrece relation stuck at some step.
j= n∗(1+1/2+1/2^2+1/2^3+..........1/2^k) how to solve this?
j= n∗(1+1/2+1/2^2+1/2^3+..........1/2^k) how to solve this?
User Avatar
1 votes
0 answers
2685
solve reccurrence relation further
$n^2 + 2n^2 + 4n^2 + ------- + 8^kT(\frac{n}{2^k})$ T(1) = 1
$n^2 + 2n^2 + 4n^2 + - + 8^kT(\frac{n}{2^k})$T(1) = 1
User Avatar
1 votes
0 answers
2687
#sorting
User Avatar
1 votes
0 answers
2688
made_easy
User Avatar
2 votes
1 answer
2689
priority based scheduling
Given that ready contains at some point of time a maximum of n process , the time complexity to schedule and dispatch a process from ready queue onto CPU using priority based scheduling is a)O(n) b)O(logn) c)O(nlogn) d)O(1)
Given that ready contains at some point of time a maximum of n process , the time complexity to schedule and dispatch a process from ready queue onto CPU using priority ...
User Avatar
Page: