What is common between affine cipher and pigpen cipher.
A. both are mono alphabetic substitution cipher
B. both are poly alphabetic substitution cipher
C. both can be cracked using frequency analysis
D. both are transposition cipher
Answer: Option C
A. both are mono alphabetic substitution cipher
B. both are poly alphabetic substitution cipher
C. both can be cracked using frequency analysis
D. both are transposition cipher
Answer: Option C
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