Question 51 : While generating partitions of integer 3 we consider 2 1 and 1 2 to be different partitions.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 52 : How many combinations of 2 elements will be formed from the array arr={1,2,3}?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 53 : Which one of the following problem types does inclusion-exclusion principle belong to?
1. Numerical problems
2. Graph problems
3. String processing problems
4. Combinatorial problems
View Answer   Discuss with Members

Question 54 : What is meant by the power set of a set?
1. subset of all sets
2. set of all subsets
3. set of particular subsets
4. empty set
View Answer   Discuss with Members

Question 55 : If 4 is the GCD of 16 and 12, What is the GCD of 12 and 4?
1. 12
2. 6
3. 4
4. 2
View Answer   Discuss with Members

Question 56 : What is the running time of naïve matrix multiplication algorithm?
1. O(n^2.81)
2. O(n⁴)
3. O(n)
4. O(n³)
View Answer   Discuss with Members

Question 57 : The number of scalar additions and subtractions used in Strassen's matrix multiplication algorithm is ________
1. O(n^2.81)
2. Theta(n²)
3. Theta(n)
4. O(n³)
View Answer   Discuss with Members

Question 58 : Number of elements in the power set of set S={1,2,3} will be?
1. 2
2. 4
3. 6
4. 8
View Answer   Discuss with Members

Question 59 : The no. of partitions of which of the following integer will be divisible by 5?
1. 3
2. 5
3. 9
4. 6
View Answer   Discuss with Members

Question 60 : The Euclid's algorithm runs efficiently if the remainder of two numbers is divided by the minimum of two numbers until the remainder is zero.
1. True
2. False
3.
4.
View Answer   Discuss with Members