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
1 answer
1922
Complexity
N=2^2^k; where k>0; For(i=1;i<n;i++) { J=2; While (j<=n) { J=j^2; } } What is the time complexity
N=2^2^k; where k>0;For(i=1;i<n;i++){J=2;While (j<=n){J=j^2;}}What is the time complexity
User Avatar
1 votes
1 answer
1923
Please solve this Q
Q. The best case of quick sort helps Aditya to sort a particular data set of size ‘n’ in 640 ms. Suresh also tried the same algorithm on similar data set and it took him 256 ms in best case to sort a file of size 16. What could be Aditya’s file size?
Q. The best case of quick sort helps Aditya to sort a particular data set of size ‘n’ in 640 ms. Suresh also tried the same algorithm on similar data set and it took...
User Avatar
1 votes
1 answer
1924
Please solve this Q
What could be the best algorithm from the following when the time complexity is measured based bon the number of swaps performed by the sorting algorithm? 1. Selection sort 2. Insertion sort 3. Bubble sort 4. None of these
What could be the best algorithm from the following when the time complexity is measured based bon the number of swaps performed by the sorting algorithm?1. Selection sor...
User Avatar
1 votes
0 answers
1926
algorithm
H(n) = H(2/3(n-1)) + 1 H(1) = 0 solve this recurrence relation
H(n) = H(2/3(n-1)) + 1 H(1) = 0 solve this recurrence relation
User Avatar
1 votes
0 answers
1927
Dynamic programming
Explain longest comman sbsequence , how to direct solve the lcs problems????
Explain longest comman sbsequence , how to direct solve the lcs problems????
User Avatar
1 votes
1 answer
1929
master theorem
is the time complexity for this fuction is O(n)?
is the time complexity for this fuction is O(n)?
User Avatar
1 votes
1 answer
1931
Merge sort vs heap sort
Which of the following algorithm gives best performance when items are in reverse order ? a) Merge sort. b) Heap sort.
Which of the following algorithm gives best performance when items are in reverse order ?a) Merge sort.b) Heap sort.
User Avatar
1 votes
0 answers
1932
algorithn
https://gateoverflow.in/1076/gate2004-82?show=141252#c141252 Can somenone please explain this question I really dont understand the difference made by the statement "counter=0"
https://gateoverflow.in/1076/gate2004-82?show=141252#c141252Can somenone please explain this questionI really dont understand the difference made by the statement "counte...
User Avatar
1 votes
1 answer
1934
The minimum number of comparisons required
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............
User Avatar
1 votes
1 answer
1935
Coreman: Relative Asymptotic growths
Suppose $A = log^{k}n$ $B = n^{\epsilon} $ Assume that $ k\geq 1$ and $ \epsilon > 0$ What is the relation b/w the asymptotic time complexities of A and B? 1. A = O(B) 2. A = o(B) 3. A = $\Omega (B)$ 4. A = $\omega (B)$
Suppose$A = log^{k}n$$B = n^{\epsilon} $ Assume that $ k\geq 1$ and $ \epsilon 0$What is the relation b/w the asymptotic time complexities of A and B?1. A = O(B)2. A =...
User Avatar
1 votes
1 answer
1936
Please Solve this Q
In the following C function, let n >= m. int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m,n); } How many recursive calls are made by this function? (A) (logn)? (B) (n) (C) (loglogn) (D) (sqrt(n))
In the following C function, let n >= m.int gcd(n,m) { if (n%m ==0) return m; n = n%m; return gcd(m,n); }How many recursive calls are made by this function? (A) (logn)?(B...
User Avatar
1 votes
1 answer
1937
Please Solve this Recurrence Relation
Q. In Quick sort ,for sorting n element ,the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case tome complexity of the Quick sort? a) O(n) b) O(nlogn) c) O(n2) d) O(n2logn)
Q. In Quick sort ,for sorting n element ,the (n/4)th smallest element is selected as pivot using an O(n) time algorithm. What is the worst case tome complexity of the Qu...
User Avatar
1 votes
0 answers
1938
Merge sort
Time complexity of inplace merge sort??
Time complexity of inplace merge sort??
User Avatar
1 votes
1 answer
1939
Algorithm complexity
Q. The running time of an algorithm is given by T(n)=T(n-1)+T(n-2)-T(n-3) if n>3 else N The order is a. n. b. Log n C.n^n. d.n^2
Q. The running time of an algorithm is given byT(n)=T(n-1)+T(n-2)-T(n-3) if n>3else NThe order isa. n. b. Log nC.n^n. d.n^2
User Avatar
1 votes
1 answer
1940
Recurrence tree
If T(n) = T(n/4) + T(n/2) +n2 , then using recursion tree method
If T(n) = T(n/4) + T(n/2) +n2 , then using recursion tree method
User Avatar
Page: