Data Structures Quiz

What is the main principle that stacks follow?

• Sequential Access

• Random Access

• Last In First Out (LIFO)

• First In First Out (FIFO)

Which operation adds an element to the top of a stack?

• PUSH

• INSERT

• POP

• PEEK

What does the ISEMT(S) operation do in a stack?

• Returns the top element

• Checks if the stack is empty

• Checks if the stack is full

• Removes the top element

In a stack, what does the TOP(S) operation return?

• The bottom element

• The top element

• The entire stack

• The middle element

Which procedure removes the top element from a stack?

• INSERT

• PEEK

• POP

• PUSH

What is the main principle that queues follow?

• Random Access

• Sequential Access

• Last In First Out (LIFO)

• First In First Out (FIFO)

Which operation adds an element to the rear of a queue?

• FRONT

• ADDQ

• DELETEQ

• ISEMTQ

What does the ISEMTQ(Q) operation do in a queue?

• Checks if the queue is full

• Checks if the queue is empty

• Returns the front element

• Removes the front element

In a queue, what does the FRONT(Q) operation return?

• The entire queue

• The front element

• The rear element

• The middle element

Which procedure removes the front element from a queue?

• FRONT

• ISEMTQ

• DELETEQ

• ADDQ