Understanding Stacks and Queues in C

What does a stack data structure follow as its fundamental principle?

• First In First Out (FIFO)

• Last In First Out (LIFO)

• Random Access Order

• Priority Based Order

Which operation is used to add an element to the top of a stack?

• Enqueue

• Insert

• Push

• Append

What is the term used to remove an element from the top of a stack?

• Dequeue

• Pop

• Delete

• Remove

Which principle does a queue data structure follow?

• Last In First Out (LIFO)

• Random Access Order

• First In First Out (FIFO)

• Highest Priority First

What is the operation called when an element is added to the rear of a queue?

• Push

• Insert

• Enqueue

• Append

What is the operation called when an element is removed from the front of a queue?

• Pop

• Dequeue

• Delete

• Extract

In C, which of the following correctly declares an array-based stack of integers with a maximum size of 100?

• `int stack[100];`

• `stack int[100];`

• `int stack(100);`

• `array stack[100];`

What condition is checked to determine if a stack is empty when implemented using an array in C?

• `top == MAX`

• `top == 1`

• `top == -1`

• `top == 0`

Which of the following is a common application of stacks?

• CPU Scheduling

• Evaluating arithmetic expressions

• Breadth First Search

• Printer spooling

Which of the following is a common application of queues?

• Undo/Redo operations in text editors

• Balancing parentheses

• Function call management

• CPU scheduling