Chapter 2

Question 1

are linear data structures that follow a particular order to add or remove entities.

Answer 1

Stacksandqueues

Question 2

is an Abstract Data Type (ADT)

Answer 2

stack

Question 3

Pushing (storing) an element on the stack.

Answer 3

Push()

Question 4

Removing (accessing) an element from the stack. When data is PUSHed onto stack.

Answer 4

pop()

Question 5

get the top data element of the stack, without removing it.

Answer 5

Peek()

Question 6

check if stack is full.

Answer 6

isFull()

Question 7

check if stack is empty.

Answer 7

isEmpty()

Question 8

The process of putting a new data element onto stack is known as a

Answer 8

Push Operation

Question 9

Accessing the content while removing it from the stack, is known as a

Answer 9

Pop Operation

Question 10

A queue is a lot like a stack.

Question 11

are open from both ends: one end for inserting data, and the other end for removing data

Answer 11

Queues

Question 12

is only open from one end.

Answer 12

stack

Question 13

add (store) an item to the queue.

Answer 13

enqueue()

Question 14

remove (access) an item from the queue.

Answer 14

dequeue()

Question 15

provides top value of the stack without actually removing it.

Answer 15

top