CS301 Quiz 2 Set 4

Q1. Which of the following is TRUE about recursive calls ?

1. Recursive calls can only be used with inorder traversal
2. Recursive call always contains a terminating condition
3. There is no terminating condition in recursive calls
4. Tree data structure cannot use recursive calls

Correct answer: Recursive call always contains a terminating condition

Q2. What will be level order traversal of the given BST ?

1. 6 2 8 1 5 3 4
2. 1 4 3 5 2 8 6
3. 1 2 3 4 5 6 8
4. 1 2 3 4 5 6 8

Correct answer: 1 4 3 5 2 8 6

Q3. Suppose the elements are “3”,”5”,”1”,”6”, If we want to enqueue “8” then dequeue all the elements, what will be the order of elements?

1. 8 3 5 1 6
2. 3 5 1 6 8
3. 6 1 5 3 8
4. 8 6 1 5 3

Correct answer: 3 5 1 6 8

Q4. For a complete binary tree with n numbers of nodes, the depth is calculated as ____________

1. log2 (n-1) – 1
2. log2 (n+1) + 1
3. log2 (n+1) – 1
4. log2 (n-1) + 1

Correct answer: log2 (n+1) – 1

Q5. Following is true in case of using Recursive method calls.

1. There is no effect on length of code
2. The code becomes very long
3. The code becomes very short
4. Code will not execute if it contains recursive calls

Correct answer: The code becomes very short

Q6. What will be the postorder traversal of the given tree?

1. 15 35 25 75 45
2. 75 45 15 35 25
3. 45 25 75 15 35
4. 25 15 35 45 75

Correct answer: 15 35 25 75 45

Q7. When a function calls another function, the parameters and return address of the calling function are put in ________.

1. Binary Tree
2. Stack
3. Queue
4. Heap

Correct answer: Stack

Q8. What will be the inorder traversal of the given tree?

1. 25 15 35 45 75
2. 15 25 35 45 75
3. 15 25 35 75 45
4. 45 25 75 15 35

Correct answer: 15 25 35 45 75

Q9. We can make a lexicographic order of characters based on their _____________.

1. Binary digits
2. Memory addresses
3. ASCII values
4. Random choice

Correct answer: ASCII values