Exam 14: An Introduction to Data Structures

In a queue represented by an array, how do we tell if the queue is empty or full?

A doubly linked list provides two links between nodes, one forward and one backward.

A queue uses:

In a queue represented by a linked list, we insert, or enqueue, at the beginning of the list.

When implementing a queue as an array, you can think of it as a circular array.

When coding a method of a recursively defined linked list, not testing for all base case scenarios could result in a(n) __________ at runtime.

In a queue represented by a linked list, we delete, or dequeue, at the end of the list.

Ivanna has a restaurant that prides itself in fresh produce. She always wants to serve the freshest produce she has. She should use a LIFO approach for her produce inventory.

Unless we run out of memory, we can always insert in a linked list.