1. (TCO 2) In a linked list, every node contains a(n) _____. (Points : 3)
reference to the next node in the list
reference to the last node of the list
reference to the first node of the list
array

2. (TCO 2) A _____ can always be traversed in the backward direction. (Points : 3)
linked list
doubly linked list
linked list with a header dummy node
linked list with a trailer node

3. (TCO 2) A doubly linked list can be traversed in the _____ direction(s). (Points : 3)
forward
backward
forward and backward
circular

4. (TCO 2) In each node of a circular linked list, we use _____. (Points : 3)
a next field
the null value
a previous field
a next field and a previous field

5. (TCO 2) The following class framework corresponds to the class _____.

public class ClassName
{
private Node first;

public ClassName(){…}

public boolean isEmpty(){…}

public void display(){…}

public void add(int i){…}

public void remove(int x){…}
} (Points : 3)
node
arrayBag
arrayList
linkedList

6. (TCO 2) Which linked list operation does the operation method below define?

public void operation()
{
Node current = first.getNext();

while (current != null)
{
System.out.print(current.getInfo() + ” “);
current = current.getNext();
}

System.out.println();
} (Points : 3)
It initializes the linked list.
It determines if the list is empty.
It inserts an element in the linked list.
It displays the list elements.

7. (TCO 2) Which linked list operation does the operation method below define?

public void operation(int item)
{
Node newListNode = new Node();

newListNode.setInfo(item);
newListNode.setNext(first.getNext());

first.setNext(newListNode);
} (Points : 3)

It displays the list elements.
It finds if item is contained in the linked list.
It inserts item in the linked list.
It removes item from the linked list.

8. (TCO 2) Suppose that the method below is one of the methods in a LinkedList class. Which does the method return?

public int operation()
{
Node current = first.getNext();
int value = 0;

while(current != null)
{
value++;
current = current.getNext();
}

return value;
} (Points : 3)
The sum of all list elements
The smallest element in the list
The greatest element in the list
The number of elements in the list