Subject: DAA Year and Semester: III/I

UNIT – I

S.No Blooms Level Question A B C D E Ans

Which of the following case does not
1 Remembering Best case Worst case Average case Null case None D
exist in complexity theory?
Remembering The time complexity of linear search None
2 O(n) O(log n) O(n2) O(n log n) A
algorithm is
Remembering Which is not a specification of an Pseudo None
3 Program Flowchart Syntax D
algorithm? code
Remembering Which is not a characteristic of an Effectivenes None
4 Input Finiteness Easiness D
algorithm? s
Remembering How many characteristics are considered None
5 3 7 5 8 C
in algorithm?
Remembering What is the minimum number of input None
6 0 1 2 3 A
characteristic taken by algorithm?
The word ____________comes from the
Remembering name of a Persian mathematician Abu None
7 Flowchart Algorithm Flow Syntax B
Ja’far Mohammed ibn-i Musa al
Khowarizmi.
8 Remembering Which complexity is critical for us? Space Time Data Volume None B
In which case time complexity, Inputs
Remembering are provided in such a way that the None
9 Worst Average Best All C
minimum time is required to process
them.
In which case time complexity, Inputs
Remembering are provided in such a way that the None
10 Worst Average Best All A
maximum time is required to process
them.
Remembering Upper bound time complexity is also Average None
11 Best case Worst case Case-1 C
called as ------- time complexity case
 In which case time complexity, Inputs
Remembering are provided in such a way that not the None
12 Worst Average Best All B
minimum time and not the maximum
time is required to process them.
Algorithm
Remembering Algorithm Algorithm and Input and None
13 Program is the combination of both and pseudo C
and input data structures output
code
Remembering One of the Approximate Algorithm Squareroot Tossing a Busines Division by
14 None A
example is (2) coin application zero
Remembering One of the Probabilistic Algorithm Squareroot Tossing a Busines Division by
15 None B
example is (2) coin application zero
Remembering Squareroot Tossing a Busines Division by
16 One of the Infinite Algorithm example is None D
(2) coin application zero
Remembering Algorithm’s performance is depends on Middle- None
17 External Internal Level-n C
which factors? level
Remembering Size of the input to the algorithm is Middle- None
18 External Internal Level-n A
considered as ----- factor level
Consider the following functions from
n,100/
positives integers to real numbers 10, √n,
log2n, n,
Remembering n, log2n, 100/n. The CORRECT 100/n, 10, 10, 100/n ,√n, 100/n, log2n,
19 100/n, 10, log2n, B
arrangement of the above functions in log2n, √n, n log2n, n 10 ,√n, n
√n, n 10 ,√n
increasing order of asymptotic
complexity is:
Remembering The process in which a function calls Callee
20 Iteration Recursion Loop Caller B
itself directly or indirectly is called a ----
Progra
m
Program Only one execur
Remembering If a recursive method not having a base Its not a Enters in infintte
21 not iteration es C
case, then what will be happened? problem loop
compiled happened normal
ly
State whether the below statement is true
Remembering or false.
22 True False A
“In recursion, number of parameters is
never change.”
 State whether the below statement is true
Remembering or false.
23 True False A
“In recursion, the parameter value
changes.”
Reduce
Remembering time Adds clarity Reduce time to Uses more None
24 The disadvantage of recursion is----- D
complexity to code. debug. space
.
A recurrence is an equation or inequality Either
Remembering Smaller Larger Value not None
25 that describes a function in terms of its -- smaller or A
values. values change
-- larger
Remembering In which recurrence method, we will Substitutio Iteration Recursion Tree Master None
26 A
guess the solution? n Method Method Method Method
Remembering In master method, what is the constraint <=1
27 <1 >1 =1 >=1 D
for “a”
Remembering In master method, what is the constraint <=1
28 <1 >1 =1 >=1 B
for “b”
State whether the below statement is true
Remembering or false.
29 True False B
“In amortized analysis, average or worst
case measure is input dependent.”
Banki
Which amortized analysis method ng
Remembering Potential Accounting Aggregate Energy
30 evaluated as, Total cost of n operations / metho C
method method method method
number of operations d