What is the source?
A. Vertex with no incoming edges
B. Vertex with no leaving edges
C. Centre vertex
D. Vertex with the least weight
Answer: Option A
A. Vertex with no incoming edges
B. Vertex with no leaving edges
C. Centre vertex
D. Vertex with the least weight
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