Queue

Question 1

A queue is structured in a…

Answer 1

FIFO(First in first out)

Question 2

What does the dequeue method do?

Answer 2

Removes data from the front of the queue

Question 3

What does the enqueue method do?

Answer 3

Adds a data item to the rear end of the queue

Question 4

What does first() operation do?

Answer 4

Returns the data item at the front of the queue without removing it

Question 5

What does the isEmpty method do?

Answer 5

Determines weather the queue is empty

Question 6

What does the size method do?

Answer 6

Returns a string representation of the queue

Question 7

What does the toString method do?

Answer 7

It returns a string representation of the queue

Question 8

What 3 things is needed to implement a queue?

Answer 8

1. A data structure to hold the data items
2. A way to indicate the front of the queue
3. A way to indicate the rear of the queue

Question 9

How do you implement a linked list implementation of a queue?

Answer 9

We need 2 pointers, front, rear, and one variable called count to store the number of data items

Question 10

What 2 cases are mostly considered when dealing with a linked list? Enqueue operation

Answer 10

1. The queue is empty
2. The queue is not empty

Question 11

What 3 cases are considered for the Dequeue operation in a linked list?

Answer 11

1. The queue is empty
2. the queue has one data item
3. The queue has more than 1 data item

Question 12

How would a queue be implemented using an array?

Answer 12

Using 2 variables: front = 0 and count = number of data items

Question 13

2 cases to consider using an array and the enqueue operation?

Answer 13

1. The array is full
2. The array is not full

Question 14

What 2 cases to consider for the dequeue Operation and using an array?

Answer 14

1. The queue is empty
2. The queue is not empty

Question 15

What do we need to keep track of when implementing a queue as a circular array?

Answer 15

We need to keep track of the front data item and the rear data item

Question 16

What must one take into account when using the enqueue operation in a circular array?

Answer 16

The value of the rear is incremented but it needs to loop back to index 0

Question 17

What line of code is used to loop back to the index 0

Answer 17

rear = (rear + 1) % queue.length

Question 18

What is a bounded queue?

Answer 18

a queue with a length that does not exceed a specified maximum value

Question 19

What is an unbounded queue?

Answer 19

is a queue with a length that can grow indefinitely

Question 20

True or False.
If the maximum length is negative it is bounded.

Answer 20

False. It is unbounded

Question 21

True or False.
If the maximum length is positive than it is unbounded.

Answer 21

False. It is bounded

Question 22

What are the advantages of a circular array?

Answer 22

We do not need to shift items when performing a dequeue operation.

Question 23

Last index in a circular array is

Answer 23

n - 1