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

Recent questions in Algorithms

0 votes
1 answer
3225
Divide and Conquer
Merging K sorted list each of size n/k into one sorted list of n-elements using Heap Sort will take how much time?
Merging K sorted list each of size n/k into one sorted list of n-elements using Heap Sort will take how much time?
User Avatar
1 votes
1 answer
3226
Subset sum problem
Brute force algorithm time complexity for subset sum problem a) O(N logN) b)O(N^2) c) O(N^2 logN) d) O(2^N)
Brute force algorithm time complexity for subset sum problema) O(N logN) b)O(N^2) c) O(N^2 logN) d) O(2^N)
User Avatar
2 votes
2 answers
3227
Solve using Masters theorem
Solve using Masters theorem 2T (n/2) + n log n
Solve using Masters theorem 2T (n/2) + n log n
User Avatar
2 votes
4 answers
3228
Solve using Master's theorem
Solve this recurrence equation using Master's theorem T(n) = 64 T(n/8) - n 2 log n
Solve this recurrence equation using Master's theoremT(n) = 64 T(n/8) - n 2 log n
User Avatar
1 votes
2 answers
3229
Find the upper bound of given function
Find the upper bound of given function: f(n) =n a) O(1) b) O( n) c) O(n 2) d) Both b and c
Find the upper bound of given function:f(n) =na) O(1)b) O( n)c) O(n 2)d) Both b and c
User Avatar
1 votes
2 answers
3233
Asymptotic
User Avatar
0 votes
2 answers
3234
time complexity
User Avatar
0 votes
1 answer
3235
MADE EASY 2016 TEST SERIES
Given a hash table with 6 keys and 10 slots, with simple uniform hashing. If collisions are resolved by chaining then the probability that first slot ends up empty?
Given a hash table with 6 keys and 10 slots, with simple uniform hashing. If collisions are resolved by chaining then the probability that first slot ends up empty?
User Avatar
6 votes
1 answer
3236
#Algorithm # DFS
Let G be a graph with n vertices and m edges. a. True or false: All its DFS forests (for traversals starting at different vertices) will have the same number of trees? b. True or false: All its DFS forests will have the same number of tree edges and the same number of back edges?
Let G be a graph with n vertices and m edges.a. True or false: All its DFS forests (for traversals starting at different vertices) will have the same number of trees?b. T...
User Avatar
2 votes
3 answers
3237
#algorithm
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
User Avatar
4 votes
1 answer
3238
time complexity
The recurrence equation $T(1) = 1$ $T(n) = 2T(n-1) + n, n \geq 2$ evaluates to $a.2^{n+1} - bn - c$, what is the value of $100a+ 10b+c$?
The recurrence equation$T(1) = 1$$T(n) = 2T(n-1) + n, n \geq 2$evaluates to $a.2^{n+1} - bn - c$, what is the value of $100a+ 10b+c$?
User Avatar
0 votes
1 answer
3239
matrix multiplication
User Avatar
5 votes
2 answers
3240
shortest path
User Avatar
Page: