CS301 MCQ's For Final Term

Question # 1 of 10 ( Start time: 07:14:32 PM ) Total Marks: 1 The data type before a function name represents its, Select correct option: Return Type Function data Function arguments Function name

Question # 2 of 10 ( Start time: 07:15:49 PM ) Total Marks: 1 When we call a function, its control Select correct option:  http://allvupastpapers.blogspot.com.com transfers to its Prototype transfers to its definition returns to statement following function call The compiler stops execution of whole program

Question # 3 of 10 ( Start time: 07:16:37 PM ) Total Marks: 1 When an array of object is created dynamically then there is no way to provide parameterized constructors for array of objects. Select correct option: True False

Question # 4 of 10 ( Start time: 07:17:50 PM ) Total Marks: 1 Reference is not really an address it is ______________. Select correct option: a synonym an antonym a value a number

Question # 5 of 10 ( Start time: 07:18:22 PM ) Total Marks: 1 Which of the following concept is NOT associated with stream? Select correct option: Source Template Destination State

Question # 6 of 10 ( Start time: 07:18:57 PM ) Total Marks: 1 ___________ work more or less in the same way as macros Select correct option: Friend functions Inline functions User defined functions Built-in functions

Question # 7 of 10 ( Start time: 07:19:35 PM ) Total Marks: 1 To get the memory address of a variable we use ____ . Select correct option: & % * $

Question # 8 of 10 ( Start time: 07:20:05 PM ) Total Marks: 1 Class is a user defined___________.  http://allvupastpapers.blogspot.com.com Select correct option: data type memory reference value none of the given options.

Question # 9 of 10 ( Start time: 07:20:46 PM ) Total Marks: 1 The compiler generates __________________ automatically Select correct option: member functions classes objects of a class constructors

Question # 10 of 10 ( Start time: 07:21:14 PM ) Total Marks: 1 In_________, we try to have a precise problem statement Select correct option: Analysis Design Coding None of the given

Question # 1 of 10 ( Start time: 08:02:27 PM ) Total Marks: 1 From the following; which on is the correct syntax of an array declaration: array size is 5 and it is of float data type? Select correct option: float [5] name; name[5] float; float name[5]; None of the given options

Question # 4 of 10 ( Start time: 08:05:15 PM ) Total Marks: 1 In the case of pointer to pointer or _______________, the first pointer contains the address of the second pointer, which contains the address of the variable, which contains the desired value. Select correct option: double dereference Single dereference Dereference None of the given

Question # 5 of 10 ( Start time: 08:06:04 PM ) Total Marks: 1 A structure is a collection of _____________under a single name. Select correct option:  http://allvupastpapers.blogspot.com.com values variables data None of the given

Question # 6 of 10 ( Start time: 08:07:21 PM ) Total Marks: 1 The ws manipulator can be used with ______ stream(s). Select correct option: Output Input Input/Output None of the given options

Question # 7 of 10 ( Start time: 08:08:44 PM ) Total Marks: 1 Look at the program code and identify the error. 1 #include 2 #define PI 3.1415926; // Defining PI 3 main() { 4 int radius = 5; 5 cout << "Area of circle with radius " << radius << " = " << PI * radius * radius; } Select correct option: It will be compiled successfully and will not generate error It will be compiled and returns nothing Error exists in line number 2. Semi colon is not allowed with define directive The value of PI cannot be defined in the beginning

Question # 9 of 10 ( Start time: 08:10:51 PM ) Total Marks: 1 += , *= , /= , etc are called, Select correct option: Assignment operators Logical operator Compound assignment operator Unary operator

Question # 1 of 10 ( Start time: 04:17:56 PM ) Total Marks: 1 For the inorder traversal of threaded binary tree, we introduced a dummy node. The left pointer of the dummy node is pointing to the ________ node of the tree. Select correct option: left most root right most any of the given node

Quiz Start Time: 04:17 PM Time Left 81  sec(s)

Question # 2 of 10 ( Start time: 04:19:19 PM ) Total Marks: 1 When a complete binary tree, represented by an array then for any array element at position i, the parent is at position ______ . Select correct option: 2i-1 2i 2i+1 floor(i/2)

Quiz Start Time: 04:17 PM Time Left 85  sec(s)

Question # 3 of 10 ( Start time: 04:20:07 PM ) Total Marks: 1 In threaded binary tree the NULL pointers are replaced by the Select correct option: preorder successor or predecessor inorder successor or predecessor inorder successor or predecessor NULL pointers are not replaced

Quiz Start Time: 04:17 PM Time Left 85  sec(s)

Question # 4 of 10 ( Start time: 04:20:45 PM ) Total Marks: 1 Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,H,I,J,K,L Is it a strictly binary tree? Select correct option: Yes No

Quiz Start Time: 04:17 PM Time Left 87  sec(s)

Question # 5 of 10 ( Start time: 04:21:27 PM ) Total Marks: 1 We implement the heap by ______________ . Select correct option: Threaded Tree AVL tree Complete binary tree Expression

Quiz Start Time: 04:17 PM Time Left 86  sec(s)

Question # 6 of 10 ( Start time: 04:21:57 PM ) Total Marks: 1 A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its __________ successor Select correct option: http://allvupastpapers.blogspot.com.com Preorder Inorder Postorder levelorder

Quiz Start Time: 04:17 PM Time Left 86  sec(s)

Question # 7 of 10 ( Start time: 04:22:33 PM ) Total Marks: 1 See the below code and fill the appropriate answer for? void fastInorder(TreeNode* p) { while((p=nexInorder(p)) != ? ) cout << p->getInfo(); } Select correct option: dummy rootNode LTH RTH

Quiz Start Time: 04:17 PM Time Left 86  sec(s)

Question # 8 of 10 ( Start time: 04:23:37 PM ) Total Marks: 1 In which of the following tree, parent node has key greater than or equal to its both children? Select correct option: Max heap Binary search tree Threaded Binary tree Complete Binary tree

Quiz Start Time: 04:17 PM Time Left 86  sec(s)

Question # 9 of 10 ( Start time: 04:24:18 PM ) Total Marks: 1 Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I Is it a strictly binary tree ? Select correct option: Yes No

Quiz Start Time: 04:17 PM Time Left 50  sec(s)

Question # 10 of 10 ( Start time: 04:24:42 PM ) Total Marks: 1 When a complete binary tree, represented by an array then for any array element at position i, the right child is at position ______ . Select correct option: 2i-1 2i 2i+1 floor(i/2)

By : ADEEL ABBAS 

www.allvupastpapers.blogspot.com 

AdeelAbbasbk@gmail.com