What is the GCD of a and b?
A. a + b
B. gcd (a-b, b) if a>b
C. gcd (a+b, a-b)
D. a - b
Answer: Option B
A. a + b
B. gcd (a-b, b) if a>b
C. gcd (a+b, a-b)
D. a - b
Answer: Option B
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