Suppose you push integer elements 1,2,3,4 onto a stack in that order. Then pop an element off the stack and add that element to a queue. You repeat that process three more times. In what order will you remove the elements from the queue?
A) 1,2,3,4
B) 1,2,4,3
C) 4,3,2,1
D) 4,3,1,2

Question

Quizplus · Accepted Answer

Stacks operate on a Last In, First Out (LIFO) principle, so the elements are popped in reverse order (4, 3, 2, 1) and then enqueued. Queues operate on a First In, First Out (FIFO) principle, so they are removed in the order they were enqueued.

Suppose You Push Integer Elements 1,2,3,4 onto a Stack in That