InterviewSolution
Saved Bookmarks
InterviewSolution
This section includes InterviewSolutions, each offering curated multiple-choice questions to sharpen your knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
Out of following which one is Mersenne Primes?(a) 3(b) 7(c) 2047(d) 31I got this question in exam.This interesting question is from Number Theory in portion Number Theory and Cryptography of Discrete Mathematics |
|
Answer» RIGHT ANSWER is (C) 2047 Explanation: 2047 = 23.89 ALSO not in FORM of 2^b-1 form. |
|
| 52. |
The prime factorization of 7007 is __________(a) 7^3.11.13(b) 7^2.11.13(c) 7.11.13(d) 7.11^3.13I have been asked this question during a job interview.Origin of the question is Number Theory in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right CHOICE is (B) 7^2.11.13 |
|
| 53. |
The value of 5^2003 mod 7 is?(a) 3(b) 4(c) 8(d) 9The question was asked in homework.My query is from Applications of Number Theory in portion Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The CORRECT answer is (a) 3 |
|
| 54. |
The linear combination of gcd(10, 11) = 1 can be written as _________(a) (-1)*10 + 1*11(b) (-2)*10 + 2*11(c) 1*10 + (-1)*11(d) (-1)*10 + 2*11This question was addressed to me in an interview for internship.Query is from Applications of Number Theory topic in portion Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The correct answer is (a) (-1)*10 + 1*11 |
|
| 55. |
The solution of the linear congruence 4x = 5(mod 9) is?(a) 6(mod 9)(b) 8(mod 9)(c) 9(mod 9)(d) 10(mod 9)The question was asked by my college professor while I was bunking the class.This intriguing question comes from Applications of Number Theory in chapter Number Theory and Cryptography of Discrete Mathematics |
| Answer» | |
| 56. |
The integer 2821 is a Carmichael number.(a) True(b) FalseThis question was posed to me in an international level competition.This interesting question is from Applications of Number Theory topic in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The correct OPTION is (a) True |
|
| 57. |
The inverse of 19 modulo 141 is?(a) 50(b) 51(c) 54(d) 52This question was posed to me in homework.Asked question is from Applications of Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» CORRECT ANSWER is (d) 52 Explanation: By USING the EUCLIDEAN ALGORITHM. |
|
| 58. |
The linear combination of gcd(117, 213) = 3 can be written as _________(a) 11*213 + (-20)*117(b) 10*213 + (-20)*117(c) 11*117 + (-20)*213(d) 20*213 + (-25)*117This question was posed to me during an interview for a job.My query is from Applications of Number Theory topic in division Number Theory and Cryptography of Discrete Mathematics |
| Answer» | |
| 59. |
The inverse of 7 modulo 26 is?(a) 12(b) 14(c) 15(d) 20This question was posed to me in examination.Question is from Applications of Number Theory topic in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The correct ANSWER is (C) 15 |
|
| 60. |
The integer 561 is a Carmichael number.(a) True(b) FalseThis question was posed to me by my college professor while I was bunking the class.Query is from Applications of Number Theory in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct answer is (a) True |
|
| 61. |
The inverse of 3 modulo 7 is?(a) -1(b) -2(c) -3(d) -4This question was addressed to me in an online quiz.Origin of the question is Applications of Number Theory topic in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The correct answer is (B) -2 |
|
| 62. |
If 0^a is not equal to zero then which of the values a cannot take _________(a) 1(b) 2(c) -1(d) 0The question was posed to me in an international level competition.Origin of the question is Number Theory and Cryptography topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» CORRECT CHOICE is (d) 0 Best EXPLANATION: a^0 = 1, for any REAL NUMBER. |
|
| 63. |
The linear combination of gcd(252, 198) = 18 is?(a) 252*4 – 198*5(b) 252*5 – 198*4(c) 252*5 – 198*2(d) 252*4 – 198*4I got this question in exam.I'm obligated to ask this question of Applications of Number Theory in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct choice is (a) 252*4 – 198*5 |
|
| 64. |
For some number a, b and c, a^c x b^c is equal to _________(a) (ab)^c(b) (ac)^b(c) (cb)^a(d) None of the mentionedI got this question at a job interview.This question is from Number Theory and Cryptography in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» CORRECT OPTION is (a) (ab)^c The explanation: If POWER are same then BASES are multiplied. |
|
| 65. |
If 2^a-b = 1 then the value of a-b is equal to _________(a) 1(b) 0(c) 2(d) none of the mentionedI have been asked this question in quiz.This interesting question is from Number Theory and Cryptography topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The CORRECT choice is (b) 0 |
|
| 66. |
State whether the given statement is true or false.(a) Exponentiation is associative.(b) True(c) FalseI have been asked this question during an interview.My question is taken from Number Theory and Cryptography topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The CORRECT answer is (B) True |
|
| 67. |
State whether the given statement is true or false.(a) Exponentiation is commutative.(b) True(c) FalseThis question was posed to me in unit test.The origin of the question is Number Theory and Cryptography topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The CORRECT ANSWER is (b) True |
|
| 68. |
For some number a, b and c, c^a/c^b is equal to _________(a) c^a-b(b) c^a+b(c) c(d) None of the mentionedI had been asked this question during a job interview.My question is from Number Theory and Cryptography in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The correct answer is (a) c^a-b |
|
| 69. |
If a is a real number than a^0 is defined as _________(a) 0(b) a(c) 1(d) -1This question was addressed to me in unit test.I would like to ask this question from Number Theory and Cryptography topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct ANSWER is (a) 0 |
|
| 70. |
For some number a, b and c, c^a x c^b is equal to _________(a) c^a-b(b) c^a+b(c) c(d) none of the mentionedI have been asked this question in quiz.This intriguing question comes from Number Theory and Cryptography in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct CHOICE is (B) c^a+b |
|
| 71. |
If ab = 1, where a and b are real numbers then?(a) a = b^-1(b) b = a(c) a = b = 2(d) none of the mentionedThis question was addressed to me in an interview for internship.Question is from Number Theory and Cryptography topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The correct ANSWER is (a) a = b^-1 |
|
| 72. |
For some number b, (^1⁄b)^-n is equal to _________(a) -b^n(b) n^b(c) b^n(d) none of the mentionedI got this question in an online interview.My doubt stems from Number Theory and Cryptography topic in portion Number Theory and Cryptography of Discrete Mathematics |
|
Answer» CORRECT OPTION is (C) B^n For EXPLANATION: b^-1reciprocal of b. |
|
| 73. |
Decimal equivalent of one’s complement of 11111001 is?(a) 5(b) 6(c) 4(d) 10I have been asked this question by my school principal while I was bunking the class.Asked question is from Number Theory in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» CORRECT option is (b) 6 To explain: ONE’s complement of that NUMBER is 00000110 which is 6 in decimal. |
|
| 74. |
9’s complement of 23456 is?(a) 87654(b) 76543(c) 12345(d) none of the mentionedI have been asked this question during an online interview.The question is from Number Theory topic in portion Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct option is (B) 76543 |
|
| 75. |
In signed representation 5 is represented in binary as 0101.(a) True(b) FalseThe question was asked during an interview for a job.My doubt stems from Number Theory in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct answer is (a) True |
|
| 76. |
Radix complement can be obtained fromdiminished radix’s complement by _________(a) Adding one to diminished radox’s complement(b) Subtracting one to diminished radox’s complement(c) Both are same things(d) None of the mentionedThe question was asked in my homework.Question is from Number Theory in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right choice is (a) ADDING one to diminished radox’s COMPLEMENT |
|
| 77. |
The two’s complement of 101110100 is represented as?(a) 010001100(b) 101110101(c) 010001100(d) None of the mentionedI got this question in an interview for job.This intriguing question comes from Number Theory in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» RIGHT choice is (a) 010001100 For EXPLANATION I WOULD say: 2’s COMPLEMENT = 1’s complement +1, 1’s complement = 010001011. |
|
| 78. |
In binary signed representation if most significant bit is one then that number is positive.(a) True(b) FalseThis question was addressed to me in an international level competition.My question comes from Number Theory in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The CORRECT CHOICE is (b) False |
|
| 79. |
One’s complement in binary is defined as _________(a) Flipping each binary bit(b) Adding one to the binary number(c) Flipping only bits having zero in it(d) None of the mentionedI got this question during an interview.Question is from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The correct choice is (a) FLIPPING each binary bit |
|
| 80. |
What is the one’s complement of the number 1010110?(a) 1111111(b) 0101001(c) 1100110(d) None of the mentionedThis question was addressed to me in examination.Enquiry is from Number Theory topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct CHOICE is (b) 0101001 |
|
| 81. |
A number greater than 32 would require a minimum of how may bits in binary representation?(a) 5(b) 6(c) 4(d) 10This question was addressed to me in a national level competition.My query is from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right CHOICE is (b) 6 |
|
| 82. |
The binary number 100110 in octal is represented by _______________(a) 45(b) 10012(c) 46(d) 58The question was posed to me in examination.I would like to ask this question from Number Theory in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right option is (c) 46 |
|
| 83. |
For some base r, the digits which are allowed in its representation are?(a) Digits from 1 to r(b) Digits from 0 to r-1(c) Digits from 1 to r-1(d) None of the mentionedI got this question in an interview for job.I would like to ask this question from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct ANSWER is (B) Digits from 0 to r-1 |
|
| 84. |
Octal number may contain digits from 1 to 8.(a) True(b) FalseI had been asked this question during an interview.This key question is from Number Theory in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct CHOICE is (b) False |
|
| 85. |
F in hexadecimal representation is equivalent to 9 in decimal.(a) True(b) FalseI had been asked this question in final exam.This interesting question is from Number Theory in portion Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right choice is (b) False |
|
| 86. |
Decimal 13 in base 8 can be represented as _________(a) 15(b) 12(c) 22(d) None of the mentionedThis question was posed to me by my school principal while I was bunking the class.This interesting question is from Number Theory topic in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct CHOICE is (a) 15 |
|
| 87. |
Decimal equivalent of binary number 1010 is?(a) 11(b) A(c) 10(d) None of the mentionedI have been asked this question in semester exam.My doubt stems from Number Theory topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right ANSWER is (c) 10 |
|
| 88. |
Which of the number is not allowed in Octal representation of a number?(a) 0(b) 4(c) 8(d) None of the mentionedThis question was addressed to me in quiz.Origin of the question is Number Theory in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» RIGHT choice is (c) 8 To ELABORATE: OCTAL NUMBERS are formed with a combination of 0 to 7 only. |
|
| 89. |
Hexadecimal number equivalent of decimal 10 is?(a) 10(b) A(c) F(d) None of the mentionedI had been asked this question in homework.I need to ask this question from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» CORRECT choice is (b) A To explain I WOULD SAY: In hexadecimal representation A is represented as DECIMAL 10. |
|
| 90. |
Which of the number is not allowed in Binary representation of a number?(a) 0(b) 1(c) 2(d) None of the mentionedThe question was posed to me by my school teacher while I was bunking the class.I would like to ask this question from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct OPTION is (c) 2 |
|
| 91. |
HCF(a, b) is equals to _________(a) ab/(LCM(a, b))(b) (a + b)/(LCM(a, b))(c) (LCM(a, b))/ab(d) None of the mentionedI got this question in homework.I would like to ask this question from Number Theory in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right ANSWER is (a) ab/(LCM(a, b)) |
|
| 92. |
The HCF of two prime numbers a and b is _________(a) ^a⁄b(b) ab(c) a + b(d) 1I have been asked this question in exam.Enquiry is from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» RIGHT CHOICE is (d) 1 Best explanation: SINCE they doesnot have any factor in common other than 1. |
|
| 93. |
If a number is 2^2 x 3^1 x 5^0 and b is 2^2 x 3^1 x 5^1 then hcfof a, b is?(a) 2^2 x 3^1 x 5^1(b) 2^2 x 3^2 x 5^2(c) 2^1 x 3^1 x 5^0(d) 2^2 x 3^2 x 5^0I got this question in exam.I'd like to ask this question from Number Theory topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Correct choice is (c) 2^1 x 3^1 x 5^0 |
|
| 94. |
If LCM of two number is 10 and GCD is 5 then the product of two numbers is?(a) 45(b) 50(c) 7(d) 49I had been asked this question in final exam.I want to ask this question from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right CHOICE is (b) 50 |
|
| 95. |
The product of two numbers are 12 and there LCMis 6 then HCF is?(a) 12(b) 2(c) 6(d) None of the mentionedThe question was posed to me during an interview.This question is from Number Theory topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» RIGHT choice is (b) 2 The best I can EXPLAIN: The HCF of two number a and b is GIVEN by (hcf(a, b)) = ab/ lcm(a, b). |
|
| 96. |
If a,b are integers such that a > b then hcf(a, b) lies in _________(a) a> hcf(a, b)>b(b) a>b> = hcf(a, b)(c) hcf(a, b)> = a>b(d) None of the mentionedThis question was addressed to me in an interview.This interesting question is from Number Theory topic in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» CORRECT choice is (b) a>b> = HCF(a, b) The explanation is: Hcf of number is either EQUAL to smallest number or is least among all. |
|
| 97. |
HCF of 6, 10 is?(a) 60(b) 30(c) 10(d) 2The question was asked in quiz.This interesting question is from Number Theory in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» Right CHOICE is (d) 2 |
|
| 98. |
The HCF of two number 1, b(integer) are _________(a) b + 2(b) 1(c) b(d) None of the mentionedThe question was asked by my school teacher while I was bunking the class.My enquiry is from Number Theory topic in chapter Number Theory and Cryptography of Discrete Mathematics |
|
Answer» The CORRECT choice is (B) 1 |
|
| 99. |
A Highest Common Factor of a, b is defined as ___________(a) It is the smallest integer divisible by both a and b(b) It is the greatest integer divisor of both a and b(c) It is the sum of the number a and b(d) None of the mentionedI had been asked this question by my college professor while I was bunking the class.This intriguing question comes from Number Theory in section Number Theory and Cryptography of Discrete Mathematics |
|
Answer» RIGHT choice is (b) It is the greatest integer DIVISOR of both a and b Best explanation: Defination of HCF(a, b)-greatest integer divisor of both a and b. |
|
| 100. |
The lcm of two prime numbers a and b is _________(a) ^a⁄b(b) ab(c) a + b(d) 1I got this question in an international level competition.My query is from Number Theory topic in division Number Theory and Cryptography of Discrete Mathematics |
|
Answer» RIGHT option is (b) ab Best EXPLANATION: LCM(a, b) = ab/(GCD(a, b)), Since (GCD(a, b)) = 1 therfore LCM(a, b) = ab. |
|