Exam 16: Basic Data Structures

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; _________________ _________________

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

Using the textbook's implementation of a linked list, which of the following statements about adding a node to the middle of a linked list 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?

Suppose we maintain two linked lists of length n in sorted order. What would be the big-Oh notation for the creating a third list, which included only elements common to both lists?

Array lists and linked lists both have the same ____.

What is never present in a static inner class?

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

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?

Which of the following statements about hash tables is NOT correct?

Which of the following statements about a linked list and its iterator is NOT correct?

A hash function is considered good if it ____.

In the separate chaining technique for handling collisions in a hash table, ____.

Which of the following statements about handling collisions in a hash table using the sequential chaining and open addressing techniques is NOT correct?

The advantage of using the open addressing technique over the separate chaining technique for handling collisions in a hash table is that open addressing ____.

Complete the following code snippet, which is intended to compress a hash code to become a valid array index: _____________________ If (h < 0) { h = -h; } Position = h % arrayLength;

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

Which Java package contains the LinkedList class?

Which of the following algorithms would be efficiently executed on a LinkedList?

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