CS301 Quiz 1 Set 4

Q1. next() method of List class is used to:

1. Moves the “current” pointer to two steps after the last element of the array
2. Moves the current position backward one element
3. Moves the current position forward one element
4. Moves the “current” pointer to two steps before the last element of the array

Correct answer: Moves the current position forward one element

Q2. What is the postfix form of (A+B)*(C-D)

1. CD- A B + *
2. +A B - C D *
3. A +B*C- D
4. A B + C D – *

Correct answer: A B + C D – *

Q3. Which of the following is not a form of expression?

1. Pastfix
2. Prefix
3. Infix
4. Postfix

Correct answer: Pastfix

Q4. In singly linked list a node comprises of ___________ field/s.

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

Correct answer: Two

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

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

Correct answer: Generic data type

Q6. The expression DE+H* is called_______

1. Infix expression
2. Prefix expression
3. Postfix expression
4. Hybrid expression

Correct answer: Postfix expression

Q7. What will be postfix expression of the following infix expression? Infix Expression : a+b*c-d

1. abc+*d-
2. abc*+d-
3. ab+c*d-
4. abcd+*-

Correct answer: abc*+d-

Q8. Which of the following signature of the constructor function for a stack is correct as a generic data type?

1. Template<stack T>;
2. Stack:: Stack() ;
3. Template Stack::Stack ();
4. Stack<T> :: Stack() ;

Correct answer: Stack<T> :: Stack() ;

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

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

Correct answer: Move backward in the list

Q10. Linked List use _____________ to store data.

1. Variables
2. Array
3. Linked Memory
4. 2-D Array

Correct answer: Linked Memory