Hackharbor 3.0 Day 3:C

What is the output of pop() when the stack is empty?

• -1

• Segmentation Fault

• "Stack Underflow"

• Garbage Value

If your crush was a queue, what would you be?

• Rear

• Front

• Stuck waiting

• Dequeued

Why reset front and rear to -1 after dequeue in a queue?

• To confuse beginners

• Free up memory

• Because queue is now empty

• Because that’s what seniors do

Which operation follows LIFO?

• enqueue

• dequeue

• push

• traverse

In circular queue, how to access the next position of rear?

• rear + 1

• (rear + 1) / MAX

• (rear + 1) % MAX

• rear++

When is the queue empty?

• front > rear

• rear == -1

• front == rear

• front == rear + 1

In a queue, which pointer moves forward when dequeue is called?

• rear

• top

• front

• NULL

What happens when you mix stack with drama?

• StackOverflow movie

• It gets pop-ular

• Overacted push

• Too much LIFO

What happens when you dequeue() from an empty queue?

• Segmentation fault

• Returns -1

• "Queue Underflow"

• Deletes nothing silently

Which statement about circular queue is FALSE?

• Circular queue solves the problem of unused space after dequeues

• Circular queue uses modulo arithmetic for indexing

• Circular queue cannot be implemented using arrays

• Circular queue allows wrap-around of rear pointer