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
2221
TestBook Test Series
there is a sorted array which is of very large. every element is repeated more than once except one element. how much time will it take to find the element?
there is a sorted array which is of very large. every element is repeated more than once except one element. how much time will it take to find the element?
User Avatar
4 votes
1 answer
2222
time complexity
Determine the time complexity of the program segment given below: i= n; while (i>0) { k=1; for (j=1; j<=n; j+=k) { k++; } i= i/2; } (A) O(n2) (B) O(n.log n) (C) O(log2 n) (D) O(log n√n)
Determine the time complexity of the program segment given below:i= n; while (i>0) { k=1; for (j=1; j<=n; j+=k) { k++; } i= i/2; }(A) O(n2)(B) O(n.log n)(C) O(log2 n)(D) ...
User Avatar
2 votes
1 answer
2224
Sorting
The minimum number of comparisons required to sort 25 elements is ____
The minimum number of comparisons required to sort 25 elements is ____
User Avatar
0 votes
1 answer
2225
minimum spanning tree
A complete graph G with 5 nodes has positive weight edge ,each node has distinct weight with an integer value and maximum weight is equal to the number of edges in G.What can be the maximum weight of minimum spanning tree for graph G?
A complete graph G with 5 nodes has positive weight edge ,each node has distinct weight with an integer value and maximum weight is equal to the number of edges in G.What...
User Avatar
3 votes
1 answer
2227
Arrange the following functions in asymptotically increasing order
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n f3(n) = 1.000001n f4(n) = n2 Ans is f1, f2, f4, f3 I am not understanding how f1(n) grows asymptotically slower than f2(n)
Arrange the following functions in asymptotically increasing orderf1(n) = n0.999999 log nf2(n) = 10000000nf3(n) = 1.000001nf4(n) = n2Ans is f1, f2, f4, f3I am not unders...
User Avatar
1 votes
1 answer
2228
Recurrence Relation
The solution for the recurrence: T(1)=1 T(n) = T(n-1) + T(n-2) + 1 a. log(n) <= T(n)=n b. n<=T(n)<=n2 c. n2 <= T(n)<= 2n d. 2n <= T(n) <=n!
The solution for the recurrence:T(1)=1T(n) = T(n-1) + T(n-2) + 1a. log(n) <= T(n)=nb. n<=T(n)<=n2c. n2 <= T(n)<= 2nd. 2n <= T(n) <=n!
User Avatar
6 votes
1 answer
2230
Algo doubt
Which of the following is false? 1)An edge(u,v) is forward edge if and only if d[u] < =d[v] <= f[v] <= f[u]. 2) an edge (u,v) is a cross edge if and only if d[u] < f[u] < d[v] < f[v]. 3) an edge (u,v) is a back edge if and only if d[v] < d[u] < f[u] < f[v].
Which of the following is false?1)An edge(u,v) is forward edge if and only ifd[u] < =d[v] <= f[v] <= f[u].2) an edge (u,v) is a cross edge if and only ifd[u] < f[u] < d[v...
User Avatar
1 votes
1 answer
2235
TIME COMPLEXITY
User Avatar
4 votes
1 answer
2236
Binary search on two mutually exclusive arrays.
There are two sorted list each of length $n$ ... the search the moment we find the element. So tell me whose solution is correct? Why my solution should be incorrect?
There are two sorted list each of length $n$. An element to be searched in the both the lists. The lists are mutually exclusive. The maximum number of comparisons require...
User Avatar
5 votes
1 answer
2238
minimum number of comparisons
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
User Avatar
1 votes
1 answer
2239
Strongly connected graph verification via BFS
Hi Guys, DFS could be used for finding directed graph is strongly connected or not. But could we use BFS also ? Please share your valuable opinion. ping @Kushagra Chatterjee, @Soumya29, @srestha, @Subarna Das and @VS ji.
Hi Guys,DFS could be used for finding directed graph is strongly connected or not. But could we use BFS also ? Please share your valuable opinion.ping @Kushagra Chatterje...
User Avatar
0 votes
1 answer
2240
self doubt apply
can masters theorem be used when base condition is given in a recurrence ? can we directly apply masters theorem to any recurrence ?
can masters theorem be used when base condition is given in a recurrence ?can we directly apply masters theorem to any recurrence ?
User Avatar
Page: