CS301 Final Term Solved MCQs with References by Moaaz

Studocu is not sponsored or endorsed by any college or university

Cs301 final term mcqs solved with references by moaaz

vustudy

Object Oriented Programming (Virtual University of Pakistan)

Studocu is not sponsored or endorsed by any college or university

Cs301 final term mcqs solved with references by moaaz

vustudy

Object Oriented Programming (Virtual University of Pakistan)

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)