Question 1

In a circular array of 5 elements, the element after the element at index 4 is the element at index:

Accepted Answer

A)  5. 
B)  0. 
C)  -1. 
D)  4. 
A)  5. 
B)  0. 
C)  -1. 
D)  4.

Question 2

For a linked list of objects, a delete method that returns an object (the object deleted, if any) throws an exception. Why?

Accepted Answer

If the object is not found, we

Question 3

Two instance variables in the IntegerNode class are an int and an IntegerNode object reference, representing the next node.

Accepted Answer

A) True 
 B)False

Question 4

The following code segment is used with the ________ approach.
16 /** enqueue method
17 * @param p Player object to insert
18 */
19 public void enqueue( Player p )

Accepted Answer

A)  LIFO 
B)  FIFO 
C)  stack 
D)  getPlayer 
A)  LIFO 
B)  FIFO 
C)  stack 
D)  getPlayer

Question 5

Consider a stack represented by an array of five elements and top, the instance variable representing the index of the top of the stack; when the stack is full, the value of top is __________.

Accepted Answer

The answer of Consider a stack represented by an array...

Question 6

It is good practice to provide an accessor to the head of a linked list.

Accepted Answer

A) True 
 B)False

Question 7

Data stored in a linked list must be of the primitive data types.

Accepted Answer

A) True 
 B)False

Question 8

Analyze why a mutator method should not be included for the number of items in a list.

Accepted Answer

Including a mutator

Question 9

Which of the following is true about both delete( int searchID ) and peek( int searchID )?

Accepted Answer

A)  Both return the first Player in the list with an ID equal to searchID. 
B)  Both remove the first Player in the list with an ID equal to searchID. 
C)  Both methods always throw a DataStructureException. 
D)  All of these are correct. 
A)  Both return the first Player in the list with an ID equal to searchID. 
B)  Both remove the first Player in the list with an ID equal to searchID. 
C)  Both methods always throw a DataStructureException. 
D)  All of these are correct.

Question 10

In a sorted linked list, it is possible that the linked list may not be sorted after a deletion.

Accepted Answer

A) True 
 B)False

Question 11

A doubly linked list allows us to go either forward or backward from a given node.

Accepted Answer

A) True 
 B)False

Question 12

A linked list:

Accepted Answer

A)  has a fixed size. 
B)  can grow and shrink as items are added or deleted. 
C)  can grow but not shrink because items can be added but not deleted. 
D)  can shrink but not grow because items can be deleted but not added. 
A)  has a fixed size. 
B)  can grow and shrink as items are added or deleted. 
C)  can grow but not shrink because items can be added but not deleted. 
D)  can shrink but not grow because items can be deleted but not added.

Question 13

Visiting each node in a list by following the links is called __________.

Accepted Answer

The answer of Visiting each node in a list by...

Question 14

The isFull and isEmpty methods enable a client program to check if the queue is full or empty before enqueueing or dequeueing a Player.

Accepted Answer

A) True 
 B)False

Question 15

A linked list that stores its values in ascending order (or descending order) according to a key value is called a(n) _______-linked list.

Accepted Answer

A)  stack 
B)  sorted 
C)  ID 
D)  arrange 
A)  stack 
B)  sorted 
C)  ID 
D)  arrange

Question 16

When we successfully delete an item from a list, the number of items in a list decreases by 1.

Accepted Answer

A) True 
 B)False

Question 17

When testing the insert method of a linked list (one that inserts at the beginning of the list), what scenarios do we want to test?

Accepted Answer

A)  Insert in an empty list (only). 
B)  Insert in an empty list and a nonempty list. 
C)  Insert in a nonempty list (only). 
D)  There is no need to test if we think the method is properly coded. 
A)  Insert in an empty list (only). 
B)  Insert in an empty list and a nonempty list. 
C)  Insert in a nonempty list (only). 
D)  There is no need to test if we think the method is properly coded.

Question 18

When testing the delete method of a linked list, what scenarios do we want to test?

Accepted Answer

A)  Attempt to delete an item not in the list. 
B)  Delete the first item in the list. 
C)  Delete an item in the middle of a list. 
D)  All of these are correct. 
A)  Attempt to delete an item not in the list. 
B)  Delete the first item in the list. 
C)  Delete an item in the middle of a list. 
D)  All of these are correct.

Question 19

In a sorted linked list, we always insert in the middle of the list.

Accepted Answer

A) True 
 B)False

Question 20

With a linked list, you should provide which of the following functions?

Accepted Answer

A)  Insert an item. 
B)  Delete an item. 
C)  List the items in the list and return that list as a String. 
D)  All of these are correct. 
A)  Insert an item. 
B)  Delete an item. 
C)  List the items in the list and return that list as a String. 
D)  All of these are correct.

In a circular array of 5 elements, the element after the element at index 4 is the element at index:

For a linked list of objects, a delete method that returns an object (the object deleted, if any) throws an exception. Why?

Two instance variables in the IntegerNode class are an int and an IntegerNode object reference, representing the next node.

The following code segment is used with the ________ approach. 16 /** enqueue method 17 * @param p Player object to insert 18 */ 19 public void enqueue( Player p )

Consider a stack represented by an array of five elements and top, the instance variable representing the index of the top of the stack; when the stack is full, the value of top is __________.

It is good practice to provide an accessor to the head of a linked list.

Data stored in a linked list must be of the primitive data types.

Analyze why a mutator method should not be included for the number of items in a list.

Which of the following is true about both delete( int searchID ) and peek( int searchID )?

In a sorted linked list, it is possible that the linked list may not be sorted after a deletion.

A doubly linked list allows us to go either forward or backward from a given node.

A linked list:

Visiting each node in a list by following the links is called __________.

The isFull and isEmpty methods enable a client program to check if the queue is full or empty before enqueueing or dequeueing a Player.

A linked list that stores its values in ascending order (or descending order) according to a key value is called a(n) _______-linked list.

When we successfully delete an item from a list, the number of items in a list decreases by 1.

When testing the insert method of a linked list (one that inserts at the beginning of the list), what scenarios do we want to test?

When testing the delete method of a linked list, what scenarios do we want to test?

In a sorted linked list, we always insert in the middle of the list.

With a linked list, you should provide which of the following functions?

Introduction to Programming and the Java Language

Programming Building Blocks- Java Basics

Object-Oriented Programming, Part 1: Using Classes

Introduction to Graphical Applications

Flow of Control, Part 1: Selection

Flow of Control, Part 2: Looping

Object-Oriented Programming, Part 2: User-Defined Classes

Single-Dimensional Arrays

Multidimensional Arrays and the Arraylist Class

Object-Oriented Programming, Part 3: Inheritance, Polymorphism, and Interfaces

Exceptions, and Input Output Operations

Graphical User Interfaces Using Java FX

Recursion

Running Time Analysis

RGB Colors, Decimal Conversion, Java Naming, and Random Number Generation

Filters

Exam 14: An Introduction to Data Structures

In a circular array of 5 elements, the element after the element at index 4 is the element at index:

For a linked list of objects, a delete method that returns an object (the object deleted, if any) throws an exception. Why?

Two instance variables in the IntegerNode class are an int and an IntegerNode object reference, representing the next node.

The following code segment is used with the ________ approach. 16 /** enqueue method 17 * @param p Player object to insert 18 */ 19 public void enqueue( Player p )

Consider a stack represented by an array of five elements and top, the instance variable representing the index of the top of the stack; when the stack is full, the value of top is __________.

It is good practice to provide an accessor to the head of a linked list.

Data stored in a linked list must be of the primitive data types.

Analyze why a mutator method should not be included for the number of items in a list.

Which of the following is true about both delete( int searchID ) and peek( int searchID )?

In a sorted linked list, it is possible that the linked list may not be sorted after a deletion.

A doubly linked list allows us to go either forward or backward from a given node.

A linked list:

Visiting each node in a list by following the links is called __________.

The isFull and isEmpty methods enable a client program to check if the queue is full or empty before enqueueing or dequeueing a Player.

A linked list that stores its values in ascending order (or descending order) according to a key value is called a(n) _______-linked list.

When we successfully delete an item from a list, the number of items in a list decreases by 1.

When testing the insert method of a linked list (one that inserts at the beginning of the list), what scenarios do we want to test?

When testing the delete method of a linked list, what scenarios do we want to test?

In a sorted linked list, we always insert in the middle of the list.

With a linked list, you should provide which of the following functions?

Introduction to Programming and the Java Language

Programming Building Blocks- Java Basics

Object-Oriented Programming, Part 1: Using Classes

Introduction to Graphical Applications

Flow of Control, Part 1: Selection

Flow of Control, Part 2: Looping

Object-Oriented Programming, Part 2: User-Defined Classes

Single-Dimensional Arrays

Multidimensional Arrays and the Arraylist Class

Object-Oriented Programming, Part 3: Inheritance, Polymorphism, and Interfaces

Exceptions, and Input Output Operations

Graphical User Interfaces Using Java FX

Recursion

Running Time Analysis

RGB Colors, Decimal Conversion, Java Naming, and Random Number Generation

Filters