DS Lab Quiz-2 EEE-A

Process of inserting an element in stack is called ____________

• Create

• Push

• Evaluation

• Pop

In a stack, if a user tries to remove an element from an empty stack it is called _________

• Underflow

• Empty collection

• Overflow

• Garbage Collection

Pushing an element into stack already having five elements and stack size of 5, then stack becomes ___________

• Overflow

• Crash

• Underflow

• User flow

Entries in a stack are “ordered”. What is the meaning of this statement?

• A collection of stacks is sortable

• Stack entries may be compared with the ‘<‘ operation
  

• The entries are stored in a linked list

• There is a Sequential entry that is one by one

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as _____________

• Queue

•  Stack

• Tree

• Linked list

A queue follows __________

• FIFO (First In First Out) principle

• LIFO (Last In First Out) principle

• Ordered array

• Linear tree

If the elements “A”, “B”, “C” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

• ABCD

• DCBA

• DCAB

• ABDC

A normal queue, if implemented using an array of size MAX_SIZE, gets full when?

• Rear = MAX_SIZE – 1

• Front = (rear + 1)mod MAX_SIZE

• Front = rear + 1

• Rear = front

Which of the following is not the type of queue?

• Ordinary queue

• Single ended queue

• Circular queue

• Priority queue

Circular Queue is ________ data structure.

• linear

• non-linear

• both linear and non-linear

• none