Q.1.
What is meant by the power set of a set?
Q.2.
Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
Q.3.
How many Hamiltonian paths does the following graph have?
Q.4.
Which of the following is also known as LCM?
Q.5.
What is the LCM according to the given Venn Diagram?
Q.6.
What is the time complexity of the above recursive implementation used to reverse a string?
Q.7.
What can be the maximum sum of digits for a 4 digit number?
Q.8.
What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
Q.9.
What can be the minimum sum of digits for a 4 digit number?