CS301 Midterm MCQs by Talha Sajid

Q1. Please choose one What is the maximum depth of recursive calls a function may make?

1. 1
2. 2
3. n (where n is the argument)
4. There is no fixed maximum.

Correct answer: There is no fixed maximum.

Q2. The difference between a binary tree and a binary search tree is that a binary search tree has?

1. two children per node whereas a binary tree can have none, one, or two children per node.
2. in binary search tree nodes are inserted based on the values they contain.
3. in binary tree nodes are inserted based on the values they contain.
4. none of these.

Correct answer: two children per node whereas a binary tree can have none, one, or two children per node.

Q3. Which of the following is NOT include in the definition of Data Structure?

1. Data Management
2. Data Organization
3. Data Storage Format
4. Data Security

Q4. A queue where the de-queue operation depends not on FIFO, is called a priority queue?

1. False
2. True

Correct answer: True

Q5. ______is special data type to store the same data type?

1. An Array
2. A List
3. A Program
4. A Function

Correct answer: An Array

Q6. The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should?

1. Use better data structures
2. Increase the hard disk space
3. Use the better algorithm
4. Use as much data as we can store on the hard disk

Correct answer: Increase the hard disk space

Q7. In an array list the current element is ?

1. The middle element ere
2. The first element
3. The last element
4. The element where the current pointer points to

Correct answer: The first element

Q8. Which of the following function used is to move the pointer at the last element of List Data Structure?

1. start()
2. tail ()
3. length ()
4. get ()

Correct answer: tail ()

Q9. Which of the following is not included in the data structure?

1. Space for each item
2. Time to perform
3. Programming effort
4. None of the above

Correct answer: None of the above

10. Consider the function X as under · int X (int& Value) · return Value; }

Now a and b are integers in a calling function. Which one of the following is a valid call to the above function X?

1. a=X (b);
2. a = X (&b);
3. a = X (*b);
4. None of the given options
5. Unary
6. Binary
7. Ternary
8. None of the above

Q12. In the call by value methodology, a copy of the object is passed to the called function?

1. False
2. True

Correct answer: True

Q13. Each node in doubly link list has?

1. 4 Pointer
2. 3 Pointer
3. 2 Pointer
4. 1 Pointer

Correct answer: 2 Pointer

Q14. The tree data structure is a?

1. Linear data structure