What is the message length 'k' of a Hamming(7,4) code?
A. 2r-1
B. 2r-r+1
C. 2r-r-1
D. 2r+1-r
Answer: Option C
A. 2r-1
B. 2r-r+1
C. 2r-r-1
D. 2r+1-r
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