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

Most answered questions in Algorithms

33 votes
6 answers
121
GATE CSE 2004 | Question: 42
What does the following algorithm approximate? (Assume $m > 1, \epsilon >0$). x = m; y = 1; While (x-y > ϵ) { x = (x+y)/2; y = m/x; } print(x); $\log \, m$ $m^2$ $m^{\frac{1}{2}}$ $m^{\frac{1}{3}}$
What does the following algorithm approximate? (Assume $m 1, \epsilon >0$).x = m; y = 1; While (x-y ϵ) { x = (x+y)/2; y = m/x; } print(x);$\log \, m$$m^2$$m^{\frac{1}{...
User Avatar
31 votes
6 answers
125
GATE CSE 2008 | Question: 19
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is: $\text{MNOPQR}$ $\text{NQMPOR}$ $\text{QMNPRO}$ $\text{QMNPOR}$
The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph is:$\text{MNOPQR}$...
User Avatar
28 votes
6 answers
126
GATE CSE 2008 | Question: 7
The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity $\Theta(n)$ $\Theta(m)$ $\Theta(m+n)$ $\Theta(mn)$
The most efficient algorithm for finding the number of connected components in an undirected graph on $n$ vertices and $m$ edges has time complexity$\Theta(n)$$\Theta(m)$...
User Avatar
0 votes
5 answers
127
#cpcb
Select the function(s) which is/are $O(n log n)$: $2n\log n+3n$ $10n\log n^2$ $1+\sqrt n$ $2n^2-3n$
Select the function(s) which is/are $O(n log n)$:$2n\log n+3n$$10n\log n^2$$1+\sqrt n$$2n^2-3n$
User Avatar
5 votes
5 answers
129
NIELIT 2017 DEC Scientific Assistant A - Section B: 53
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be : $m^{*}n$ minimum of $m, n$ maximum of $m, n$ $m+n-1$
Given two sorted list of size '$m$' and '$n$' respectively. The number of comparisons needed in the worst case by the merge sort algorithm will be :$m^{*}n$minimum of $m,...
User Avatar
0 votes
5 answers
130
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5 $ is...
User Avatar
5 votes
5 answers
133
ISRO2020-33
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort? $67,12,10,5,4,7,23$ $4,7,10,23,67,12,5$ $4,5,7,67,10,12,23$ $10,7,4,67,23,12,5$
If an array $A$ contains the items $10,4,7,23,67,12$ and $5$ in that order, what will be the resultant array $A$ after third pass of insertion sort?$67,12,10,5,4,7,23$$4,...
User Avatar
1 votes
5 answers
134
made easy test series:algorithms,sorting
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a swap?
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a sw...
User Avatar
11 votes
5 answers
135
TIFR CSE 2019 | Part B | Question: 2
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ? $8$ $16$ $32$ $64$ None of the above
How many distinct minimum weight spanning trees does the following undirected, weighted graph have ?$8$$16$$32$$64$None of the above
User Avatar
0 votes
5 answers
136
Big oh
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
User Avatar
38 votes
5 answers
137
GATE CSE 2018 | Question: 48
Consider the weights and values of items listed below. Note that there is only one unit of each item. ... The total value of items picked by the greedy algorithm is denoted by $V_{greedy}$. The value of $V_{opt}-V_{greedy}$ is ____
Consider the weights and values of items listed below. Note that there is only one unit of each item.$$\begin{array}{|c|c|c|}\hline \textbf{Item number} & \textbf{Weigh...
User Avatar
5 votes
5 answers
139
Matrix Chain
Total no. of ways to perform matrix multiplication having 7 matrices is ? Total no. of ways to by which we could parenthesize 7 matrices is ? Does the above two questions are different or same ? Plz explain the answer.
Total no. of ways to perform matrix multiplication having 7 matrices is ?Total no. of ways to by which we could parenthesize 7 matrices is ?Does the above two questions ...
User Avatar
6 votes
5 answers
140
Binary search
How to get space complexity of binary search .. I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+ log n B = O(n) ...
How to get space complexity of binary search ..I am getting confusion in Space complexity = ip + extra (stack) And ip = nB ( why it is nB) ????? And extra = logn B So nB+...
User Avatar
Page: