DS-MCQ-UNIT-2

Which of the following is/are correct related to Peek operation of a stack

• Return top element
• Remove top element
• Insert element at the top
• None of the above

Act of adding values into a stack is called

• Popping
• Polling
• Pushing
• None

Stack is

• FIFO
• LIFO
• LILO
• NONE OF THE ABOVE

Stack Overflow Condition

• TOP = MAX
• TOP = MAX - 1
• TOP = 0
• TOP = -1

In linked list implementation of a queue, where does a new element be inserted?

• At the head of link list

• At the centre position in the link list

• At the tail of the link list

• None of the mentioned

In linked list implementation of a queue, the important condition for a queue to be empty is?

• FRONT is null

• REAR is null

• LINK is empty

• None of the mentioned

What is the reason for using a "circular queue" instead of a regular one?

• running time of enqueue() is improved

• reuse empty spaces

• you can traverse all the elements more efficiently

• none of the above

The essential condition which is checked before insertion in a linked queue is?

• Underflow

• Overflow

• Front value

• Rear value

One difference between a queue and a stack is:

• Queues require linked lists, but stacks do not

• Stacks require linked lists, but queues do not

• Queues use two ends of the structure stacks use only one

• Stacks use two ends of the structure,queues use only one.

In linked list implementation of a queue, the important condition for a queue to be empty is?

• FRONT is null

• REAR is null

• LINK is empty

• None of the mentioned