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{2024-1} & \textbf{2024-2} & \textbf{2023} & \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1&2&2& 2 &3&2&1&2&3
\\\hline\textbf{2 Marks Count} &4&2&2& 2 &3&4&2&2.83&4
\\\hline\textbf{Total Marks} &9&6&6& 6 &9&10&\bf{6} & \bf{7.67}&\bf{10}\\\hline
\end{array}}}$$

Recent questions in Algorithms

#2341
908
views
2 answers
1 votes
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets?2. Bucket sort is always NOT inplace.Is this correct?
#2342
591
views
2 answers
3 votes
Consider following program and determine the value of p after execution of program:-main() { p = 1; for(i=1;i<=n;i++) { for(j=1;j<=n;j=5*j) { p = p + n; } } }I think p's final value should be p = 1+n2log5n.
#2343
215
views
0 answers
0 votes
class Solution {public: int getSum(int a, int b) { int total = a; while (b != 0) { total = a ^ b; // ... } return total; }}; What is the time complexity of the above code ?Plz describe.
#2344
335
views
0 answers
1 votes
if f(n)=n/log nand c=2 Than f*(n)=?
#2345
320
views
1 answers
0 votes
How can we get this solution by solving this recurrence?
#2346
2.1k
views
2 answers
0 votes
#2347
1.0k
views
1 answers
2 votes
A graph is said to be hamiltonian if it contains a cycle containing all vertices.Any DFS tree on the graph must have depth v-1true or false
#2348
3.6k
views
3 answers
2 votes
What is the average number of probe required when inserting an element with load factor alpha (assume uniform hashing)a) 1 / 1-alphab) 1/1+alphac)1/alphad)2/2-alpha
#2349
1.9k
views
1 answers
1 votes
Q2. Consider the following C function:int fun1 (int n){ int i, j, k, p, q = 0;for (i = 1; i<n; ++i){ p = 0;for (j=n; j>1; j=j/2) ++p;for (k= ... of the function fun1?(a) n3 (c) nlogn (b) n (logn)^2 (d) nlog(logn)
#2350
442
views
1 answers
2 votes
what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?
#2351
712
views
3 answers
0 votes
Consider a set of n distinct elements, by comparison Amit wants to find the largest 3 elements in the set. Which of the following is truea) Three largest elements can ... neededd)n + O(1) not sufficient , n + O(log n) comparisons required
#2352
685
views
1 answers
3 votes
a) T(n) = √n T(√n) + nb) T(n) = 4T(n/2) + n2 √(2)
#2353
344
views
0 answers
0 votes
T(n) = 2T( n / root(2)) + nT(1) = O(1)when i solve this i get theta ( n ^ log 2 base root(2)) using masters theoremafter this how do i slove
#2354
373
views
1 answers
0 votes
f(n) = theta(n) , g(n) = Omega(n) , h(n) = O(n)then f(n) + [g(n) -h(n)] ?
#2355
460
views
0 answers
0 votes
#2356
117
views
0 answers
0 votes
#2357
270
views
0 answers
0 votes
#2359
753
views
1 answers
0 votes
Let us say Simple graph has V vertices and E edges.Now i am trying to find relation between E and V.If it is a complete graph ,then E=V(V-1)/2,=> E= ... someone confirm if the 1 ,2 and the result of them i.e the 3rd equation is valid ?
#2360
2.0k
views
1 answers
0 votes
Recursive functions are executed in a(A) First in first out-order(B) Last in first out-order(C) Parallel fashion(D) Load balancing