Explore topic-wise MCQs in General Awareness.

This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.

1.

What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?

A. O(n log n)
B. O(n2)
C. O(2n)
D. O(sum*n)
Answer» E.
Discussion
2.

Which of the following should be the base case for the recursive solution of a set partition problem?

A. a)
Answer» C.
Discussion
3.

Recursive solution of Set partition problem is faster than dynamic problem solution in terms of time complexity.

A. true
B. false
Answer» C.
Discussion
4.

What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?

A. O(n)
B. O(sum)
C. O(n2)
D. O(sum*n)
Answer» E.
Discussion
5.

Which of the following is true about the time complexity of the recursive solution of set partition problem?

A. It has an exponential time complexity
B. It has a linear time complexity
C. It has a logarithmic time complexity
D. it has a time complexity of O(n2)
Answer» B. It has a linear time complexity
Discussion
6.

What is the set partition problem?

A. finding a subset of a set that has sum of elements equal to a given number
B. checking for the presence of a subset that has sum of elements equal to a given number
C. checking whether the set can be divided into two subsets of with equal sum of elements and printing true or false based on the result
D. finding subsets with equal sum of elements
Answer» D. finding subsets with equal sum of elements
Discussion