Stack & Queue

What is the purpose of the Stack data structure?

• To store data in a sorted order

• To store data in a balanced manner

• To store data in a reverse order

• To store data in a random order

What does LIFO stand for in the context of the Stack data structure?

• First-in-last-out

• Last-in-last-out

• First-in-first-out

• Last-in-first-out

Which operation is used to add an element to a Stack?

• PUSH

• ISFULL

• POP

• PEEK

What does the PEEK function do in a Stack?

• Check if the stack is empty

• Check if the stack is full

• Remove the top data element

• Get the top data element without removing it

How is the top element accessed in a Stack?

• Using the top pointer

• Using the bottom pointer

• Using the left pointer

• Using the middle pointer

What is the process of accessing content while an element is being popped/deleted from the stack known as?

• Insert Operation

• Pop Operation

• Peek Operation

• Push Operation

In an array implementation of the pop() operation, what happens to the data element?

• It is duplicated

• It is decremented to a lower position

• It is removed

• It is shifted to the top

What is the essential difference between a stack and a queue?

• Stack is open at both ends, while Queue is closed

• Queue is open at both ends, while Stack is closed

• Stack follows First-In-First-Out, while Queue follows Last-In-First-Out

• Queue follows First-In-First-Out, while Stack follows Last-In-First-Out

What is the function that helps to view the data from the front of the queue without removing it?

• peek()

• isempty()

• isfull()

• enqueue()

What is the algorithm used to add an element to a queue?

• push()

• enqueue()

• pop()

• dequeue()