Exam 5: Linked Lists

In all circular linked lists,______.

Each node in a linear linked list references both its predecessor and its successor.

What information is stored in a reference to an object?

According to the principle of information hiding,the data fields of a class must be declared as ______.

The ADT list can have an arbitrary length.

If a linked list is empty,the statement head.getNext()will throw a(n)______.

In the following code segment: final int SIZE = 20;// line 1 Int groupSize;// line 2 GroupSize = SIZE;// line 3 GroupSize = groupSize * 2;// line 4 What is the value of groupSize in line 2?

Name two advantages of implementing the ADT list as an array instead of using a linked list (reference based).

In Java,when is an object marked for garbage collection?

What is a dummy head node?

Which of the following exceptions can be thrown if an object cannot be instantiated?

What is the difference between a linear linked list and a circular linked list?

Which of the following is true about all doubly linked lists?

If the implementation of a linked list maintains information about only one node,the head of the list,how is it able to be a collection of more than one node? In other words,how can we have a linked list of 20 nodes,if the list implementation only stores information about the head node?

A dummy head node ______.

Which of the following statements deletes the first node of a linear linked list that has 10 nodes?

Which of the following CANNOT be used in a linear linked list?

A ______ can be used to store global information about a linked list.

Which of the following statements deletes the node that curr references?

A ______ allows the deletion of a node from a linked list without the need to traverse the list to establish a trailing reference.