Exam 16: Basic Data Structures

Which of the following operations from the array list data structure could be used in the implementation of the push and pop operations of a stack data structure? I addLast II addFirst III removeLast

Assume that you have a hash table in which there are few or no collisions. What is the time required to add a new element to this hash table?

If we want a create a doubly-linked list data structure so that we can move from a node to the next node as well as to a previous node, we need to add a previous reference to the Node class. Each such DNode (doubly-linked Node) will have a data portion and two DNode references, next and previous. How many references need to be updated when we remove a node from the middle of such a list? Consider the neighboring nodes.

A doubly-linked list requires that each node maintain two references, one to the next node and one to the previous node. Which of the following statements about a doubly-linked list is NOT correct?

Array list operations that were studied included adding/removing an element at the end or in the middle, and retrieving the kth element. Which of the following statements about these array list operations is correct?

Using the textbook's implementation of a linked list, which of the following statements about changing the data stored in a previously visited element is correct?

Which of the following actions must be taken to add a node X at the end 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 before the position where X will be placed III Update the list's last reference

Adding or removing an arbitrary element in the middle of an array list takes ____ time.

You have implemented a queue as a singly-linked list, adding elements at the end and removing elements at the front. What is the cost of the add operation?

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

Using the textbook's implementation of a linked list, what is the purpose of declaring the Node class to be a static inner class?

Suppose we maintain a linked list of length n in random element order. What would be the big-Oh notation for an algorithm that prints each list element and the number of times it occurs in the list (without sorting the list)?

Which of the following statements about array list and doubly-linked list operations is correct?

Assume that you have a hash table in which there are few or no collisions. What is the time required to remove an element from this hash table?

Given the partial LinkedList class declaration below, select a statement to complete the size method, which is designed to return the number of list elements. public class LinkedList { Class Node { Public Object data; Public Node next; } Private Node first; ) . . Public int size() { Int count = 0; Node temp = first; While (temp != null) { Count++; _____________________ } Return count; } }

Given the LinkedListQueue class implementation discussed in section 16.3 (partially shown below), select the appropriate statements to complete the add method. public class LinkedListQueue { Private Node first; Private Node last; Public LinkedListQueue() { First = null; Last = null; } Public void add(Object newElement) { Node newNode = new Node(); NewNode.data = newElement; NewNode.next = null; If (last == null) { First = newNode; Last = newNode; } Else { _____________________ _____________________ } } ).. }

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?

What technique is used to store elements that hash to the same location?

What type of access does the use of an iterator provide for the elements of a bucket in a hash table?

In the open addressing technique for handling collisions in a hash table, ____.