Stacks And Queues

Question 1

A process used in stack and queue processing a copy of the top or front value is acquired, without removing that item.

Answer 1

Peek

Question 2

A process used in stack and queue processing where a copy of the top or front value is acquired, and then removed from the stack or queue.

Answer 2

Pop

Question 3

A process used in stack and queue processing where a new value is inserted onto the top of the stack OR into the back of the queue.

Answer 3

Push

Question 4

In computer science, this is an abstract data type that is LIFO and serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the last element that was added.

Answer 4

Stack

Question 5

A FIFO data structure where the first element added will be the first one to be removed, and where a new element is added to the back, much like a waiting line.

Answer 5

Queue