Quiz

1.	What is a queue linked list?
2.	How does a queue linked list differ from an array queue?
3.	What is the benefit of using a queue linked list?
4.	Where are new nodes added to the queue?
5.	Which node is removed from the queue when the dequeue() member method is called?
6.	Can a node on a queue linked list have more than one data element?
7.	What form of access is used to add and remove nodes from a queue?
8.	Why is the constructor of the QueueLinkedList class empty?
9.	Why does the QueueLinkedList class inherit the LinkedList class?
10.	What happens when dequeue() is called?

Answers

1.	A queue linked list is a data structure that organizes data similar to a line in the supermarket , where the first one in line is the first one out.
2.	The size of a queue linked list can change during runtime. The size of an array queue is set at compile time and cannot change at runtime.
3.	A queue linked list can expand and shrink in size when an application runs, depending on the needs of the application.
4.	New nodes are added to the back of the queue.
5.	The node at the front of the queue is removed when the dequeue() member method is called.
6.	Yes, a node on a queue linked list can have more than one data element if you redefine the node structure to accommodate additional data.
7.	First in, first out is the method used to access nodes on a queue.
8.	The constructor of the QueueLinkedList class is empty because initialization of data members of the LinkedList class is performed by the constructor of the LinkedList class. The constructor of the LinkedList class is called before the constructor of the QueueLinkedList class is called.
9.	The QueueLinkedList class inherits the LinkedList class because the LinkedList class contains data members and function members that are necessary to manage the linked list that is used for the queue.
10.	When dequeue() is called, the value of the data member of the node at the front of the queue is returned to the statement that called the dequeue() member function. The front node is then deleted from memory and the next node on the queue is designated the front of the queue.