CS301 Final Term Past Papers Set 2 by VUBuddy

CS301- Data Structures · LATEST SOLVED MCQS FROM FINALTERM PAPERS · JAN 30,2011 · PSMD01 · Spring 2010

Q1. A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time. (1 marks)

1. True (Page 4)
2. False

Correct answer: True (Page 4)

Q2. Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure? (1 marks)

1. Linked List
2. Stack (Page 54)
3. Queue
4. Tree

Correct answer: Stack (Page 54)

Q3. What will be postfix expression of the following infix expression? (1 marks)

Infix Expression : a+b*c-d

1. ab+c*d-
2. abc*+d-
3. abc+*d-
4. abcd+*-

Correct answer: abc*+d-

Q4. For compiler a postfix expression is easier to evaluate than infix expression? (1 marks)

1. False

Q5. Consider the following pseudo code (1 marks)

declare a stack of characters while ( there are more characters in the word to read ) read a character push the character on the stack

while ( the stack is not empty )

pop a character off the stack write the character to the screen

What is written to the screen for the input "apples"?

1. selpa
2. selppa
3. apples
4. aaappppplleess

Correct answer: selppa

Q6. Consider the following function: (1 marks)

void test_a(int n)

cout << n << " "; if (n>0) test_a(n-2);

What is printed by the call test_a(4)?

1. 4 2
2. 0 2 4
3. 0 2
4. 2 4

Correct answer: 4 2

Q7. If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree? (1 marks)

1. N -1 (Page 304)
2. N+1
3. N+2
4. N

Correct answer: N -1 (Page 304)

Q8. If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree? (1 marks)

1. N -1
2. N
3. N +1 (Page 303)
4. N +2

Correct answer: N +1 (Page 303)

Q9. If we have 1000 sets each containing a single different person. Which of the following relation will be true on each set: (1 marks)

1. Reflexive (page 387)
2. Symmetric
3. Transitive
4. Associative

Correct answer: Reflexive (page 387)

Q10. Which one of the following is NOT the property of equivalence relation: (1 marks)

1. Reflexive
2. Symmetric
3. Transitive
4. Associative (page 387)

Correct answer: Associative (page 387)

Q11. A binary tree of N nodes has _______. (1 marks)

1. Log10 N levels
2. Log2 N levels (Page 212)
3. N / 2 levels
4. N x 2 levels

Correct answer: Log2 N levels (Page 212)

Q12. The easiest case of deleting a node from BST is the case in which the node to be deleted ___________. (1 marks)

1. Is a leaf node (Page 173)
2. Has left subtree only
3. Has right subtree only
4. Has both left and right subtree

Correct answer: Is a leaf node (Page 173)

Q13. If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is _______ . (1 marks)

1. N
2. N2
3. Nlog2N
4. log2N (page 440)

Correct answer: log2N (page 440)

Q14. Merge sort and quick sort both fall into the same category of sorting algorithms. What is this category? (1 marks)

1. O(nlogn) sorts
2. Interchange sort (not sure)
3. Average time is quadratic
4. None of the given options. (Page 488)

Correct answer: None of the given options. (Page 488)