CS301 Midterm Solved MCQs with References by Farhan

Paper # 1

Today MIDTERM EXAMINATION

Spring 2011 CS301Data Structures

Q1. Which one of the following calling methods does not change the original value of the argument in the calling function? (1 marks)

 Call by passing the value of the argument

 Call by passing reference of the argument  Call by passing the address of the argument

Q2. Which one is a self- referential data type? (1 marks)

 Stack

 Queue

 Link list

Q3. AVL Tree is, (1 marks)

 Non Linear data structure

 Linear data structure

 Hybrid data structure (Mixture of Linear and Non Linear)

Q4. We access elements in AVL Tree in, (1 marks)

 Ternary

Q7. The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should (1 marks)

 Use better data structures

 Increase the hard disk space

 Use the better algorithm  Use as much data as we can store on the hard disk

Q8. What is the maximum depth of recursive calls a function may make? (1 marks)

 1

 2

 n (where n is the argument)

 There is no fixed maximum

Q9. Suppose n is the number of nodes in a complete Binary Tree then maximum steps required for a search operation are, (1 marks)

 Log2 (n+1) -1