# Van Emde Boas Tree MCQs

Q1. Does Van Emde Boas data structure perform all operation in O (log (log M)) time where M = 2m..

A. TRUE.

B. FALSE.

C.  Nothing can be said.

D.  None of the mentioned.

Q2. What is the time complexity for searching a key or integer in Van Emde Boas data structure?.

A. O (log M!).

B. O (M!).

C. O (M2).

D. O (log (log M)).

Q3. Which type of tree does Van Emde Boas require to perform basic operations?.

A. Unbalanced.

B. Balanced.

C. Complete.

D. Non - Binary.

Q4. What is the time complexity for inserting a key or integer in Van Emde Boas data structure?.

A. O (log M!).

B. O (M!).

C. O (M2).

D. O (log (log M)).

Q5. In which year was Van Emde Boas tree invented?.

A. 1972.

B. 1973.

C. 1974.

D. 1975.

Q6. What is the time complexity for deleting a key or integer in Van Emde Boas data structure?.

A. O (log M!).

B. O (log (log M)).

C. O (M!).

D. O (M2).

Q7. Can operation like Find Next and Find Previous be implemented..

A. TRUE.

B. FALSE.

C.  Nothing can be said.

D.  None of the mentioned.

Q8. What is the time complexity for finding a maximum and minimum integer in Van Emde Boas data structure?.

A. O (log M!).

B. O (M!).

C. O (1).

D. O (log (log M)).

Q9. On which abstract data type does van Emde Boas tree performs the operation?.

A. Tree.

C. Heap.

D. Associative Array.

Q10. Which operation find the value associated with a given key?.

A. Insert.

B. Find Next.

C. Look up.

D. Delete.

Q11. How many properties will an equivalent relationship satisfy?.

A. 1.

B. 2.

C. 3.

D. 4.

Q12. A relation R on a set S, defined as x R y if and only if y R x. This is an example of?.

A. reflexive relation.

B. symmetric relation.

C. transitive relation.

D. invalid relation.