Explore topic-wise InterviewSolutions in Current Affairs.

This section includes 7 InterviewSolutions, each offering curated multiple-choice questions to sharpen your Current Affairs knowledge and support exam preparation. Choose a topic below to get started.

1.	In base 26, multiplication of YES by NO gives -(a) THWOE(b) MPAHT(c) MPJNS(d) THWAE
Answer» Right option is (c) MPJNS To explain I would say: Convert the alphabets into their respective values in base 26 and proceed with base 26 multiplications.

2.	Dividing (11001001) by (100111) gives remainder -(a) 11(b) 111(c) 101(d) 110
Answer» Right choice is (d) 110 The explanation is: Dividing (11001001) by (100111) gives us (110).

3.	The Index of Coincidence for English language is approximately(a) 0.068(b) 0.038(c) 0.065(d) 0.048
Answer» Correct choice is (c) 0.065 Explanation: The IC for the English language is approximately 0.065.

4.	If all letters have the same chance of being chosen, the IC is approximately(a) 0.065(b) 0.035(c) 0.048(d) 0.038
Answer» Right answer is (d) 0.038 Explanation: If all letters have the same chance of being chosen, the IC is approximately 0.038, about half of the IC for the English language.

5.	Reduce the following big-O natations:O[ en + an10] =(a) O[ an^10 ](b) O[ n^10 ].(c) O[ e^n ].(d) O[ e^n + n^10 ].
Answer» Correct option is (c) O[ e^n ]. The best I can explain: O[ e^n + an^10] = O[ e^n ].

6.	Reduce the following big-O natations:O[ ax7 + 3 x3 + sin(x)] =(a) O[ax^7](b) O[sin(x)].(c) O[x^7].(d) O[x^7 + x^3].
Answer» The correct choice is (c) O[x^7]. For explanation: O[ ax^7 + 3 x^3 + sin(x)] = O(ax^7) = O(x^7)

7.	Divide (HAPPY)26 by (SAD)26. We get quotient -(a) KD(b) LD(c) JC(d) MC
Answer» Right choice is (a) KD Explanation: Dividing (HAPPY)26 by (SAD)26 gives us KD with a remainder MLP.

8.	Division of (131B6C3) base 16 by (lA2F) base 16 yeilds -(a) 1AD(b) DAD(c) BAD(d) 9AD
Answer» Right option is (d) 9AD To elaborate: Base 16 division to be followed where A-F stand for 10-15.

9.	The estimated computations required to crack a password of 6 characters from the 26 letter alphabet is-(a) 308915776(b) 11881376(c) 456976(d) 8031810176
Answer» Correct choice is (a) 308915776 Best explanation: The required answer is 26^6 = 308915776.

10.	The time required to convert a k-bit integer to its representation in the base 10 in terms of big-O notation is(a) O(log2 n)(b) O(log n)(c) O(log2 2n)(d) O(2log n)
Answer» Correct answer is (a) O(log2 n) The best explanation: Let n be a k-bit integer in binary. The conversion algorithm is as follows. Divide 10 = (1010) into n. The remainder – which will be one of the integers 0, 1, 10, 11, 100, 101, 110, 11 1, 1000, or 1001 – will be the ones digit d0. Now replace n by the quotient and repeat the process, dividing that quotient by (1010), using the remainder as d1 and the quotient as the next number into which to divide (1010). This process must be repeated a number of times equal to the number of decimal digits in n, which is [log n/log 10] +1 = O(k). We have O(k) divisions, each requiring O(4k) operations (dividing a number with at most k bits by the 4 bit number (1010)). But O(4k) is the same as O(k) (constant factors don’t matter in the big-0 notation, so we conclude that the total number of bit operations is O(k). O(k) = 0(k2). If we want to express this in terms of n rather than k, then since k = O(1og n), we can write Time(convert n to decimal) = 0(log2n).

11.	pi in terms of base 26 is(a) C.DRS(b) D.SQR(c) D.DRS(d) D.DSS
Answer» Right answer is (c) D.DRS Easy explanation: On converting using base conversions we get 3.1415926 as D.DRS.

12.	Choose from among the following cipher systems, from best to the worst, with respect to ease of decryption using frequency analysis.(a) Random Polyalphabetic, Plaintext, Playfair(b) Random Polyalphabetic, Playfair, Vignere(c) Random Polyalphabetic, Vignere, Playfair, Plaintext(d) Random Polyalphabetic, Plaintext, Beaufort, Playfair
Answer» Right option is (c) Random Polyalphabetic, Vignere, Playfair, Plaintext Explanation: Random Polyalphabetic is the most resistant to frequency analysis, followed by Vignere, Playfair and then Plaintext.

13.	Caesar Cipher is an example of(a) Poly-alphabetic Cipher(b) Mono-alphabetic Cipher(c) Multi-alphabetic Cipher(d) Bi-alphabetic Cipher
Answer» Right answer is (b) Mono-alphabetic Cipher Easy explanation: Caesar Cipher is an example of Mono-alphabetic cipher, as single alphabets are encrypted or decrypted at a time.

14.	If the sender and receiver use different keys, the system is referred to as conventional cipher system.(a) True(b) False
Answer» The correct option is (b) False For explanation I would say: Such a system is called asymmetric, two-key, or public-key cipher system.

15.	On Encrypting "thepepsiisintherefrigerator" using Vignere Cipher System using the keyword "HUMOR" we get cipher text-(a) abqdnwewuwjphfvrrtrfznsdokvl(b) abqdvmwuwjphfvvyyrfznydokvl(c) tbqyrvmwuwjphfvvyyrfznydokvl(d) baiuvmwuwjphfoeiyrfznydokvl
Answer» Correct option is (b) abqdvmwuwjphfvvyyrfznydokvl The explanation is: Cipher text:= Ci = Pi + ki mod m (mod 26).

16.	On Encrypting "cryptography" using Vignere Cipher System using the keyword "LUCKY" we get cipher text(a) nlazeiibljji(b) nlazeiibljii(c) olaaeiibljki(d) mlaaeiibljki
Answer» The correct option is (a) nlazeiibljji Explanation: Cipher text:= Ci = Pi + ki mod m (mod 26).

17.	In brute force attack, on average half of all possible keys must be tried to achieve success.(a) True(b) False
Answer» Correct answer is (a) True Easiest explanation: In brute force attack the attacker tries every possible key on a piece of cipher-text until an intelligible translation into plaintext is obtained.

Previous Next