Question 11 : What will be the time complexity of the code to print combinations?
1. O(n)
2. O(n²)
3. O(n log n)
4. O(2ⁿ)
View Answer   Discuss with Members

Question 12 : Who invented Euclid's algorithm?
1. Sieve
2. Euclid
3. Euclid-Sieve
4. Gabriel lame
View Answer   Discuss with Members

Question 13 : Strassen's Matrix Algorithm was proposed by _____________
1. Volker Strassen
2. Andrew Strassen
3. Victor Jan
4. Virginia Williams
View Answer   Discuss with Members

Question 14 : What is the total running time of the binary GCD algorithm?
1. O(N)
2. O(N²)
3. O(log N)
4. O(N log N)
View Answer   Discuss with Members

Question 15 : ____________ is an arithmetic function that calculates the total number of positive integers less than or equal to some number n, that are relatively prime to n.
1. Euler's phi function
2. Euler's omega function
3. Cauchy's totient function
4. Legrange's function
View Answer   Discuss with Members

Question 16 : Which of the following is a correct representation of inclusion-exclusion principle?
1. |A U B|=|A|+|B|-|A,B|
2. |A,B|=|A|+|B|-|A U B|
3. |A U B|=|A|+|B|+|A,B|
4. |A,B|=|A|+|B|+|A U B|
View Answer   Discuss with Members

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

Question 18 : How many iterating statements are involved in the naïve method of matrix multiplication?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 19 : What will be the lexicographical order of combinations of 2 elements each formed from the array arr={1,2,3}?
1. {{2,1},{3,2},{3,1}}
2. {{1,2},{2,3},{1,3}}
3. {{1,2},{1,3},{2,3}}
4. {{2,1},{3,1},{3,2}}
View Answer   Discuss with Members

Question 20 : Which of the following is the correct mathematical application of Euclid's algorithm?
1. Determination of prime numbers
2. Lagrange's four square theorem
3. Cauchy-Euler theorem
4. Residue theorem
View Answer   Discuss with Members