Understanding Stacks and Queues

What is the initial value of `toppointer` in the stack implementation?

• 0

• -1

• 1

• 10

What happens when you try to push an item onto a full stack?

• The item is added to the stack

• The stack is cleared

• A message "Stack is full, cannot push" is printed

• The stack size is increased

After executing the sequence of operations `push(10)`, `push(20)`, `push(30)`, `pop()`, `push(40)`, what is the value at `stack[2]`?

• 10

• 20

• 30

• 40

What is the initial value of `rearPointer` in the queue implementation?

• 0

• -1

• 1

• 10

What is the purpose of the `pop()` function in the stack implementation?

• To add an item to the stack

• To remove the top item from the stack

• To check if the stack is full

• To clear the stack

What is the condition to check if the stack is empty in the `pop()` function?

• `toppointer == 0`

• `toppointer == -1`

• `toppointer == len(stack)`

• `toppointer == 10`

What is the initial value of `frontPointer` in the queue implementation?

• 0

• -1

• 1

• 10

What happens when you try to dequeue an item from an empty queue?

• The item is removed from the queue

• The queue is cleared

• A message "Queue is empty, cannot dequeue" is printed

• The queue size is increased

What is the condition to check if the queue is full in the `enqueue()` function?

• `rearPointer + 1 < queueFull`

• `rearPointer == queueFull`

• `rearPointer == -1`

• `rearPointer == 0`

What is the purpose of the `enqueue()` function in the queue implementation?

• To remove an item from the queue

• To add an item to the queue

• To check if the queue is empty

• To clear the queue