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
2043
made easy
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
can anyone explain how dijkstras will behave as BFS whwn a graph is unweighted?
User Avatar
0 votes
1 answer
2046
Algorithms
Can anyone explain me the time complexity of Prim's algorithm?
Can anyone explain me the time complexity of Prim's algorithm?
User Avatar
1 votes
1 answer
2048
Dijkstra's algorithm | Negative Weight Cycle
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUE FALSE
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUEFALSE
User Avatar
0 votes
1 answer
2049
#Graphs #DS BFS AND DFS Question?
Can BFS and DFS both work cyclic and acyclic graphs?! Kindly explain for each of 'em. Thank you!
Can BFS and DFS both work cyclic and acyclic graphs?! Kindly explain for each of 'em. Thank you!
User Avatar
1 votes
2 answers
2051
Self-Doubt
What will be the solution of the following recurrence? $T(n)=3T\sqrt{n}+\log(n)$
What will be the solution of the following recurrence?$$T(n)=3T\sqrt{n}+\log(n)$$
User Avatar
5 votes
1 answer
2052
Algo: Time complexity
T(n) = 4T(n/2) + n2.$\sqrt{2}$ In thetha notation?
T(n) = 4T(n/2) + n2.$\sqrt{2}$In thetha notation?
User Avatar
1 votes
1 answer
2053
Daa........
What is the ans and give reason
What is the ans and give reason
User Avatar
3 votes
0 answers
2054
PGEE 2018
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time $\Theta (n \log n)$ $\Theta (n)$ $\Theta(\log n)$ $\Theta(1)$
In a min-heap with $n$ elements with the smallest element at the root, the $7^{th}$ smallest element can be found in time$\Theta (n \log n)$$\Theta (n)$$\Theta(\log n)$$\...
User Avatar
0 votes
0 answers
2055
Spanning trees
What is the time complexity of kirchoff's theorem used for finding number of spanning trees possible of undirected graphs?
What is the time complexity of kirchoff's theorem used for finding number of spanning trees possible of undirected graphs?
User Avatar
2 votes
1 answer
2056
Huffman coding
User Avatar
0 votes
1 answer
2058
#algorithms #best #algo
Best algorithm for this set: 1.Independently sorting each of 1,000,000 arrays, each with 5 elements. 2.Sorting a set of 4,000,000 numbers in worst case O(n lg n) time.
Best algorithm for this set:1.Independently sorting each of 1,000,000 arrays, each with 5 elements.2.Sorting a set of 4,000,000 numbers in worst case O(n lg n) time.
User Avatar
Page: