1.4.2 Data structures - Queues

Question 1

Define a queue

Answer 1

1. FIFO data structure
2. items added to end of queue
3. items removed from front of queue

Question 2

Define an abstract data type

Answer 2

A logical description of how we view the data and possible operations

Question 3

Four operations of queues

Answer 3

1. add item to rear of queue
2. remove item from front of queue
3. check if queue is empty
4. check if queue is full

Question 4

Pointers in queues

Answer 4

1. back/tail pointer always points to last item
2. front/head pointer always points to first item

Question 5

Define a queue overflow

Answer 5

An attempt to enqueue an item in a full queue

Question 6

Define a queue underflow

Answer 6

Trying to dequeue an item from an empty queue

Question 7

Function of enQueue(item)

Answer 7

Adds an item to the rear

Question 8

Function of deQueue

Answer 8

Remove and return an item from the front

Question 9

Function of isEmpty

Answer 9

1. indicates if the queue is empty
2. returns true or false

Question 10

Function of isFull

Answer 10

1. indicates if the queue is full
2. returns true or false

Question 11

Define a circular queue

Answer 11

Cycles the back pointer to the front of the array when it reaches the end