Polybius Square Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Polybius Square”.

1. Polybius square is also known by the name of?
a) Polybius checkboard
b) Polybius table
c) Ploybius board
d) Ploybius keypad
View Answer

2. How many keys are required for encryption and decryption of data when we use asymmetric cipher?
a) 0
b) 1
c) 2
d) 3
View Answer

3. Which of the following is made possible by the use of Polybius square?
a) To represent the plain text by smaller set of symbols
b) To represent the plain text by larger set of symbols
c) To represent the plain text by the letters of some other language
d) To represent the plain text by the same set of symbols
View Answer

4. What is the usual size of polybius square used for encrypting English alphabets?
a) 5 X 5
b) 6 X 6
c) 26 X 26
d) 25 X 25
View Answer

5. Polybius square cipher is most closely related to?
a) mono-alphabetic cipher
b) poly-alphabetic cipher
c) transposition cipher
d) additive cipher
View Answer

6. Which two English letters are usually combined in polybius table?
a) A and B
b) Y and Z
c) I and J
d) J and K
View Answer

7. Auto key cipher is more secure than polybius square cipher?
a) true
b) false
View Answer

8. Polybius square cipher is less susceptible to frequency analysis.
a) true
b) false
View Answer

9. Which of the following cipher uses polybius square cipher in its first step of encrypting data?
a) Autokey cipher
b) One time pad cipher
c) ADFGVX cipher
d) Rail fence cipher
View Answer

10. What will be the plain text corresponding to ciphered text “134325” if standard polybius square cipher is used for encryption?
a) SRH
b) CSK
c) RCB
d) KKR
View Answer

11. What will be the encrypted text corresponding to plain text “SAN” using standard polybius square cipher?
a) 431133
b) 341133
c) 441133
d) 114433
View Answer

12.What will be the output of the following C++ code?

#include <cmath> 
#include <iostream> 
using namespace std; 
void Cipher(string str) 
{ 
    int r, c; 
    for (int i = 0; str[i]; i++) 
    { 
 
	r = ceil((str[i] - 'a') / 5) + 1; 
 
 
	c = ((str[i] - 'a') % 5) + 1; 
 
 
	if (str[i] == 'k') 
        { 
	    r = r - 1; 
	    c = 5 - c + 1; 
	} 
 
 
	else if (str[i] >= 'j') 
        { 
	    if (c == 1) 
            { 
		c = 6; 
		r = r - 1; 
	    } 
	    c = c - 1; 
	} 
	cout << r << c; 
    } 
    cout << endl; 
} 
 
int main() 
{ 
    string str = "nsit"; 
    Cipher(str); 
}

a) 33344244
b) 44332434
c) 33432444
d) 11444323
View Answer

Sanfoundry Global Education & Learning Series – Data Structures & Algorithms.

To practice all areas of Data Structures & Algorithms, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]