Question 31 : Counting intersections can be done using the inclusion-exclusion principle only if it is combined with De Morgan's laws of complementing.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 32 : Compute the product matrix using Strassen's matrix multiplication algorithm.
Given a11=1; a12=3;a21=5;a22=7
b11=8;b12=4;b21=6;b22=2
1. c11=20;c12=12;c21=100;c22=15
2. c11=22;c12=8;c21=90;c22=32
3. c11=15;c12=7;c21=80;c22=34
4. c11=26;c12=10;c21=82;c22=34
View Answer   Discuss with Members

Question 33 : Let A={1,2,3} B={2,3,4} C={1,3,5} D={2,3}. Find the cardinality of sum of all the sets.
1. 6
2. 5
3. 4
4. 7
View Answer   Discuss with Members

Question 34 : ____________ is one of the most useful principles of enumeration in combinationatorics and discrete probability.
1. Inclusion-exclusion principle
2. Quick search algorithm
3. Euclid's algorithm
4. Set theory
View Answer   Discuss with Members

Question 35 : Euclidean algorithm does not require the calculation of prime factors.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 36 : What is the GCD of 20 and 12 using Euclid's algorithm?
1. 8
2. 2
3. 4
4. 6
View Answer   Discuss with Members

Question 37 : Who discussed techniques for reducing the memory requirements for Strassen's algorithm?
1. Strassen
2. Lederman
3. Bailey
4. Higham
View Answer   Discuss with Members

Question 38 : Running time of Strassen's algorithm is better than the naïve Theta(n³) method.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 39 : The number of elements in the power set increases when there are duplicates present in the set.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 40 : What is the running time of Strassen's algorithm for matrix multiplication?
1. O(n^2.81)
2. O(n³)
3. O(n^1.8)
4. O(n²)
View Answer   Discuss with Members