Which of the following is a correct representation of inclusion exclusion principle (|A,B| represents intersection of sets A,B)?
A. |A U B|=|A|+|B|-|A,B|
B. |A,B|=|A|+|B|-|A U B|
C. |A U B|=|A|+|B|+|A,B|
D. |A,B|=|A|+|B|+|A U B|
Answer: Option A
A. |A U B|=|A|+|B|-|A,B|
B. |A,B|=|A|+|B|-|A U B|
C. |A U B|=|A|+|B|+|A,B|
D. |A,B|=|A|+|B|+|A U B|
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