Question: The list with no node is called?

• 1. No list
• 2. Zero list
• 3. Empty list
• 4. All of the above

Question: Items in linked list are called?

• 1. Information
• 2. Element
• 3. Data
• 4. Node

Question: Pushing an element into stack already having four elements and stack size of 4. Then stack becomes?

• 1. Empty stack
• 2. Empty collection
• 3. Underflow
• 4. Overflow

Question: Stack is?

• 1. Continuously Changing Object
• 2. Dynamic Data Structure
• 3. An Ordered Collection of Items
• 4. All of the above

Question: In a stack if a user tries to remove an element from empty stack it is called?

• 1. Overflow
• 2. Underflow
• 3. Empty stack
• 4. Empty collection

Question: Which operation can perform with stack?

• 1. POP
• 2. Peek
• 3. Push
• 4. All of the above

Question: Process of removing an element from stack is called?

• 1. Create
• 2. Pop
• 3. Evaluation
• 4. Push

Question: Stack follows the manner?

• 1. FCLS
• 2. FIFO
• 3. LIFO
• 4. Both LIFO and FIFO

Question: Process of inserting an element in stack is called?

• 1. Create
• 2. Evaluation
• 3. Push
• 4. Pop

Question: Complexity of linear search algorithm is?

• 1. O(log n)
• 2. O(n)
• 3. O(n log n)
• 4. None of the above