CS301 Midterm Solved Mega File with References

MID TERM MEGA FILE

Which one of the following statement is NOT correct .

1. In linked list the elements are necessarily to be contiguous

In linked list the elements may locate at far positions in the memory

1. In linked list each element also has the

next to it

1. In an array the elements are contiguous

Each operator in a postfix expression refers to the previous ________ operand(s).

1. One
2. Two
3. Three
4. Four

Correct answer: Two

Which one of the following calling methods does not change the original value of the argument in the calling function?

1. None of the given options
2. Call by passing the value of the argument
3. Call by passing reference of the argument
4. Call by passing the address of the argument

Correct answer: Call by passing the value of the argument

A tree is an AVL tree if

1. Any one node fulfills the AVL condition
2. At least half of the nodes fulfill the AVL condition
3. All the nodes fulfill the AVL condition
4. None of the given options

Correct answer: None of the given options

Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What statement changes currentNode so that it refers to the next node?

1. currentNode ++;
2. currentNode = nextNode;
3. currentNode += nextNode;
4. currentNode = currentNode->nextNode;

Correct answer: currentNode = currentNode->nextNode;

queue

1. False
2. True

Correct answer: True

Which one is a self- referential data type?

1. Stack
2. Queue
3. Link list
4. All of these

Correct answer: Link list

Each node in doubly link list has,

1. 1 pointer
2. 2 pointers
3. 3 pointers
4. 4 pointers

Correct answer: 2 pointers

I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?

1. Neither changes
2. Only front pointer changes.
3. Only rear pointer changes.
4. Both change.

Correct answer: Only rear pointer changes.

•  Consider the following tree.

How many of the nodes have at least one sibling?

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

Correct answer: 5

The nodes with no successor are called _________

1. Root Nodes
2. Leaf Nodes
3. Both of these
4. None of these
5. Non Linear data structure
6. Linear data structure
7. Hybrid data structure (Mixture of Linear and Non Linear)
8. None of the given options.
9. Linear way only
10. Non Linear way only
11. Both linear and non linear ways
12. None of the given options.

A binary search tree should have minimum of ________ node/s at each level,

1. One
2. Two
3. Three
4. Four

Correct answer: One

•  Consider the following statements.

(i) A binary tree can contain at least 2L Nodes at level L. (ii) A complete binary tree of depth d is a binary tree that contains 2L Nodes at each level L between 0 and d, both inclusive. (iii) The total number of nodes (Tn ) in a complete binary tree of depth d is 2 d+1 - 1 . (iv) The height of the complete binary tree can be written as h = log 2 (Tn+1)-1 where Tn is Total number of Nodes.

Which one of the following is correct in respect of the above statements regarding the Binary trees?

1. (i) and (iii) only
2. (i), (ii) and (iii) only
3. (ii) and (iii) only
4. (ii), (iii) and (iv) only

Correct answer: (ii), (iii) and (iv) only

“+” is a _________operator.

1. Unary
2. Binary
3. Ternary
4. None of the above

Correct answer: Binary

queue

1. False
2. True

Correct answer: True

The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should

1. Use better data structures
2. Increase the hard disk space
3. Use the better algorithm
4. Use as much data as we can store on the hard disk

Correct answer: Increase the hard disk space

 Consider the function X as under

int X (int& Value)

return Value;