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

Hot questions in Algorithms

0 votes
0 answers
2101
self doubt
https://gateoverflow.in/2615/gate1995-2-3 what does while x<>y means ?how to begin the program?
https://gateoverflow.in/2615/gate1995-2-3what does while x<>y means ?how to begin the program?
User Avatar
0 votes
2 answers
2102
self doubt
Best and Worst case input for: 1. Selection Sort 2. Insertion Sort 3. Merge Sort 4. Quick Sort 5. Bucket Sort 6. Counting Sort 7. Bubble Sort
Best and Worst case input for:1. Selection Sort2. Insertion Sort3. Merge Sort4. Quick Sort5. Bucket Sort6. Counting Sort7. Bubble Sort
User Avatar
0 votes
2 answers
2103
Made Easy Algorithms
What is the time complexity for the code below? for(i=1; i<=n;i++) { for(j=1;j<=n;j++) { for(k=j+1;k<=n;k++) printf("Hi"); } }
What is the time complexity for the code below?for(i=1; i<=n;i++){for(j=1;j<=n;j++){for(k=j+1;k<=n;k++)printf("Hi");}}
User Avatar
0 votes
0 answers
2104
ALGORITHM
https://gateoverflow.in/82551/gate1987-11c IS IN SYLLABUS ?? WHAT IS THAT ALGO USED HERE??
https://gateoverflow.in/82551/gate1987-11cIS IN SYLLABUS ?? WHAT IS THAT ALGO USED HERE??
User Avatar
0 votes
3 answers
2105
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
2107
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
2108
Self doubt
When sorting technique is called stable?
When sorting technique is called stable?
User Avatar
0 votes
1 answer
2110
Self Doubt
User Avatar
0 votes
2 answers
2112
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
2113
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
2114
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
2115
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
2116
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
2117
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
2118
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
2119
Asymptotic analysis
Arrange them in increasing order
Arrange them in increasing order
User Avatar
1 votes
1 answer
2120
MIT_algorithms
I don't understand How?
I don't understand How?
User Avatar
Page: