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{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}}}$$

Filter

Highest voted questions in Algorithms

1 votes
0 answers
2362
Time complexity
Why [logn]! is not polynomial bounded where [loglogn]! is polynomial bounded? Note [ ] is greatest integer function
Why [logn]! is not polynomial bounded where [loglogn]! is polynomial bounded? Note [ ] is greatest integer function
User Avatar
1 votes
0 answers
2363
How to Solve Questions based on varients of Master Method
T(n) = a1 T(n/b) + a2 T(n/b) eg T(n) = T(n/4) + T(3n/4) + n
T(n) = a1 T(n/b) + a2 T(n/b)eg T(n) = T(n/4) + T(3n/4) + n
User Avatar
1 votes
1 answer
2365
Number of Inversions
A) 192 B) 120 c) 188 D) 176
A) 192 B) 120 c) 188 D) 176
User Avatar
1 votes
1 answer
2367
are these two recurrences equivalent?
Do they differ or are they same? they are confusing me/
Do they differ or are they same?they are confusing me/
User Avatar
1 votes
0 answers
2371
How does merge sort proceed ?
According to the algo specified If I consider the case for the 1st sub-array right=1 and left=0 so B[0]=A[left]=4 ,Now using this algo when will the array size become 1 ,I am not getting the base condition here ,plz clarify this where is the mistake ?
According to the algo specified If I consider the case for the 1st sub-array right=1 and left=0 so B[0]=A[left]=4 ,Now using this algo when will the array size become 1 ,...
User Avatar
1 votes
1 answer
2372
time complexity
1. n > (log n)log n 2. 2n > n√n 3. 2n > nlog n explain plz
1. n (log n)log n2. 2n n√n3. 2n nlog nexplain plz
User Avatar
1 votes
2 answers
2373
true / false
i geeting ans 1 and 2 are true but ans given only 2 is true explain it
i geeting ans 1 and 2 are true but ans given only 2 is true explain it
User Avatar
1 votes
2 answers
2376
asymtotic notations
Q). Consider the following functions $f_1 = n^{\frac{4}{3}}$ $f_2=2^{2^n}$ $f_3= 2^{n^2}$ $f_4= n!$ $f_5=2^n$ Which of the following is true? A). $f_1$ is $\Omega(f_2)$ B). $f_2$ is $O(f_3)$ C). $f_1<f_5<f_4<f_2<f_3$ D). $f_4$ is $O(f_3)$
Q). Consider the following functions$f_1 = n^{\frac{4}{3}}$$f_2=2^{2^n}$$f_3= 2^{n^2}$$f_4= n!$$f_5=2^n$Which of the following is true?A). $f_1$ is $\Omega(f_2)$B). $f_2$...
User Avatar
1 votes
2 answers
2378
inverion pairs
assume that A be an array of 16 elements.What is the difference between maximum and minimum number of inversion pairs in worst case?
assume that A be an array of 16 elements.What is the difference between maximum and minimum number of inversion pairs in worst case?
User Avatar
1 votes
0 answers
2380
Asymptotic notations
Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n). Then [f(n). g(n)] + h(n) is: (a) Ω (n) (b) O (n) (c) Ѳ (n) (d) None of these explain it
Let f(n)= Ω(n), g(n)= O(n) and h(n)= Ѳ(n).Then [f(n). g(n)] + h(n) is:(a) Ω (n) (b) O (n)(c) Ѳ (n) (d) None of theseexplain it
User Avatar
Page: