CS301 Midterm MCQs by VU Topper RM

Q1. Vu-Topper RM (1 marks)

Which one is the correct function call for the following function of calculating cube?

1. cube(num)
2. cube(*num)
3. cube(&num)
4. cube(&&num)

Correct answer: cube(num)

Q2. Vu-Topper RM (1 marks)

In a complete binary tree, for 25000 nodes the depth will be-----

A. 14

B. 13 C. 12 D. 11

Q3. Vu-Topper RM (1 marks)

In level-order traversal for Binary Search Tree, __________ data structure is used.

A. Queue

B. Stack C. Tree D. Heap

Q4. Vu-Topper RM (1 marks)

If both left and right nodes of a node are NULL then this type of node is called a ------node.

A. Leaf

B. Node C. Both D. None of these

Q5. Vu-Topper RM (1 marks)

For searching a particular number in Binary Search Tree (if it is not present), the maximum number of comparisons will be _______ comparison(s) at each level.

A. 1

B. 2 C. 3 D. 4

Q6. Vu-Topper RM (1 marks)

In a complete binary tree the number of nodes at level 5 are

A. 32

B. 30 C. 23 D. 40

Q7. Vu-Topper RM (1 marks)

While implementing non-recursive traversal for Binary Search Tree, we need to implement _________.

A. Stack

B. Tree C. Heap D. Pointer

Q8. Vu-Topper RM (1 marks)

------- is used for Reference variables in C++.

A. &

C. # D. *

Q9. Vu-Topper RM (1 marks)

Left, right, info, and parent are the operations of _________ data structure.

A. Tree

B. Heap C. Stack D. Pointer

Q10. Vu-Topper RM (1 marks)

If a function has recursive call as the last statement, it is known as ___. A. Local B. Last C. Function

D. Tail recursive

Q11. Vu-Topper RM (1 marks)

The abstract data type refers to the basic mathematical concept that defines the A. Variable B. Functions C. Pointer

D. Data type

Q12. Vu-Topper RM (1 marks)

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

A. Stack

B. Tree C. Heap D. Pointer