Discrete Mathematics Mock Test 4

10%

Question 1 of 10

1. What is pseudo prime number?

is a probable prime and is not a prime number

does not share any property with prime number

is a prime number

none of the mentioned

Question 1 of 10

Question 2 of 10

2. LCM of 6, 10 is?

Question 2 of 10

Question 3 of 10

3. The complexity of Binary search algorithm is _________

O(n log n)

O(n²)

O(n)

O(log)

Question 3 of 10

Question 4 of 10

4. An algorithm which tries all the possibilities unless results are satisfactory is and generally is time-consuming is _________

Brute Force

Dynamic programming algorithms

None of the mentioned

Divide and Conquer

Question 4 of 10

Question 5 of 10

5. If matrix A and B are symmetric and AB = BA iff _________

AB is symmetric matrix

AB is an anti-symmetric matrix

AB is a null matrix

None of the mentioned

Question 5 of 10

Question 6 of 10

6. The worst case occurs in quick sort when _________

Pivot is the median of the array

Pivot is the smallest element

Pivot is the middle element

None of the mentioned

Question 6 of 10

Question 7 of 10

7. If matrix A, B and C are invertible matrix of same order then (ABC)^-1 = _________

CBA

None of the mentioned

C^T B^-1 A^T

C^-1 B^-1 A^-1

Question 7 of 10

Question 8 of 10

8. A Highest Common Factor of a, b is defined as ___________

It is the greatest integer divisor of both a and b

It is the smallest integer divisible by both a and b

None of the mentioned

It is the sum of the number a and b

Question 8 of 10

Question 9 of 10

9. Let I₃ be the Identity matrix of order 3 then (I₃)^-1 is equal to _________

None of the mentioned

I₃

3I₃

Question 9 of 10

Question 10 of 10

10. If for an algorithm time complexity is given by O(n²) then complexity will ___________

exponential

none of the mentioned

constant

quadratic

Question 10 of 10