In the analysis of algorithms,

what plays an important

role?
If x is a set and the set
contains an integer which is
neither positive nor negative
then the set x is
____________.
Which of the following is a
subset of set {1, 2, 3, 4}?
Power set of empty or Null
set has exactly _________
subset.
What is the Cartesian
product of set A and set B, if
the set A = {1, 2} and set B =
{a, b}?
The difference of {1, 2, 3, 6,
8} and {1, 2, 5, 6} is the set
____________
If n(A) = 20 and n(B) = 30 and
n(A U B) = 40 then n(A ∩ B)
is?
Which option is correct for
representing an algorithm?
Which case does not exist in
complexity theory?
Which of the following
matrix having only one
column and multiple rows?
Which of the following
matrix having only one row
and multiple columns?
Which of the following
function is also referred to as
an injective function?
What is an external sorting
algorithm?
What is an internal sorting
algorithm?
Which of the following is not
an advantage of optimised
bubble sort over other
sorting techniques in case of
sorted elements?
The given array is arr = {1, 2,
4, 3}. Bubble sort is used to
sort the array elements. How
many iterations will be done
to sort the array?
What is an in-place sorting
algorithm?
In the following scenarios,
when will you use selection
sort?
What is the advantage of
selection sort over other
sorting techniques?
What is the disadvantage of
selection sort?
The given array is arr =
{3,4,5,2,1}. The number of
iterations in bubble sort and
selection sort respectively
are __________
Which of the following
algorithm implementations
is similar to that of an
insertion sort?
Which of the following real
time examples is based on
insertion sort?
In C, what are the basic loops
required to perform an
insertion sort?
Which of the following
options contain the correct
feature of an insertion sort
algorithm?
Which of the following
sorting algorithms is the
fastest for sorting small
arrays?
For the best case input, the
running time of an insertion
sort algorithm is?
Which of the following
examples represent the
worst case input for an
insertion sort?
Which of the following is not
an exchange sort?
What is the other name for a
shell sort algorithm?
Shell sort algorithm is an
example of?
Which of the following
sorting algorithms is closely
related to shell sort?
Why is Shell sort called as a
generalization of Insertion
sort?
On which algorithm is heap
sort based on?
In what position does the
array for heap sort contains
data?
In heap sort, after deleting
the last minimum element,
the array will contain
elements in?
Heap sort is an
implementation of
____________ using a
descending priority queue.
Which one of the following is
false?
Which of the following
method is used for sorting in
merge sort?
Which of the following is not
a variant of merge sort?
Choose the incorrect
statement about merge sort
from the following?
Which of the following is not
in place sorting algorithm by
default?
Which of the following is not
a stable sorting algorithm?
Which of the following stable
sorting algorithm takes the
least time when applied to
an almost sorted array?
Which of the following
sorting algorithms is the
fastest?
Which is the safest method
to choose a pivot element?
Which of the following
sorting algorithms is used
along with quick sort to sort
the sub arrays?
How many sub arrays does
the quick sort algorithm
divide the entire array into?
QuickSort can be categorized
into which of the following?
What is a randomized
QuickSort?
Which of the following is not
true about QuickSort?
Strassen’s algorithm is
a/an_____________
algorithm.
Strassen’s matrix
multiplication algorithm
follows ___________
technique.
What is the formula to
calculate the element
present in second row, first
column of the product
matrix?
Which of the following is/are
property/properties of a
dynamic programming
problem?
If an optimal solution can be
created for a problem by
constructing optimal
solutions for its
subproblems, the problem
possesses ____________
property.
If a problem can be broken
into subproblems which are
reused several times, the
problem possesses
____________ property.
If a problem can be solved by
combining optimal solutions
to non-overlapping
problems, the strategy is
called _____________
In dynamic programming,
the technique of storing the
previously calculated values
is called ___________
When a top-down approach
of dynamic programming is
applied to a problem, it
usually _____________
Which of the following
problems is NOT solved
using dynamic
programming?
Which of the following
problems should be solved
using dynamic
programming?
You are given infinite coins
of denominations v1, v2, v3,
…..,vn and a sum S. The coin
change problem is to find
the minimum number of
coins required to get the
sum S. This problem can be
solved using ____________
You are given infinite coins
of denominations 1, 3, 4.
What is the total number of
ways in which a sum of 7 can
be achieved using these
coins if the order of the coins
is not important?
You are given infinite coins
of denominations 1, 3, 4.
What is the minimum
number of coins required to
achieve a sum of 7?
Which of the following
methods can be used to
solve the Knapsack problem?
You are given a knapsack
that can carry a maximum
weight of 60. There are 4
items with weights {20, 30,
40, 70} and values {70, 80,
90, 200}. What is the
maximum value of the items
you can carry using the
knapsack?
Consider the two matrices P
and Q which are 10 x 20 and
20 x 30 matrices
respectively. What is the
number of multiplications
required to multiply the two
matrices?
Longest common
subsequence is an example
of ____________
Fractional knapsack problem
is also known as __________
Fractional knapsack problem
is solved most efficiently by
which of the following
algorithm?
What is the objective of the
knapsack problem?
Which of the following
statement about 0/1
knapsack and fractional
knapsack problem is correct?
The main time taking step in
fractional knapsack problem
is ___________
Which of the following
algorithms is the best
approach for solving
Huffman codes?
In Huffman coding, data in a
tree always occur?
Which of the following is
false in the case of a
spanning tree of a graph G?
Consider a complete graph G
with 4 vertices. The graph G
has ____ spanning trees.
The travelling salesman
problem can be solved using
_________
Which of the following is
false?
Which of the following is
true?
Prim’s algorithm is a ______
Prim’s algorithm can be
efficiently implemented
using _____ for graphs with
greater density.
Which of the following is
false about Prim’s
algorithm?
Kruskal’s algorithm is used to
______
Kruskal’s algorithm is a
______
Which of the following is
true?
Which of the following is
false about the Kruskal’s
algorithm?
Consider the following
statements. S1. Kruskal’s
algorithm might produce a
non-minimal spanning tree.
S2. Kruskal’s algorithm can
efficiently implemented
using the disjoint-set data
structure.
Dijkstra’s Algorithm is used
to solve _____________
problems.
Which of the following is the
most commonly used data
structure for implementing
Dijkstra’s Algorithm?
Dijkstra’s Algorithm cannot
be applied on
______________
 How many priority queue
operations are involved in
Dijkstra’s Algorithm?
The maximum number of
times the decrease key
operation performed in
Dijkstra’s algorithm will be
equal to ___________
What is running time of
Dijkstra’s algorithm using
Binary min- heap method?
Dijkstra’s Algorithm is the
prime example for
___________
Depth First Search is
equivalent to which of the
traversal in the Binary Trees?
Time Complexity of DFS is?
(V – number of vertices, E –
number of edges)
The Data structure used in
standard implementation of
Breadth First Search is?
The Depth First Search
traversal of a graph will
result into?
A person wants to visit some
places. He starts from a
vertex and then wants to
visit every vertex till it
finishes from one vertex,
backtracks and then explore
other vertex from same
vertex. What algorithm he
should use?
Which of the following is not
an application of Depth First
Search?
When the Depth First Search
of a graph is unique?
Regarding implementation of
Depth First Search using
stacks, what is the maximum
distance between two nodes
present in the stack?
(considering each edge
length 1)
In Depth First Search, how
many times a node is
visited?
Choose the incorrect
statement about DFS and
BFS from the following?
Breadth First Search is
equivalent to which of the
traversal in the Binary Trees?
Time Complexity of Breadth
First Search is? (V – number
of vertices, E – number of
edges)
The Data structure used in
standard implementation of
Breadth First Search is?
The Breadth First Search
traversal of a graph will
result into?
A person wants to visit some
places. He starts from a
vertex and then wants to
visit every place connected
to this vertex and so on.
What algorithm he should
use?
Which of the following is not
an application of Breadth
First Search?
When the Breadth First
Search of a graph is unique?
Regarding implementation of
Breadth First Search using
queues, what is the
maximum distance between
two nodes present in the
queue? (considering each
edge length 1)
In BFS, how many times a
node is visited?
Topological sort can be
applied to which of the
following graphs?
Most Efficient Time
Complexity of Topological
Sorting is? (V – number of
vertices, E – number of
edges)
In most of the cases,
topological sort starts from a
node which has __________
Which of the following is not
an application of topological
sorting?
Topological sort of a
Directed Acyclic graph is?
Topological sort can be
implemented by?
Topological sort is equivalent
to which of the traversals in
trees?
A man wants to go different
places in the world. He has
listed them down all. But
there are some places where
he wants to visit before
some other places. What
application of graph can he
use to determine that?
When the topological sort of
a graph is unique?
Which of the problems
cannot be solved by
backtracking method?
Backtracking algorithm is
implemented by
constructing a tree of
choices called as?
What happens when the
backtracking algorithm
reaches a complete solution?
A node is said to be
____________ if it has a
possibility of reaching a
complete solution.
In what manner is a state-
space tree for a backtracking
algorithm constructed?
In general, backtracking can
be used to solve?
Which one of the following is
an application of the
backtracking algorithm?
___________ enumerates a
list of promising nodes that
could be computed to give
the possible solutions of a
given problem.
The problem of finding a
subset of positive integers
whose sum is equal to a
given positive integer is
called as?
The problem of placing n
queens in a chessboard such
that no two queens attack
each other is called as?
Branch and bound is a
__________
Which of the following is not
a branch and bound strategy
to generate branches?
Which data structure is used
for implementing a LIFO
branch and bound strategy?
Which data structure is used
for implementing a FIFO
branch and bound strategy?
Which data structure is most
suitable for implementing
best first branch and bound
strategy?
Which of the following
branch and bound strategy
leads to breadth first search?
Which of the following
branch and bound strategy
leads to depth first search?
Choose the correct
statement from the
following.
Which of the following can
traverse the state space tree
only in DFS manner?
In how many directions do
queens attack each other?
Placing n-queens so that no
two queens attack each
other is called?
Where is the n-queens
problem implemented?
In n-queen problem, how
many values of n does not
provide an optimal solution?
Which of the following
methods can be used to
solve n-queen’s problem?
Of the following given
options, which one of the
following is a correct option
that provides an optimal
solution for 4-queens
problem?
How many possible solutions
exist for an 8-queen
problem?