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

53 votes
3 answers
91
GATE CSE 2003 | Question: 20
Consider the following three claims: $(n+k)^m = \Theta(n^m)$ where $k$ and $m$ are constants $2^{n+1} = O(2^n)$ $2^{2n+1} = O(2^n)$ Which of the following claims are correct? I and II I and III II and III I, II, and III
Consider the following three claims:$(n+k)^m = \Theta(n^m)$ where $k$ and $m$ are constants$2^{n+1} = O(2^n)$$2^{2n+1} = O(2^n)$Which of the following claims are correct?...
User Avatar
21 votes
7 answers
94
GATE CSE 1994 | Question: 1.19, ISRO2016-31
Algorithm design technique used in quicksort algorithm is? Dynamic programming Backtracking Divide and conquer Greedy method
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
User Avatar
56 votes
4 answers
97
GATE IT 2008 | Question: 10
Arrange the following functions in increasing asymptotic order: $n^{1/3}$ $e^n$ $n^{7/4}$ $n \log^9n$ $1.0000001^n$ a, d, c, e, b d, a, c, e, b a, c, d, e, b a, c, d, b, e
Arrange the following functions in increasing asymptotic order:$n^{1/3}$$e^n$$n^{7/4}$$n \log^9n$$1.0000001^n$a, d, c, e, bd, a, c, e, ba, c, d, e, ba, c, d, b, e
User Avatar
1 votes
1 answer
104
Average code length using Huffman coding
A file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code length will be - a) 140/58 b) 146/58 c) 150/58 d) 174/58
A file contains characters a,e,i,o,u,s and t with frequencies 10,15,12,3,4,13 and 1 respectively. If we use Huffman Coding for data compression then the average code leng...
User Avatar
47 votes
6 answers
105
GATE CSE 2017 Set 2 | Question: 30
Consider the recurrence function $T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$ Then $T(n)$ in terms of $\Theta$ notation is $\Theta(\log \log n)$ $\Theta( \log n)$ $\Theta (\sqrt{n})$ $\Theta(n)$
Consider the recurrence function$$T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$$Then $T(n)$ in terms of $\Theta$ notation is$\Theta(\log \l...
User Avatar
3 votes
2 answers
106
Merge Sort
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is - a) 8/3 b) 8/5 c) 11/7 d) 11/6
The average no. of comparisons performed by the merge sort algorithm, in merging two sorted lists of length 2 is -a) 8/3b) 8/5c) 11/7d) 11/6
User Avatar
47 votes
7 answers
108
GATE CSE 2002 | Question: 2.11
The running time of the following algorithm Procedure $A(n)$ If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$; is best described by $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
The running time of the following algorithmProcedure $A(n)$If $n \leqslant 2$ return ($1$) else return $(A( \lceil \sqrt{n} \rceil))$;is best described by$O(n)$$O(\log ...
User Avatar
Page: