What is meant by the term lexicographical order?
A. dictionary ordering of elements
B. reverse dictionary ordering of elements
C. to sort according to value of first element
D. to sort according to value of last element
Answer: Option A
A. dictionary ordering of elements
B. reverse dictionary ordering of elements
C. to sort according to value of first element
D. to sort according to value of last element
Answer: Option A
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