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

Highest voted questions in Algorithms

1 votes
2 answers
1981
P and NP
P and NP concepts are there in gate syllabus?????????????????????????????????????????????
P and NP concepts are there in gate syllabus?????????????????????????????????????????????
User Avatar
1 votes
1 answer
1982
algorithm
is sum of subset problem is there in the gate cse syllabus ?
is sum of subset problem is there in the gate cse syllabus ?
User Avatar
1 votes
2 answers
1983
algorithm
sum = 0; for( i = 0; i < n; i++) for( j = 0; j < i*i; j++) for( k = 0; k < j; k++) sum++; its time complexity should be o(n^3) 1^2 + 2^2 + ------------------------------+ n^2 = n(n+1)(2n+1)/6 = o(n^3) but answer given is o(n^5) why ?
sum = 0;for( i = 0; i < n; i++)for( j = 0; j < i*i; j++) for( k = 0; k < j; k++) sum++; its time complexity should be o(n^3) 1^2 + 2^2 + + n^2 = n(n+1)(2n+1)/6 = o...
User Avatar
1 votes
2 answers
1984
geeksforgeeks
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort? A N(logN base 3) B N(logN base 2/3) C N(logN base 1/3) D N(logN base 3/2)
In a modified merge sort, the input array is splitted at a position one-third of the length(N) of the array. What is the worst case time complexity of this merge sort?AN(...
User Avatar
1 votes
2 answers
1986
Time complexity
what is time complexity for T(n) = √n.T(√n) + √n ?
what is time complexity for T(n) = √n.T(√n) + √n ?
User Avatar
1 votes
3 answers
1987
Self doubt
You are asked to sort 15 randomly generated numbers. One should prefer— (a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sort I think the answer should be c or d crct me???
You are asked to sort 15 randomly generated numbers. One should prefer—(a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sortI think the answer should be c or d cr...
User Avatar
1 votes
2 answers
1989
Algorithm
Is n^2 2^(3log base 2 n) = theta (n^5).
Is n^2 2^(3log base 2 n) = theta (n^5).
User Avatar
1 votes
2 answers
1991
Gate Sample Question
int f(int n) { static int i = 1; if (n ≥ 5) return n; n = n + i; i++; return f(n); } The value returned by f(1) is: (a) 5 (b) 6 (c) 7 (d) 8 need solution with explaination
int f(int n) { static int i = 1; if (n ≥ 5) return n; n = n + i; i++; return f(n); }The value returned by f(1) is:(a) 5 (b) 6(c) 7 (d) 8 need solution with explaination...
User Avatar
1 votes
2 answers
1993
Test by Bikram | Algorithms | Test 2 | Question: 27
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
The total number of LCS (Longest Common Subsequences) of $P = abcd123$ and $Q= badc321$ that can be formed are ______.
User Avatar
1 votes
1 answer
1994
Test by Bikram | Algorithms | Test 2 | Question: 21
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is: $(3n/2)+ 2$ $(3n/2) - 2$ $3n$ $3n/2$
The number of comparisons required to find the maximum and minimum element in an array $A[n]$ using Divide and Conquer method is:$(3n/2)+ 2$$(3n/2) - 2$$3n$$3n/2$
User Avatar
1 votes
1 answer
1995
Test by Bikram | Algorithms | Test 2 | Question: 17
Which of the following are TRUE? $n! = \theta ((n + 1)!)$ $\log4 n = \theta ( \log2 n )$ $\sqrt{\log n} = O(\log \log n)$ (i) & (iii) only (i) & (ii) only (ii) only (i),(ii) and (iii)
Which of the following are TRUE?$n! = \theta ((n + 1)!)$$\log4 n = \theta ( \log2 n )$$\sqrt{\log n} = O(\log \log n)$(i) & (iii) only(i) & (ii) only(ii) only(i),(ii) ...
User Avatar
1 votes
2 answers
1996
Test by Bikram | Algorithms | Test 2 | Question: 13
Which one of the following is a topological sort for the above graph? $1, 6, 2, 5, 3, 4$ $4, 5, 6, 3, 2, 1$ $2, 4, 5, 6, 3, 1$ $6, 4, 5, 2, 1, 3$
Which one of the following is a topological sort for the above graph?$1, 6, 2, 5, 3, 4$$4, 5, 6, 3, 2, 1$$2, 4, 5, 6, 3, 1$$6, 4, 5, 2, 1, 3$
User Avatar
1 votes
2 answers
1998
Test by Bikram | Algorithms | Test 2 | Question: 10
In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication? $7$ and $16$ $18$ and $7$ $10$ and $8$ $7$ and $7$
In Strassen's Matrix Multiplication, what is the number of additions and multiplications done to get a better complexity than the normal matrix multiplication?$7$ and $16...
User Avatar
1 votes
2 answers
1999
Test by Bikram | Algorithms | Test 2 | Question: 1
Which of the following theorems can solve all Recurrence Relations? Mater Tehorem Akra-Bazzi Theorem Both [A] and [B] Akra-Bazzi can be applied to some cases but not for all.
Which of the following theorems can solve all Recurrence Relations?Mater TehoremAkra-Bazzi TheoremBoth [A] and [B]Akra-Bazzi can be applied to some cases but not for all....
User Avatar
1 votes
2 answers
2000
Sample question for practise doubt
Consider the following 2 functions: f(n)= n3, if 0 ≤ n < 10,000 = n2, otherwise g(n)= n, if 0 ≤ n < 100 = n2 + 5n, otherwise Which of the following option is correct? (a) f(n) is O(n3) (b) g(n) is O(n3) (c) O(f(n)) is same as O(g(n)) (d) g(n) is O(1)
Consider the following 2 functions:f(n)= n3, if 0 ≤ n < 10,000= n2, otherwiseg(n)= n, if 0 ≤ n < 100= n2 + 5n, otherwise Which of the following option is correct?(a) ...
User Avatar
Page: