CS301 Final Term Solved MCQS Mega File By Moaz

CS301 Final Term Solved Mcqs:

Question No: 1 ( Marks: 1 ) - Please choose one A solution is said to be efficient if it solves the problem within its resource constraints i.e. hardware and time. ► True (Page 4) ► False Question No: 2 ( Marks: 1 ) - Please choose one Which one of the following is known as "Last-In, First-Out" or LIFO Data Structure? ► Linked List ► Stack (Page 54) ► Queue ► Tree Question No: 3 ( Marks: 1 ) - Please choose one What will be postfix expression of the following infix expression? Infix Expression : a+b*c-d ► ab+c*d- ► abc*+d- ► abc+*d- ► abcd+*- Question No: 4 ( Marks: 1 ) - Please choose one For compiler a postfix expression is easier to evaluate than infix expression? ► True Click here for detail ► False Question No: 5 ( Marks: 1 ) - Please choose one Consider the following pseudo code 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"? ► selpa ► selppa ► apples ► aaappppplleess

Question No: 6 ( Marks: 1 ) - Please choose one Consider the following function: void test_a(int n) { cout << n << " "; if (n>0) test_a(n-2); } What is printed by the call test_a(4)? ► 4 2 ► 0 2 4 ► 0 2 ► 2 4 Question No: 7 ( Marks: 1 ) - Please choose one If there are N external nodes in a binary tree then what will be the no. of internal nodes in this binary tree? ► N -1 (Page 304) ► N+1 ► N+2 ► N Question No: 8 ( Marks: 1 ) - Please choose one If there are N internal nodes in a binary tree then what will be the no. of external nodes in this binary tree? ► N -1 ► N ► N +1 (Page 303) ► N +2

Question No: 9 ( Marks: 1 ) - Please choose one If we have 1000 sets each containing a single different person. Which of the following relation will be true on each set: ► Reflexive (page 387) ► Symmetric ► Transitive ► Associative Question No: 10 ( Marks: 1 ) - Please choose one Which one of the following is NOT the property of equivalence relation: ► Reflexive ► Symmetric ► Transitive ► Associative (page 387) Download Complete Cs301 Final Term MCQS Mega File

https://drive.google.com/open?id=1oCB3anVzCj948aLZjjl62cq5gH3kC8wi