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

9 votes
2 answers
2041
TIFR CSE 2018 | Part B | Question: 3
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $1$ $2$ $4$ $6$ $8$
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$1$$2$$4$$6$$8$
User Avatar
1 votes
0 answers
2042
Quick Sort Number Of Comparison Query
What is the number of Comparison to sort below arrays using quick sort using first element as pivot ? Please show steps . A1=4,1,5,3,2 A2=1,2,3,4,5
What is the number of Comparison to sort below arrays using quick sort using first element as pivot ?Please show steps .A1=4,1,5,3,2A2=1,2,3,4,5
User Avatar
3 votes
1 answer
2043
quick sort
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the best case performance is a) O(n2) b) O(nlogn) c) Θ(nlogn) d) O(n3)
You have an array of n elements. Suppose you implement quick sort by always choosing the central element of the array as the pivot. Then the tightest lower bound for the...
User Avatar
7 votes
5 answers
2044
ISRO2015-41
The number of spanning trees for a complete graph with seven vertices is $2^5$ $7^5$ $3^5$ $2^{2 \times 5}$
The number of spanning trees for a complete graph with seven vertices is$2^5$$7^5$$3^5$$2^{2 \times 5}$
User Avatar
0 votes
2 answers
2047
Testbook test series
Is the given answer correct?
Is the given answer correct?
User Avatar
0 votes
1 answer
2048
Big oh
Condition satisfies or not
Condition satisfies or not
User Avatar
0 votes
2 answers
2049
doubt in logarithm
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
User Avatar
1 votes
1 answer
2050
Time Complexity
Please find the time complexity of the following code:-int i,s1; i=1,s1=1; while(s1<=n) { i++; s1+=s1+i; printf("Hope"); }
Please find the time complexity of the following code:-int i,s1;i=1,s1=1; while(s1<=n) { i++; s1+=s1+i; printf("Hope"); }
User Avatar
0 votes
2 answers
2052
GATE Algorithm question
what will be the result when the following postfix expression with single digit operand is evaluated using stack: 8 2 3 ^ / 2 3 * + 5 1 * - ? A: 6, 1 B: 5, 7 C: 3, 2 D: 1, 5
what will be the result when the following postfix expression with single digit operand is evaluated using stack:8 2 3 ^ / 2 3 * + 5 1 * - ? A: 6, 1B: 5, 7C: 3, 2D: 1, 5
User Avatar
0 votes
0 answers
2053
what is correct answer algo
https://gateoverflow.in/20617/tifr2011-b-31 1+2(n-2) is correct ???i.e option d looks more correct....??
https://gateoverflow.in/20617/tifr2011-b-311+2(n-2) is correct ???i.e option d looks more correct....??
User Avatar
0 votes
0 answers
2054
DFS BFS
Please give an example i didn't get it The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
Please give an example i didn't get itThe depth of any DFS tree rooted at a vertex is at least as much as thedepth of any BFS tree rooted at the same vertex.
User Avatar
0 votes
0 answers
2055
Made easy test series
What is meant by wrong path in Dijikstra's algo. Can anyone please explain
What is meant by wrong path in Dijikstra's algo. Can anyone please explain
User Avatar
0 votes
0 answers
2056
#testbook_testseries
User Avatar
1 votes
0 answers
2059
shortest path algo
TRUE / FALSE Explain Please.. An undirected graph is said to be Hamiltonian if it has a cycle containing all the vertices. Any DFS tree on a Hamiltonian graph must have depth V − 1.
TRUE / FALSE Explain Please..An undirected graph is said to be Hamiltonian if it has a cycle containing all the vertices. Any DFS tree on a Hamiltonian graph must have de...
User Avatar
0 votes
0 answers
2060
Huffmann encoding
User Avatar
Page: