MCQGeeks
0 : 0 : 1
CBSE
JEE
NTSE
NEET
English
UK Quiz
Quiz
Driving Test
Practice
Games
Quiz
Computer Science
Design And Analysis Of Algorithms
Quiz 3
1
2
3
4
5
6
7
8
9
Q.1
What is meant by the power set of a set?
subset of all sets
set of all subsets
set of particular subsets
an empty set
Q.2
Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
it has an exponential time complexity
it has a linear time complexity
it has a logarithmic time complexity
it has a time complexity of o(n2)
Q.3
How many Hamiltonian paths does the following graph have?
1
2
3
4
Q.4
Which of the following is also known as LCM?
lowest common divisor
least common multiple
lowest common measure
highest common multiple
Q.5
What is the LCM according to the given Venn Diagram?
2
3 c) 180
d) 6
Q.6
What is the time complexity of the above recursive implementation used to reverse a string?
o(1)
o(n)
o(n2)
o(n3)
Q.7
What can be the maximum sum of digits for a 4 digit number?
1
16
36
26
Q.8
What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
o(n)
o(n2)
o(n3)
o(n!)
Q.9
What can be the minimum sum of digits for a 4 digit number?
0
1
16
36
0 h : 0 m : 1 s
1
2
3
4
5
6
7
8
9
Report Question
×
What's an issue?
Question is wrong
Answer is wrong
Other Reason
Want to elaborate a bit more? (optional)
Support mcqgeeks.com by disabling your adblocker.
×
Please disable the adBlock and continue.
Thank you.
Reload page