Lesson 2.4: Queues Flashcards
1
Q
is simply a waiting line that grows by adding elements to its end and shrinks by taking elements from its front.
A
Queue
2
Q
FIFO
A
First In, First Out
3
Q
It is a linear structure that follows a particular order in which the operations are performed.
A
Queue
4
Q
A Queue data structure follows a LILO structure: Last in, last out. True or False?
A
True
5
Q
Clear the queue.
A
clear()
6
Q
Check to see if the queue is empty.
A
isEmpty()
7
Q
Put the element el at the end of the queue.
A
enqueue(el)
8
Q
Take the first element from the queue.
A
dequeue()
9
Q
Return the first element in the queue without removing it. Sometimes, this method is called front().
A
firstEl()
10
Q
is basically add to tail from the linked list
A
enqueue(el)
