Exam 14: An Introduction to Data Structures

In an empty list, head is null.

We can only have a sorted linked list of basic data types.

If we know in advance the maximum number of items we will have in a queue, then we can use an array to represent the queue.

In a linked list representing a queue, what extra instance variable is desirable to have and why?

Unlike a linked list, an array has a fixed size, so the array could be completely filled with elements of the stack.

In a stack represented by a linked list, we push at the beginning of the list.

When we attempt to delete an item from a list but it is not on the list, the method returns void.

Consider a queue represented by an array of 10 elements and front and back, the two instance variables representing the indexes of the front and the back of the queue, respectively. If the value of front is 8 and the value of back is 7, what can you tell about the queue?

If we know in advance the maximum number of items we will have in a stack, then we can use an array to represent the stack.

Assuming a linked list is properly coded, attempting to delete from an empty list should not result in a NullPointerException.

When we delete the first node in a list, we always set head to null.

A queue is never empty.

What is the instance variable representing a reference to the first node in the linked-list class called?

In a queue represented by a linked list, we delete, or dequeue, based on the value of the item stored in a node.

In a sorted linked list, we insert in such a way that the list is still sorted after the insertion.

In a LIFO approach, the push method is used to delete the last item inserted.

Evaluate what is wrong with the following code, and recommend an alternative code. while ( current.getData( ) != value && current != null )

If the linked list is empty, deleting an item in a linked list representing a queue would result in a NullPointerException at run time.

A stack is never empty.

In a stack represented by a linked list, we delete based on the value of the item stored in a node.