CS301 Midterm Past Papers Collection by Sweet Soul

Spring 2010

Q1. Which one of the following statement is NOT correct . (1 marks)

1. In linked list the elements are necessarily to be contiguous
2. In linked list the elements may locate at far positions in the memory
3. In linked list each element also has the next to it
4. In an array the elements are contiguous

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

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

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

Correct answer: Two

p67

Q3. Which one of the following calling methods does not change the original value of the argument in the calling function? (1 marks)

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

Q4. A tree is an AVL tree if (1 marks)

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

Q5. 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 marks)

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

Correct answer: currentNode = currentNode->nextNode;

Q6. A queue where the de-queue operation depends not on FIFO, is called a priority queue (1 marks)

1. False
2. True

Correct answer: True

p101

Q7. Which one is a self- referential data type? (1 marks)

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

Correct answer: Link list

Q8. Each node in doubly link list has, (1 marks)

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

Correct answer: 2 pointers

p39

Q9. 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 marks)

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

Correct answer: Only rear pointer changes.

Q10. Consider the following tree. (1 marks)

How many of the nodes have at least one sibling?

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

Correct answer: 5