CS301 Midterm Solved MCQs Updated by Mickey Ch

Q NO 01:

Inarraylisttheworstcaseofremovinganelementis

A. Toremoveanelementfromtheendofthelist B. Toremoveanelementfromthemiddleofthelist

C. Toremoveanelementfromthestartofthelist

D. Wecannotremoveelementfromanarraylist Q NO 02: Whenanexecutableprogramrun,itisloadedinthememoryand becomesa_______. A. Thread B. .hfile

C. Process

D. Noneoftheabove

Q NO 03:

“+”isa_________operator. A. Unary

B. Binary

C. Ternary D. Noneoftheabove

Q NO 04:

The first statement in the given code is called as:

A. Binary Declaration B. Pre Class Declaration

C. Forward Declaration

D. Post Class Declaration

Q NO 05:

In level-order traversal for Binary Search Tree, data structure is used.

A. Queue

B. Stack C. Tree D. Heap

Q NO 06:

When a function calls another function, the parameters and return address of the calling function are put in

A. Stack

B. Tree C. Heap D. Pointer

Q NO 07:

In the perspective of memory organization each process is divided into

sections. A. 2

B. 4

C. 6 D. 8

Q NO 08:

To create a reference variable we need to use

sign.

A. Ampersand

B. Dollar C. Asterisk D. sigma

Q NO 09:

Whenever a node is deleted from a binary search tree, has to be maintained.

A. In Order Traversal

B. Any Traversal can be maintained C. Post order Traversal D. Pre order Traversal

Q NO 10:

The

sign before the name of the variable means that the address of the variable is beingpassed : A. || B. ::

C. &

D. #

Q NO 11:

If we return the reference of a local variable from a function it will cause :

A. Refrence Overloading B. Duplication of local variables C. Deletion of local variables from memory

D. Dangling refrence

Q NO 13:

In Preorder traversal of a binary tree the second step is____. A. Traverse the right subtree B. Traverse the root C. Traverse the leaf nodes

D. Traverse the left subtree

Q NO 14:

parameter passing (by value or by reference) is similar to PASCAL.

A. C++

B. COBOL C. JAVA D. FORTRAN

Q NO 15: · Function signatures are also called : · A. Function Prototype

B. Function Overloading C. Function Defination D. Function Overriding

Q NO 16:

In a complete binary tree the number of nodes at level 5 are

A. 32

B. 30 C. 23 D. 40

Q NO 17:

The abstract data type refers to the basic mathematical concept that defines the

A. Variable B. Functions C. Pointer

D. Data type

Q NO 18:

If we return the reference of a local variable from a function it will cause:

A. Dangling reference

B. reference overloading C. duplication of local variable D. deletion of local variable from memory

Q NO 19:

Which data structure is needed to convert infix expression to postfix expression?

1. Tree
2. Stack
3. Heap
4. Pointer

Correct answer: Stack

Q NO 20:

For making Binary Search Tree for Strings we need, data type.

A. Int

B. Char C. Float D. Double

Q NO 21:

Consider the following push operations of a Stack:

A. Stack.push(4); B. Stack.push(6); C. Stack.push(5);

D. Stack.push(8);

Q NO 22:

If there is a strictly complete binary tree of depth 3, the total number of nodes in it will be?

1. 2K
2. 0k
3. 1k
4. 3k

Correct answer: 2K

Q NO 23:

Suppose we have a value for Queue: 2 1 4 6 3Where front is at 2 and rear is at 3, after dequeue one element from that Queue, what will be the resultant Queue?

1. 2146
2. 2141
3. 4621
4. 2147

Correct answer: 2146

Q NO 24:

Each operator in a postfix expression refers to the previous

operand(s).

A. Two

B. Three C. Four D. Five

Q NO 25:

If numbers 5, 222, 4, 48 are inserted in a queue, which one will be removed first?

1. 5
2. 6
3. 7
4. 8

Correct answer: 5

Q NO 26: · The · A. *

C. &