Exam 16: Basic Data Structures

The linked list iterator described in the textbook maintains a reference to the last visited node, called position, and a reference to the last node before that, called previous. Which of the following statements is NOT correct regarding advancing this iterator?

Reading or writing an array list element at an arbitrary index takes ____ time.

Complete the following code, which is intended to add an element to a hash table. Assume that the computed and compressed hash code is stored in the variable h. Node newNode = new Node(); NewNode.data = x; _________________ _________________

Which statement about handling collisions in a hash table using the open addressing technique is correct?

In the textbook implementation, the LinkedListIterator class is a private inner class of the LinkedList class. Which of the following statements regarding this implementation is NOT correct?

When the buffer for an array list must be grown, a single reallocation operation takes ____ time.

Given the HashSet class implementation discussed in section 16.4 (partially shown below), select the statement needed to complete the clear method, which is designed to remove all elements from the set. public class HashSet { Private Node[] buckets; Private int currentSize; Public HashSet(int bucketsLength) { Buckets = new Node[bucketsLength]; CurrentSize = 0; } Public void clear() { For (int j = 0; j < buckets.length; ++j) { ___________________________ } CurrentSize = 0; } ).. }

What is the time required to iterate over all elements in a hash table of size n?

Given the partial LinkedList class declaration below, select a statement to complete the printFirst method, which is designed to display the contents of the first list element. public class LinkedList { Class Node { Public Object data; Public Node next; } Private Node first; ) . . Public void printFirst() { _____________________________ } }

Which of the following operations is least efficient in a LinkedList?

Which of the following actions must be taken to add a node X into the middle of a doubly-linked list? I Update the next reference in the node before the position where X will be placed II Update the previous reference in the node after the position where X will be placed III Update the list's first reference

Using the textbook's implementation of a linked list, which of the following statements about managing nodes within a linked list using an iterator is correct?

Using the textbook's implementation of a linked list, why is the LinkedListIterator inner class NOT declared as an inner static class?

Suppose we maintain an array A of n int values as follows: A[0] < A[1] < . . . < A[i] > A[i + 1] > A[i + 2] > . . . > A[n - 1] The ith element is the maximum in the array. What would be the lowest big-Oh notation for finding that element? Consider a variation of the binary search.

When implementing a queue as a singly-linked list, which of these statements is correct?

A stack can be implemented as a sequence of nodes in a linked list or an array list. Which of the following statements about this is correct?

Given the partial LinkedList and LinkedListIterator class declarations below, select an expression to complete the LinkedList get(index) method, which returns the element at the position indicated by index. public class LinkedList { ) . . Public ListIterator listIterator() { Return new LinkedListIterator(); } Class LinkedListIterator implements ListIterator { Private Node position; Private Node previous; Private boolean isAfterNext; Public LinkedListIterator() { ) . . } Public Object next() { ) . . } Public boolean hasNext() { ) . . } } Public Object get(int index) { ListIterator it = listIterator(); For (int i = 0; i < index; ++i) { It)next(); } Return ________________________ ; } }

Which of the following statements about hash tables is correct?

Consider the following code snippet: LinkedList<String> words = new LinkedList<String>(); Words.addFirst("123"); Words.addLast("456"); Words.addFirst("789"); System.out.print(words.removeLast()); System.out.print(words.removeFirst()); System.out.print(words.removeLast()); What does this code print?

Elements in a hash table are said to ____ when they have the same hash code value.