Queue Data Structure

A queue is a first in first out data structure?

• True

• False

A queue is a last in first out data structure?

• True

• False

Queue is...

• FIFA

• FIFO

• FILO

• LIFO

In a Queue Data Structure...

• New elements may only be added to the end of the queue

• Elements may only be retrieved from the front of the queue.

• Elements may only be retrieved from the end of the queue.

• New elements may only be added to the front of the queue

Select ALL the situations that a Queue data structure would be used?

• Printer in a room full of computers

• Characters typed on a keyboard

• Back Button

• Undo Button

Which is the correct operation for:

"Add a item to the rear of the queue."

• enQueue(item)

• Append.Queue(item)

• enQueue()

• AddItem(EnQueue())

Which is the correct operation for:

"Remove the front item from the queue and return it"

• dQueue()

• de.Queue(Item)

• deQueue()

• item.remove()

• Cant be performed on a Queue Data Structure.

Which is the correct operation for:

"Remove the rear item from the queue and return it"

• dQueue()

• de.Queue(Item)

• deQueue()

• item.remove()

• Cant be performed on a Queue Data Structure.

Which is the correct operation for:

"Add a item to the front of the queue."

• enQueue(item)

• Append.Queue(item)

• enQueue()

• AddItem(EnQueue())

• Cant be performed on a Queue.

Select operations that can be performed on a Queue Data Structure...

• isEmpty()

• pop()

• push()

• isFull()

• Append(Item)