Discrete Mathematics Mock Test 5

10%

Question 1 of 10

1. For any positive integer m ______ is divisible by 4.

m³ + 3m

3m + 1

5m² + 2

m² + 3

Question 1 of 10

Question 2 of 10

2. Let A’s public key is n=6, 736, 180, 7817, 961, 456, 267 and e = 5 and B sends the ciphertext. c = 456, 871, 122, 391, 882, 538 to A. Determine B’s message in numeric format?

57971.89

235813

770190.04

687651.9

Question 2 of 10

Question 3 of 10

3. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?

for m=k, k!>2^k+1 holds

for m=k, k!>3^k holds

for m=k, k+1!>2^k holds

for m=k, k!>2^k holds

Question 3 of 10

Question 4 of 10

4. TEA cipher uses which of the following structure?

feistel structure

standard cipher structure

pseudo random structure

block structure

Question 4 of 10

Question 5 of 10

5. Radix complement can be obtained fromdiminished radix's complement by _________

None of the mentioned

Subtracting one to diminished radox's complement

Adding one to diminished radox's complement

Both are same things

Question 5 of 10

Question 6 of 10

6. 22-cent of postage can be produced with two 4-cent stamp and one 11-cent stamp.

False

True

Question 6 of 10

Question 7 of 10

7. Which positive integer less than 21 are relatively prime to 21?

Question 7 of 10

Question 8 of 10

8. For any integer m>=3, the series 2+4+6+...+(4m) can be equivalent to ________

m^m

m+1

m²+3

3m²+4

Question 8 of 10

Question 9 of 10

9. Which of the following algorithms has better computational complexity than standard division algorithms?

Montgomery algorithm

FSM algorithm

ASM algorithm

Classical modular exponentiation algorithm

Question 9 of 10

Question 10 of 10

10. The HCF of two prime numbers a and b is _________

a + b

^a⁄_b

Question 10 of 10