CS301 Quiz 1

Q1. NULL is an invalid address and _________.

1. Accessible
2. Points to the last current node of the list
3. Points to the start point of the list
4. Inaccessible

Correct answer: Inaccessible

Q2. In the statement template <T>, T represents___________.

1. Integer data type
2. Character data type
3. String data type
4. Generic data type

Correct answer: Generic data type

Q3. If we use singly linked list to implement list, then there is an issue that it gives difficulty when we:

1. We will increase its size
2. Move forward in the list
3. Move backward in the list
4. We will decrease its size

Correct answer: Move backward in the list

Q4. _______ is the major factor to see the efficiency of a program.

1. Code
2. Correctness
3. Time
4. Quality

Correct answer: Time

Q5. “end()” method of list performs it’s tasks in

1. Three steps
2. Two steps
3. Many steps
4. One steps

Correct answer: One steps

Q6. Local variables of a function are stored in,

1. Binary Search Tree
2. Stack
3. Queue
4. AVL Tree

Correct answer: Stack

Q7. At the time while evaluating an expression, if we want to give higher precedence to lower precedence operator, we used ___________.

1. Comas
2. Operands
3. Dots
4. Parenthesis

Correct answer: Parenthesis

Q8. The first step to add a node in a linked list between the existing nodes is

1. newNode->getNext();
2. newNode->setNext();
3. currentNode->getNext();
4. newNode->setNext(currentNode->getNext());

Correct answer: newNode->setNext(currentNode->getNext());

Q9. In the calling function, after the execution of the function called, the program continues its execution from the _______after the function call.

1. Next line
2. Previous line
3. Beginning
4. End

Correct answer: Next line

Q10. Array cells are _________ in computer memory.

1. Store in multiple variables
2. Contiguous
3. Store in multiple functions
4. Random

Correct answer: Contiguous