a. List

b. Stree

c. Stack

d. Queue

**Answer:** c. Stack

a. 5

b. 6

c. 7

d. 8

**Answer:** a. 5

a. Recursion

b. Divide and rule

c. Greedy method

d. Divide and conquer

**Answer:** d. Divide and conquer

a. Binary Search

b. Linear Search

c. Hashing

d. Tree Search

**Answer:** c. Hashing

a. Inorder predecessor

b. Inorder successor

c. Preorder predecessor

d. Post order

**Answer:** b. Inorder successor

a. Reverse Polish Notation

b. Prefix notation

c. Postfix notation

d. Polish Reverse Notation

**Answer:** b. Prefix notation

a. Binary Search

b. Linear Search

c. Interpolation search

d. All of the above

**Answer:** a. Binary Search

a. True

b. False

**Answer:** a. True

a. Queue

b. Stack

c. Array

d. None of the above

**Answer:** a. Queue

a. List

b. Stack

c. Queue

d. All of the above

**Answer:** c. Queue

a. illegal call

b. reverse polish

c. recursive

d. All of the above

**Answer:** c. recursive