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 answered questions in Algorithms

2 votes
1 answer
2161
Minimum Spanning tree
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weights are increased by 2, then the cost of the new MST is
If a simple undirected graph with positive weighted edges has 10 vertices and 30 edges, such that the cost of the Minimum Spanning tree is 59. Now, if all the edges weigh...
User Avatar
1 votes
1 answer
2162
Find the element that appears once in a sorted array.
In a sorted array, every element is repeated more than once except one. what will be the time complexity to find that element in the worst case?
In a sorted array, every element is repeated more than once except one. what will be the time complexity to find that element in the worst case?
User Avatar
0 votes
1 answer
2163
Bellman Ford algorithm
Consider the statements True/ False Bellman Ford algorithm reports a shortest path from source to a destination only in a directed graph which has a negative cycle.
Consider the statements True/ FalseBellman Ford algorithm reports a shortest path from source to a destination only in a directed graph which has a negative cycle.
User Avatar
2 votes
1 answer
2164
Optimal Merge Pattern
Given a set of sorted files f1,f2,f3,f4,f5 of lengths 99,27,71,199,259 we need to merge these files into a single sorted file Using Optimal Merge Pattern.
Given a set of sorted files f1,f2,f3,f4,f5 of lengths 99,27,71,199,259 we need to merge these files into a single sorted file Using Optimal Merge Pattern.
User Avatar
0 votes
1 answer
2165
Asymtotic notations
In the context of merge sort, which of the following are true? $1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
In the context of merge sort, which of the following are true?$1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
User Avatar
0 votes
1 answer
2166
more than n/2
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is Θ(n) Θ(logn) Θ(log∗n) Θ(1) isnt O(1) enough for this.....the answer give in this site is log N can i get a counter on why O(1) wont work ?
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers isΘ(n)Θ(logn)Θ(log∗n)Θ(1)isnt O(1)...
User Avatar
0 votes
1 answer
2170
test-series
What is the time complexity of the following code snippet? Assume x is a global variable and “statement” takes O(n) time?
What is the time complexity of the following code snippet? Assume x is a global variable and “statement” takes O(n) time?
User Avatar
0 votes
1 answer
2171
#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
0 votes
1 answer
2173
#swaps in case of reversely sorted array using bubble and insertion
Consider this array [ 2,2,2,1,1,1,1,1,0,0,0 ]. Find the min. no. of swaps needed for this array to be sorted in asc. order using: a) bubble sort b) insertion sort
Consider this array [ 2,2,2,1,1,1,1,1,0,0,0 ].Find the min. no. of swaps needed for this array to be sorted in asc. order using:a) bubble sortb) insertion sort
User Avatar
1 votes
1 answer
2174
algorithm
User Avatar
3 votes
1 answer
2176
running time
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n f3(n) = 1.000001n f4(n) = n2 According to me it should be f2, f1, f4, f3. But the answer is f1, f2, f4, f3
Arrange the following functions in asymptotically increasing orderf1(n) = n0.999999 log nf2(n) = 10000000nf3(n) = 1.000001nf4(n) = n2According to me it should be f2, f1, ...
User Avatar
0 votes
1 answer
2178
Test Series
Are MST and shortest path tree identical? T/F? with reasoning.
Are MST and shortest path tree identical?T/F? with reasoning.
User Avatar
3 votes
1 answer
2179
Time Complexity
T(n) = T(n/2) + 2T(n/5) + T(n/10) + 4n What is the time complexity for the recursion above?
T(n) = T(n/2) + 2T(n/5) + T(n/10) + 4nWhat is the time complexity for the recursion above?
User Avatar
1 votes
1 answer
2180
Time complexity
Worst case time complexity of following code? Please explain in detail. void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } }
Worst case time complexity of following code? Please explain in detail.void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i ==...
User Avatar
Page: