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 viewed questions in Algorithms

1 votes
2 answers
1762
Sorting
Could a binary search tree be built using o(n lg n) comparisons in the comparison model? Explain why or why not.
Could a binary search tree be built using o(n lg n) comparisons in the comparisonmodel? Explain why or why not.
User Avatar
2 votes
1 answer
1765
Test Series
Assume that A be an array of 16 elements. What is the difference between maximum number of inversion and minimum number of inversion for the array with 16 elements?
Assume that A be an array of 16 elements. What is the difference between maximum number of inversion and minimum number of inversion for the array with 16 elements?
User Avatar
0 votes
3 answers
1766
Masters theorem
Solve using Master's Theorem $T(n)=T(n/2)+$ 2n
Solve using Master's Theorem$T(n)=T(n/2)+$ 2n
User Avatar
1 votes
1 answer
1767
Mimimum number of comparison to sort 13 elements/numbers for any comparison based sorting algorithm?
I’ve seen this wikipedia article – https://en.wikipedia.org/wiki/Comparison_sortAlso see this link – https://gateoverflow.in/32948/minimum-number-of-comparisonshttp...
User Avatar
1 votes
2 answers
1769
Algorithm
what is the time complexity of finding a number in a heap sort in worst case & what is the time complexity for deleting the element from heap?
what is the time complexity of finding a number in a heap sort in worst case & what is the time complexity for deleting the element from heap?
User Avatar
1 votes
1 answer
1770
TIFR CSE 2022 | Part B | Question: 3
Consider the problem of sorting $n$ single digit integers (base $10$). This problem can be solved in time $O(n \log n)$ but not $O(n \log \log n)$ $O(n \log \log n)$ but not $O(n)$ $O(n)$ but not $O(n / \log \log n)$ $O(n / \log \log n)$ None of the above.
Consider the problem of sorting $n$ single digit integers (base $10$). This problem can be solved in time$O(n \log n)$ but not $O(n \log \log n)$$O(n \log \log n)$ but no...
User Avatar
0 votes
1 answer
1772
Time complexity
What is time complexity for given recurrence relation T(n) = √nT(√n) + √n T(2)= 1
What is time complexity for given recurrence relationT(n) = √nT(√n) + √nT(2)= 1
User Avatar
0 votes
2 answers
1773
Algorithms \ Hashing
User Avatar
0 votes
1 answer
1775
self doubt
Suppose that average edge weight for a graph G is Aavg. Then the minimum spanning tree of G will have weight at most (n-1) Aavg. Where n is number of vertices in graph G. i think think is false but in a solution mannul it is given as true please check it.
Suppose that average edge weight for a graph G is Aavg. Then the minimum spanning tree of G will have weight at most(n-1) Aavg. Where n is number of vertices in graph G.i...
User Avatar
2 votes
1 answer
1776
minimal spanning tree
Consider the following graph: The maximum possible weight that a minimum weight spanning tree of G can have is is the answer 25
Consider the following graph:The maximum possible weight that a minimum weight spanning tree of G can have isis the answer 25
User Avatar
0 votes
1 answer
1777
DATA STRUCTURES
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort ru...
User Avatar
0 votes
2 answers
1779
MIT ASSIGNMENT
FIND THE TIME COMPLEXITY int i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
FIND THE TIME COMPLEXITYint i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗= 2) { sum++; } }
User Avatar
6 votes
2 answers
1780
Asymptotics
Find the False statement. $O(2^n) = O(3^n)$ $O(\log n^2) = O(\log n)$ $f(n) = O \left ( (f(n))^2 \right )$ $2^{2 \log n} (\log n) = O(n^2 \log n)$
Find the False statement.$O(2^n) = O(3^n)$ $O(\log n^2) = O(\log n)$ $f(n) = O \left ( (f(n))^2 \right )$ $2^{2 \log n} (\log n) = O(n^2 \log n)$
User Avatar
Page: