What is the rule for encryption in playfair cipher if the letters in a pair does not appear in same row or column?
A. they are replaced by the letter appearing immediately below them respectively
B. they are replaced by the letter appearing immediately right to them respectively
C. they are replaced by the letter of the same row at the corner of the rectangle defined by the original pair respectively
D. that pair is neglected
Answer: Option C
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Which data structure is used to implement a binary heap efficiently?
A. Array
B. Linked List
C. Stack
D. Queue
In which scenario would you use a Bloom Filter?
A. For implementing a stack-based algorithm
B. To maintain a balanced binary tree
C. For efficient sorting of elements
D. To test membership in a large dataset
A. Queue
B. Stack
C. Heap
D. Array
Join The Discussion