Question 1

Which hash table method(s) will make use of the equals method?
I put
II get
III contains

Accepted Answer

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

Question 2

Array lists and linked lists both have the same ____.

Accepted Answer

A)  add/remove efficiency 
B)  concrete implementations 
C)  random element access efficiency 
D)  linear traversal step efficiency 
A)  add/remove efficiency 
B)  concrete implementations 
C)  random element access efficiency 
D)  linear traversal step efficiency

Question 3

Suppose we maintain two linked lists of length n in random element order. What would be the big-Oh notation for the creating a third list that includes only elements common to both lists, without sorting the first two lists?

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 4

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

Accepted Answer

A)  The implementation of sequential chaining technique is simpler than the implementation of the open addressing technique. 
B)  The sequential chaining technique is simpler to understand than the open addressing technique. 
C)  The sequential chaining technique requires the storage of links while open addressing does not. 
D)  The sequential chaining technique requires less memory use than open addressing. 
A)  The implementation of sequential chaining technique is simpler than the implementation of the open addressing technique. 
B)  The sequential chaining technique is simpler to understand than the open addressing technique. 
C)  The sequential chaining technique requires the storage of links while open addressing does not. 
D)  The sequential chaining technique requires less memory use than open addressing.

Which hash table method(s) will make use of the equals method? I put II get III contains

Array lists and linked lists both have the same ____.

Suppose we maintain two linked lists of length n in random element order. What would be the big-Oh notation for the creating a third list that includes only elements common to both lists, without sorting the first two lists?

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

Introduction

Using Objects

Implementing Classes

Fundamental Data Types

Decisions

Loops

Arrays and Array Lists

Designing Classes

Inheritance

Interfaces

Inputoutput and Exception Handling

Object-Oriented Design

Recursion

Sorting and Searching

The Java Collections Framework

Tree Structures

Generic Classes

Graphical User Interfaces

Streams and Binary Inputoutput

Multithreading

Internet Networking

Relational Databases

XML

Web Applications

Filters

Exam 16: Basic Data Structures

Which hash table method(s) will make use of the equals method? I put II get III contains

Array lists and linked lists both have the same ____.

Suppose we maintain two linked lists of length n in random element order. What would be the big-Oh notation for the creating a third list that includes only elements common to both lists, without sorting the first two lists?

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

Introduction

Using Objects

Implementing Classes

Fundamental Data Types

Decisions

Loops

Arrays and Array Lists

Designing Classes

Inheritance

Interfaces

Inputoutput and Exception Handling

Object-Oriented Design

Recursion

Sorting and Searching

The Java Collections Framework

Tree Structures

Generic Classes

Graphical User Interfaces

Streams and Binary Inputoutput

Multithreading

Internet Networking

Relational Databases

XML

Web Applications

Filters