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{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&0&2&2&3&3&0&2&3
\\\hline\textbf{2 Marks Count}&2&4&2&3&2&3&2&2.7&4
\\\hline\textbf{Total Marks}&6&8&6&8&7&9&\bf{6}&\bf{7.3}&\bf{9}\\\hline
\end{array}}}$$

Recent questions in Algorithms

0 votes

1 answer

UGCNET-Oct2020-II: 25
If algorithm $A$ and another algorithm $B$ take $\log_2 (n)$ and $\sqrt{n}$ microseconds, respectively, to solve a problem, then the largest size $n$ of a problem these algorithms can solve, respectively, in one second are ______ and ______. $2^{10^n}$ and $10^6$ $2^{10^n}$ and $10^{12}$ $2^{10^n}$ and $6.10^6$ $2^{10^n}$ and $6.10^{12}$

If algorithm $A$ and another algorithm $B$ take $\log_2 (n)$ and $\sqrt{n}$ microseconds, respectively, to solve a problem, then the largest size $n$ of a problem these algorithms can solve, respectively, in one second are ______ and ______. $2^{10^n}$ and $10^6$ $2^{10^n}$ and $10^{12}$ $2^{10^n}$ and $6.10^6$ $2^{10^n}$ and $6.10^{12}$

asked Nov 20, 2020 in Algorithms jothee 196 views

0 votes

0 answers

UGCNET-Oct2020-II: 52
The running time of an algorithm is $O(g(n))$ if and only if its worst-case running time is $O(g(n))$ and its best-case running time is $\Omega(g(n)) \cdot (O= \textit{ big }O)$ its worst-case running time is $\Omega (g(n))$ and its best-case running ... $(a)$ only $(b)$ only $(c)$ only $(d)$ only

The running time of an algorithm is $O(g(n))$ if and only if its worst-case running time is $O(g(n))$ and its best-case running time is $\Omega(g(n)) \cdot (O= \textit{ big }O)$ its worst-case running time is $\Omega (g(n))$ ... , $(o = \textit{ small } o)$ Choose the correct answer from the options given below: $(a)$ only $(b)$ only $(c)$ only $(d)$ only

asked Nov 20, 2020 in Algorithms jothee 96 views

0 votes

1 answer

UGCNET-Oct2020-II: 69
Match $\text{List I}$ with $\text{List II}$ ... $A-I, B-II, C-III, D-IV$ $A-II, B-I, C-III, D-IV$ $A-II, B-IV, C-III, D-I$

Match $\text{List I}$ with $\text{List II}$ ... $A-I, B-II, C-III, D-IV$ $A-II, B-I, C-III, D-IV$ $A-II, B-IV, C-III, D-I$

asked Nov 20, 2020 in Algorithms jothee 58 views

0 votes

1 answer

UGCNET-Oct2020-II: 70
Match $\text{list I}$ with $\text{List II}$ ... $A-III, B-I, C-IV, D-II$ $A-III, B-I, C-II, D-IV$ $A-I, B-III, C-II, D-IV$

Match $\text{list I}$ with $\text{List II}$ ... : $A-I, B-III, C-IV, D-II$ $A-III, B-I, C-IV, D-II$ $A-III, B-I, C-II, D-IV$ $A-I, B-III, C-II, D-IV$

asked Nov 20, 2020 in Algorithms jothee 47 views

0 votes

1 answer

UGCNET-Oct2020-II: 73
Match $\text{List I}$ with $\text{List II}$ ... $A-II, B-III, C-I, D-IV$ $A-III, B-II, C-IV, D-I$ $A-III, B-IV, C-II, D-I$

Match $\text{List I}$ with $\text{List II}$ ... $A-II, B-III, C-I, D-IV$ $A-III, B-II, C-IV, D-I$ $A-III, B-IV, C-II, D-I$

asked Nov 20, 2020 in Algorithms jothee 43 views

0 votes

1 answer

UGCNET-Oct2020-II: 78
Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node $a$ ... $(a,b), (g,h), (g,f), (c,f), (c,i), (f,e), (b,c), (d,e)$

Consider the undirected graph below: Using Prim's algorithm to construct a minimum spanning tree starting with node $a$ ... $(a,b), (g,h), (g,f), (c,f), (c,i), (f,e), (b,c), (d,e)$

asked Nov 20, 2020 in Algorithms jothee 52 views

0 votes

0 answers

UGCNET-Oct2020-II: 83
Given below are two statements: If two variables $V_1$ and $V_2$ are used for clustering, then consider the following statements for $k$ means clustering with $k=3$: Statement $I$: If $V_1$ and $V_2$ have correlation of $1$ the cluster centroid will be ... $II$ are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

Given below are two statements: If two variables $V_1$ and $V_2$ are used for clustering, then consider the following statements for $k$ means clustering with $k=3$: Statement $I$: If $V_1$ and $V_2$ have correlation of $1$ the cluster centroid will be in straight ... Statement $II$ are false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

asked Nov 20, 2020 in Algorithms jothee 46 views

0 votes

1 answer

UGCNET-Oct2020-II: 90
Given below are two statements: Statement $I$: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained Statement $II$: In nondeterministic environments, agents can apply AND-OR search to generate contingent plans ... Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

Given below are two statements: Statement $I$: A genetic algorithm is a stochastic hill-climbing search in which a large population of states is maintained Statement $II$: In nondeterministic environments, agents can apply AND-OR search to generate contingent plans that reach the ... false Statement $I$ is correct but Statement $II$ is false Statement $I$ is incorrect but Statement $II$ is true

asked Nov 20, 2020 in Algorithms jothee 26 views

0 votes

1 answer

NIELIT 2016 MAR Scientist C - Section C: 18
Two alternative package $A$ and $B$ are available for processing a database having $10^{k}$ records. Package $A$ requires $0.0001 n^{2}$ time units and package $B$ requires $10n\log _{10}n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$

Two alternative package $A$ and $B$ are available for processing a database having $10^{k}$ records. Package $A$ requires $0.0001 n^{2}$ time units and package $B$ requires $10n\log _{10}n$ time units to process $n$ records. What is the smallest value of $k$ for which package $B$ will be preferred over $A$? $12$ $10$ $6$ $5$

asked Apr 2, 2020 in Algorithms Lakshman Patel RJIT 194 views

1 vote

1 answer

NIELIT 2016 MAR Scientist C - Section C: 51
The most efficient algorithm for finding the number of connected components in a $n$ 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 a $n$ undirected graph on $n$ vertices and $m$ edges has time complexity $\Theta (n)$ $\Theta (m)$ $\Theta (m+n)$ $\Theta (mn)$

asked Apr 2, 2020 in Algorithms Lakshman Patel RJIT 203 views

0 votes

2 answers

NIELIT 2016 MAR Scientist C - Section C: 53
An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves in linear time ... the array solves it using divide and conquer in time $\theta (n\log n)$ solves it in time $\theta (n^{2})$

An element in an array $X$ is called a leader if it is greater than all elements to the right of it in $X$. The best algorithm to find all leaders in an array solves it in linear time using a left to right pass of the array solves in linear time using a right to left pass of the array solves it using divide and conquer in time $\theta (n\log n)$ solves it in time $\theta (n^{2})$

asked Apr 2, 2020 in Algorithms Lakshman Patel RJIT 181 views

0 votes

1 answer

NIELIT 2017 OCT Scientific Assistant A (IT) - Section C: 2
An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$ [closed]

An algorithm is made up pf two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then the order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$

asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 334 views

0 votes

1 answer

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 14
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $= p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$ [closed]

The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $= p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$

asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 253 views

0 votes

2 answers

NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 36
The average search time for hashing with linear probing will be less if the load factor Is far less than one Equals one Is far greater than one None of the above

The average search time for hashing with linear probing will be less if the load factor Is far less than one Equals one Is far greater than one None of the above

asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 192 views

0 votes

3 answers

NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 4
The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $ = p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$

The running time of an algorithm $T(n),$ where $’n’$ is the input size , is given by $T(n) = 8T(n/2) + qn,$ if $n>1$ $ = p,$ if $n = 1$ Where $p,q$ are constants. The order of this algorithm is $n^{2}$ $n^{n}$ $n^{3}$ $n$

asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 255 views

0 votes

2 answers

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 8
Consider the following C code segment: int Ls Prime(n) { int i,n; for(i=2;i<=sqrt(n);i++) if(n%i ==0) { printf( NOT Prime.\n ); return 0; } return 1; } Let $T(n)$ denote the number of times the for loop is executed by the program on input $n.$ ... $T(n) = \Omega (1)$ $T(n) = O(n)$ and $T(n) = \Omega (\sqrt{n})$ None of these

Consider the following C code segment: int Ls Prime(n) { int i,n; for(i=2;i<=sqrt(n);i++) if(n%i ==0) { printf( NOT Prime.\n ); return 0; } return 1; } Let $T(n)$ denote the number of times the for loop is executed by the program on input $n.$ ... $T(n) = O(\sqrt{n})$ and $T(n) = \Omega (1)$ $T(n) = O(n)$ and $T(n) = \Omega (\sqrt{n})$ None of these

asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 246 views

0 votes

1 answer

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 29
Which of the following algorithm solve the all-pair shortest path problem? Dijakstra’s algorithm Floyd’s algorithm Prim’s algorithm Warshall’s algorithm

Which of the following algorithm solve the all-pair shortest path problem? Dijakstra’s algorithm Floyd’s algorithm Prim’s algorithm Warshall’s algorithm

asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 192 views

0 votes

3 answers

NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 30
An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$

An algorithm is made up of two modules $M1$ and $M2.$ If order of $M1$ is $f(n)$ and $M2$ is $g(n)$ then he order of algorithm is $max(f(n),g(n))$ $min(f(n),g(n))$ $f(n) + g(n)$ $f(n) \times g(n)$

asked Apr 1, 2020 in Algorithms Lakshman Patel RJIT 233 views

1 vote

1 answer

NIELIT 2017 DEC Scientific Assistant A - Section B: 22
Which type of algorithm is used to solve the "$8$ Queens" problem ? Greedy Dynamic Divide and conquer Backtracking

Which type of algorithm is used to solve the "$8$ Queens" problem ? Greedy Dynamic Divide and conquer Backtracking

asked Mar 31, 2020 in Algorithms Lakshman Patel RJIT 323 views

1 vote

2 answers

NIELIT 2017 DEC Scientific Assistant A - Section B: 36
The average search time of hashing, with linear probing will be less if the load factor : is far less than $1$ equals $1$ is far greater than $1$ none of the options

The average search time of hashing, with linear probing will be less if the load factor : is far less than $1$ equals $1$ is far greater than $1$ none of the options

asked Mar 31, 2020 in Algorithms Lakshman Patel RJIT 312 views

Page:

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Subjects

Network Sites

Recent questions in Algorithms

Log In

Register

Recent Posts

Subjects

Recent Blog Comments

Network Sites

Recent questions in Algorithms