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

0 votes
3 answers
2101
Masters theorem
Solve using Master's Theorem $T(n)=T(n/2)+$ 2n
Solve using Master's Theorem$T(n)=T(n/2)+$ 2n
User Avatar
0 votes
0 answers
2103
Backtracking Vs Branch and Bound Paradigm Vs Dynamic Programming Vs Greedy Algorithm
I am getting confused among the terms : Backtracking, Branch and Bound Paradigm, Dynamic Programming and Greedy Algorithm. Can anyone tell their similarities and differences?
I am getting confused among the terms : Backtracking, Branch and Bound Paradigm, Dynamic Programming and Greedy Algorithm.Can anyone tell their similarities and differenc...
User Avatar
1 votes
1 answer
2104
Self doubt
When sorting technique is called stable?
When sorting technique is called stable?
User Avatar
0 votes
1 answer
2106
Self Doubt
User Avatar
0 votes
2 answers
2108
Slowness and Fastness of any algorithm
How the slowness and the fastness of any algorithm depends ? Is (n/logn) is slower than log(logn) ?
How the slowness and the fastness of any algorithm depends ?Is (n/logn) is slower than log(logn) ?
User Avatar
0 votes
0 answers
2109
SELF DOUBT REGARDING TYM TO SOVLE IN EXAM
https://gateoverflow.in/957/gate2003-70 CAN THIS CASE GIVEN IN THIS EXAMPLE CAN BE SIMULATE IN 3-4 MINUTES IN EXAM .....??
https://gateoverflow.in/957/gate2003-70CAN THIS CASE GIVEN IN THIS EXAMPLE CAN BE SIMULATE IN 3-4 MINUTES IN EXAM .....??
User Avatar
0 votes
1 answer
2110
time complexity
I am not able to understand whether to add constant or not while forming recursive equation
I am not able to understand whether to add constant or not while forming recursive equation
User Avatar
2 votes
1 answer
2111
Self doubt algorithms
In coremen it is given that $\log^kn$=$(\log n)^k$ $\log\log n$ is not equal to $\log^2n$ i understood it with example please correct me if I am wrong .
In coremen it is given that$\log^kn$=$(\log n)^k$$\log\log n$ is not equal to $\log^2n$ i understood it with exampleplease correct me if I am wrong .
User Avatar
1 votes
0 answers
2112
Self doubt
Is it True or False Let there be two algorithms If an algorithm is growing asymptotically faster will take more time than other.
Is it True or FalseLet there be two algorithmsIf an algorithm is growing asymptotically faster will take more time than other.
User Avatar
1 votes
1 answer
2113
Made Easy Algorithms
for(i=n,j=1;i>=1;i=i/2,j=j+i) What is the value of j by the end of the loop? a) O(log n) b)O(n) c) O(n2) d)O(n log n) How do I calculate this?
for(i=n,j=1;i>=1;i=i/2,j=j+i)What is the value of j by the end of the loop?a) O(log n) b)O(n) c) O(n2) d)O(n log n) How do I calculate this?
User Avatar
3 votes
2 answers
2114
Find the value of p
Consider following program and determine the value of p after execution of program:- main() { p = 1; for(i=1;i<=n;i++) { for(j=1;j<=n;j=5*j) { p = p + n; } } } I think p's final value should be p = 1+n2log5n.
Consider following program and determine the value of p after execution of program:-main() { p = 1; for(i=1;i<=n;i++) { for(j=1;j<=n;j=5*j) { p = p + n; } } }I think p's ...
User Avatar
1 votes
1 answer
2115
Asymptotic analysis
Arrange them in increasing order
Arrange them in increasing order
User Avatar
1 votes
1 answer
2116
MIT_algorithms
I don't understand How?
I don't understand How?
User Avatar
0 votes
0 answers
2118
gateforum test algorithms
i mark the option D)
i mark the option D)
User Avatar
0 votes
0 answers
2120
Introduction to Algorithm - Cormen
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2 Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
I didn't understand Big-O notation: This is CORMEN exercise problem - 3.1-2Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
User Avatar
Page: