CS301 Quiz 1 Set 3

Q1. isEmpty() method of stack class will return true when:

1. Stack is full
2. Stack is partially empty
3. Stack is not empty nor full
4. Stack is empty

Correct answer: Stack is empty

Q2. Consider we have performed the following operations on a stack of size 5. Push(10); Push(20); Push(30); Pop(); Pop(); Push(40); Push(50); Pop(); After the completion of all operations, the number of element present on stack are _____.

1. 4
2. 2
3. 3
4. 1

Correct answer: 2

Q3. The _______ method of list will position the currentNode and lastCurrentNode at the start of the list.

1. Back
2. Start
3. Next
4. Remove

Correct answer: Start

Q4. The expression DE+H* is called_______

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

Correct answer: Postfix expression

Q5. Head node pointer always points to the ______________ of the linked list?

1. newly added node
2. current node
3. first node
4. last node

Correct answer: first node

Q6. “set()” method of list class is used to:

1. Set the value of pointer
2. Set the value of Null Nodes
3. Set the value of lvalue
4. Set the value of object

Correct answer: Set the value of object

Q7. Which operation of queue data structure is used to get front element from the queue and then remove it from the queue?

1. enqueue()
2. dequeue()
3. remove()
4. front()

Correct answer: dequeue()

Q8. Consider the linked list implementation of a stack. Which of the following node is considered as Top of the stack?

1. Middle node
2. Any node
3. Last node
4. First node

Correct answer: First node

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

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

Correct answer: Next line

Q10. The next field in the last node in a singly-linked list is set to_______.

1. 1
2. false
3. NULL
4. 0

Correct answer: NULL