MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
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. |
Which of the following should be the base case for the recursive solution of subset sum problem? |
| A. | a) |
| Answer» C. | |
| 2. |
Which of the following is not true about subset sum problem? |
| A. | the recursive solution has a time complexity of O(2n) |
| B. | there is no known solution that takes polynomial time |
| C. | the recursive solution is slower than dynamic programming solution |
| D. | the dynamic programming solution has a time complexity of O(n log n) |
| Answer» E. | |
| 3. |
Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity. |
| A. | true |
| B. | false |
| Answer» C. | |
| 4. |
Which of the following is true about the time complexity of the recursive solution of the subset sum 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 | |
| 5. |
What is a subset sum 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 and printing true or false based on the result |
| C. | finding the sum of elements present in a set |
| D. | finding the sum of all the subsets of a set |
| Answer» C. finding the sum of elements present in a set | |
| 6. |
Under what condition any set A will be a subset of B? |
| A. | if all elements of set B are also present in set A |
| B. | if all elements of set A are also present in set B |
| C. | if A contains more elements than B |
| D. | if B contains more elements than A |
| Answer» C. if A contains more elements than B | |