Question 1

Adding or removing an element at an arbitrary iterator position in a singly linked list of length n takes ____ time.

Accepted Answer

A)  O(n) 
B)  O(log n) 
C)  O(1) 
D)  O(n2) 
A)  O(n) 
B)  O(log n) 
C)  O(1) 
D)  O(n2)

Question 2

Suppose we maintain a linked list of length n in sorted order. What would be the big-Oh notation for printing out those elements that occur exactly once in the list?

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(n log2 n) 
D)  O(n2) 
A)  O(1) 
B)  O(n) 
C)  O(n log2 n) 
D)  O(n2)

Question 3

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

Accepted Answer

A)  To create an outer-class reference. 
B)  To create a this reference to itself. 
C)  To prevent storage of an outer-class reference that is not needed. 
D)  To create an outer-class reference that is needed. 
A)  To create an outer-class reference. 
B)  To create a this reference to itself. 
C)  To prevent storage of an outer-class reference that is not needed. 
D)  To create an outer-class reference that is needed.

Question 4

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?

Accepted Answer

A)  The most expensive operation of an array list is to add an element at the end. 
B)  The most expensive operation of an array list is to remove an element at the end. 
C)  The most expensive operation of an array list is to add an element in the middle. 
D)  The most expensive operation of an array list is to retrieve an arbitrary element. 
A)  The most expensive operation of an array list is to add an element at the end. 
B)  The most expensive operation of an array list is to remove an element at the end. 
C)  The most expensive operation of an array list is to add an element in the middle. 
D)  The most expensive operation of an array list is to retrieve an arbitrary element.

Question 5

Which of the following actions must be taken to remove a node X from the middle of a doubly-linked list?
I Update the next reference in the node before X
II Update the previous reference in the node after X
III Update the list's first reference

Accepted Answer

A)  I 
B)  II 
C)  I and II 
D)  II and III 
A)  I 
B)  II 
C)  I and II 
D)  II and III

Question 6

If your hashCode function returns a number anywhere in the hash table with equal probability, what is the likely result?

Accepted Answer

A)  Some objects will be impossible to find. 
B)  The number of collisions will be high. 
C)  The get method will run at O(n) complexity. 
D)  The get method will run at O(1) complexity. 
A)  Some objects will be impossible to find. 
B)  The number of collisions will be high. 
C)  The get method will run at O(n) complexity. 
D)  The get method will run at O(1) complexity.

Question 7

Which of the following statements about adding an element to a hash table is NOT correct?

Accepted Answer

A)  Add the new element at the beginning of the node sequence in the bucket referenced by the hash code. 
B)  Check the elements in the bucket to determine if the new element already exists. 
C)  If the element matches another element in the bucket referenced by the hash code, add the new element to that bucket. 
D)  To add an element, its compressed hash code must be computed. 
A)  Add the new element at the beginning of the node sequence in the bucket referenced by the hash code. 
B)  Check the elements in the bucket to determine if the new element already exists. 
C)  If the element matches another element in the bucket referenced by the hash code, add the new element to that bucket. 
D)  To add an element, its compressed hash code must be computed.

Question 8

Why is it not typical to use the hashCode method result directly as an index for array storage?
I because the hashcode method returns a double
II the values are potentially very large
III the values are not type int

Accepted Answer

A)  I 
B)  I and II 
C)  I and III 
D)  II 
A)  I 
B)  I and II 
C)  I and III 
D)  II

Question 9

Suppose we maintain a linked list of length n in random element order. What would be the big-Oh notation for printing out those elements which occur exactly once in the list (without sorting the list)?

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(nlog2n) 
D)  O(n2) 
A)  O(1) 
B)  O(n) 
C)  O(nlog2n) 
D)  O(n2)

Question 10

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 remove operation?

Accepted Answer

A)  O(log(n)) 
B)  O(n) 
C)  O(n2) 
D)  O(1) 
A)  O(log(n)) 
B)  O(n) 
C)  O(n2) 
D)  O(1)

Question 11

When considering the reallocation operation for a list whose buffer is full, on average it will take ____ time.

Accepted Answer

A)  O(n) 
B)  O(1) 
C)  O(1)+ 
D)  O(n2) 
A)  O(n) 
B)  O(1) 
C)  O(1)+ 
D)  O(n2)

Question 12

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

Accepted Answer

A)  The iterator is at the end of the list if the linked list's first node reference is null. 
B)  The iterator is at the end of the list if the position.next reference is null. 
C)  The iterator is at the end of the list if the position reference is null. 
D)  The list is empty if the linked list's first node reference is null. 
A)  The iterator is at the end of the list if the linked list's first node reference is null. 
B)  The iterator is at the end of the list if the position.next reference is null. 
C)  The iterator is at the end of the list if the position reference is null. 
D)  The list is empty if the linked list's first node reference is null.

Question 13

On average, how many elements of an array list of size n need to be moved when an element is removed?

Accepted Answer

A)  n 
B)  n2 
C)  2n 
D)  n / 2 
A)  n 
B)  n2 
C)  2n 
D)  n / 2

Question 14

When using the textbook's implementation of a singly linked list to remove an element in the middle of the list, why it is necessary to check whether the previous reference equals the position reference?

Accepted Answer

A)  If previous equals position, the action does not follow a call to next. 
B)  If previous equals position and an attempt is made to remove the node, the iterator would have to start at the beginning of the list to rebuild the links. 
C)  If previous equals position, the iterator is at the beginning of the list and does not point to a valid node. 
D)  If previous equals position, the iterator is at the end of the list and does not point to a valid node. 
A)  If previous equals position, the action does not follow a call to next. 
B)  If previous equals position and an attempt is made to remove the node, the iterator would have to start at the beginning of the list to rebuild the links. 
C)  If previous equals position, the iterator is at the beginning of the list and does not point to a valid node. 
D)  If previous equals position, the iterator is at the end of the list and does not point to a valid node.

Question 15

What type of access does the use of an iterator with a LinkedList provide for its elements?

Accepted Answer

A)  sequential 
B)  semi-random 
C)  random 
D)  sorted 
A)  sequential 
B)  semi-random 
C)  random 
D)  sorted

Question 16

On average, how many elements of an array list of size n need to be moved when an element is added?

Accepted Answer

A)  n 
B)  n2 
C)  2n 
D)  n / 2 
A)  n 
B)  n2 
C)  2n 
D)  n / 2

Question 17

Which of the following statements about removing a node from a linked list is correct?

Accepted Answer

A)  A node's data is discarded when it is removed from the linked list, and its memory space is immediately reclaimed. 
B)  A node's data is returned to the program when the node is removed from the linked list, and its memory space is immediately reclaimed. 
C)  A node's data is discarded when it is removed from the linked list, and its memory space is reclaimed later by the garbage collector. 
D)  A node's data is returned to the program when the node is removed from the linked list, and its memory space is reclaimed later by the garbage collector. 
A)  A node's data is discarded when it is removed from the linked list, and its memory space is immediately reclaimed. 
B)  A node's data is returned to the program when the node is removed from the linked list, and its memory space is immediately reclaimed. 
C)  A node's data is discarded when it is removed from the linked list, and its memory space is reclaimed later by the garbage collector. 
D)  A node's data is returned to the program when the node is removed from the linked list, and its memory space is reclaimed later by the garbage collector.

Question 18

Assume that you have a hash table in which there are an average number of collisions. What is the time required to add an element to this hash table?

Accepted Answer

A)  O(n) 
B)  O(n2) 
C)  O(1) 
D)  O(1)+ 
A)  O(n) 
B)  O(n2) 
C)  O(1) 
D)  O(1)+

Question 19

Assume that the linked list implementation includes a reference to the last node as well as to the first node. Which of the following statements about the efficiency of a singly linked list is NOT correct?

Accepted Answer

A)  Adding an element to the middle of a linked list using an iterator is O(1). 
B)  Removing the last element from a linked list using an iterator is O(1). 
C)  Accessing an element in a linked list using an iterator is O(n). 
D)  Adding an element to the end of a linked list is O(1). 
A)  Adding an element to the middle of a linked list using an iterator is O(1). 
B)  Removing the last element from a linked list using an iterator is O(1). 
C)  Accessing an element in a linked list using an iterator is O(n). 
D)  Adding an element to the end of a linked list is O(1).

Question 20

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

Accepted Answer

A)  The methods of the LinkedList class can access the public features of the Node class. 
B)  The methods of the Node class can access the public features of the LinkedList class. 
C)  The methods of the Node class can be directly accessed by other classes. 
D)  The Node class's instance variables that represent the node element and its next node reference are declared as public. 
A)  The methods of the LinkedList class can access the public features of the Node class. 
B)  The methods of the Node class can access the public features of the LinkedList class. 
C)  The methods of the Node class can be directly accessed by other classes. 
D)  The Node class's instance variables that represent the node element and its next node reference are declared as public.

Exam 16: Basic Data Structures

Adding or removing an element at an arbitrary iterator position in a singly linked list of length n takes ____ time.

Suppose we maintain a linked list of length n in sorted order. What would be the big-Oh notation for printing out those elements that occur exactly once in the list?

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

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?

Which of the following actions must be taken to remove a node X from the middle of a doubly-linked list? I Update the next reference in the node before X II Update the previous reference in the node after X III Update the list's first reference

If your hashCode function returns a number anywhere in the hash table with equal probability, what is the likely result?

Which of the following statements about adding an element to a hash table is NOT correct?

Why is it not typical to use the hashCode method result directly as an index for array storage? I because the hashcode method returns a double II the values are potentially very large III the values are not type int

Suppose we maintain a linked list of length n in random element order. What would be the big-Oh notation for printing out those elements which occur exactly once in the list (without sorting the list)?

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 remove operation?

When considering the reallocation operation for a list whose buffer is full, on average it will take ____ time.

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

On average, how many elements of an array list of size n need to be moved when an element is removed?

When using the textbook's implementation of a singly linked list to remove an element in the middle of the list, why it is necessary to check whether the previous reference equals the position reference?

What type of access does the use of an iterator with a LinkedList provide for its elements?

On average, how many elements of an array list of size n need to be moved when an element is added?

Which of the following statements about removing a node from a linked list is correct?

Assume that you have a hash table in which there are an average number of collisions. What is the time required to add an element to this hash table?

Assume that the linked list implementation includes a reference to the last node as well as to the first node. Which of the following statements about the efficiency of a singly linked list is NOT correct?

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

Introduction

Fundamental Data Types

Decisionseasy

Loops

Methods

Arrays and Arraylists

Inputoutput and Exception Handling

Objects and Classes

Inheritance and Interfaces

Graphical User Interfaces

Advanced User Interfaces

Object-Oriented Design

Recursion

Sorting and Searching

The Java Collections Framework

Tree Structures

Generic Classes

Streams and Binary Inputoutput

Multithreading

Internet Networking

Relational Databases

XML

Web Applications

Filters