Deck 17: Stacks and Queues

Question 1

What is a LIFO data structure?

Answer 1

A Last In First Out (LIFO) data structure is a data structure in which the item that is added last will be removed first.

Question 2

The addition and deletion of elements in a stack only occur at one end, called the ____________________ of the stack.

Answer 2

top

Question 3

A stack element can be accessed either at the top or the bottom of the stack.

Answer 3

False

Question 4

The ____________________ operation of a stack removes and stores the top element of the stack.

Question 5

Which stack function is a private member of the class?

Question 6

What is the position of the top element of a stack in an array-based implementation?

Question 7

Removing an element from an empty stack results in ____________________.

Question 8

In a linked implementation of a stack, the stack is only full if computer memory runs out.

Question 9

A(n) ____________________ is a system in which a queue of objects is waiting to be served by various servers.

Question 10

A(n) ____________________ array can be used in an array implementation of a queue to avoid an overflow error at the rear of the queue when the queue is not full.

Question 11

What does these terms refer to:

- $\gg$ addQueue:

Question 12

What does these terms refer to:

- $\gg$ Back (rear):

Question 13

What does these terms refer to:

- $\gg$ Customer:

Question 14

What does these terms refer to:

- $\gg$ deleteQueue:

Question 15

What does these terms refer to:

- $\gg$ destroyStack:

Question 16

What does these terms refer to:

- $\gg$ Front:

Question 17

What does these terms refer to:

- $\gg$ Infix notation:

Question 18

What does these terms refer to:

- $\gg$ Last In First Out (LIFO) data structure:

Question 19

What does these terms refer to:

- $\gg$ Overflow:

Question 20

What does these terms refer to:

- $\gg$ pop:

Question 21

What does these terms refer to:

- $\gg$ Prefix (Polish notation):

Question 22

What does these terms refer to:

- $\gg$ push:

Question 23

What does these terms refer to:

- $\gg$ Queue:

Question 24

What does these terms refer to:

- $\gg$ queueFront:

Question 25

What does these terms refer to:

- $\gg$ queueRear:

Question 26

What does these terms refer to:

- $\gg$ Queuing systems:

Question 27

What does these terms refer to:

- $\gg$ Server:

Question 28

What does these terms refer to:

- $\gg$ Simulation:

Question 29

What does these terms refer to:

- $\gg$ Stack:

Question 30

What does these terms refer to:

- $\gg$ Postfix (Reverse Polish) notation:

Question 31

What does these terms refer to:

- $\gg$ Time-driven simulation:

Question 32

What does these terms refer to:

- $\gg$ Top:

Question 33

What does these terms refer to:

- $\gg$ Transaction time:

Question 34

What does these terms refer to:

- $\gg$ Underflow: