Question 1

Assuming the number of items is an instance variable of a linked list class, it is good practice to provide a mutator for it.

Accepted Answer

A) True 
 B)False  False

Question 2

_______ represents the index of the element of the array stack that is at the top of the stack.

Accepted Answer

A)  pop 
B)  stack 
C)  top 
D)  push 
A)  pop 
B)  stack 
C)  top 
D)  push C

Question 3

When using an array to represent a queue, we should deal with the array as if it were __________.

Accepted Answer

circular

Question 4

setData( int i ) is the best choice for coding the insert method of the Node class to enter the days of the week.

Accepted Answer

A) True 
 B)False

Question 5

A recursively defined linked list is made up of:

Accepted Answer

A)  first and rest. 
B)  the most important list items in the node. 
C)  linked lists that can be accessed only through the node class. 
D)  All of these are correct. 
A)  first and rest. 
B)  the most important list items in the node. 
C)  linked lists that can be accessed only through the node class. 
D)  All of these are correct.

Question 6

A node of a linked list typically has which of the following?

Accepted Answer

A)  Two attributes: data and the location of the next node 
B)  Only one attribute: data 
C)  Only one attribute: the location of the next node 
D)  None of these is correct. 
A)  Two attributes: data and the location of the next node 
B)  Only one attribute: data 
C)  Only one attribute: the location of the next node 
D)  None of these is correct.

Question 7

A ____________ is a linear data structure that organizes items in a last in, first out manner.

Accepted Answer

A)  stack 
B)  push 
C)  pop 
D)  LIFO 
A)  stack 
B)  push 
C)  pop 
D)  LIFO

Question 8

Which of the following is correct regarding the GenericLinkedList class and the PlayerLinkedList class?

Accepted Answer

A)  The code differs in the class header. 
B)  The code for the declaration of the instance variable head is different. 
C)  The classes implement the same methods. 
D)  All of these are correct. 
A)  The code differs in the class header. 
B)  The code for the declaration of the instance variable head is different. 
C)  The classes implement the same methods. 
D)  All of these are correct.

Question 9

In a stack represented by a linked list, we pop at the end of the list.

Accepted Answer

A) True 
 B)False

Question 10

A Player class encapsulates a player; a(n) ____________ encapsulates a node; and a PlayerLinkedList encapsulates the linked list.

Accepted Answer

The answer of A Player class encapsulates a player; a(n)...

Question 11

When inserting an element in the middle of a doubly linked list, how many pointers need to be reset?

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  3 
E)  4 
A)  0 
B)  1 
C)  2 
D)  3 
E)  4

Question 12

When deleting an element in the middle of a doubly linked list, how many pointers need to be reset?

Accepted Answer

A)  0 
B)  1 
C)  2 
D)  3 
E)  4 
A)  0 
B)  1 
C)  2 
D)  3 
E)  4

Question 13

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

Accepted Answer

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

Question 14

When using an identifier, for example T, to represent a class that uses generics, what characters surround that identifier?

Accepted Answer

A)  [ and ] 
B)  { and } 
C)   
D)  ( and ) 
A)  [ and ] 
B)  { and } 
C)   
D)  ( and )

Question 15

A tail reference can be used to:

Accepted Answer

A)  enqueue an item. 
B)  pop an item. 
C)  dequeue an item. 
D)  push an item. 
A)  enqueue an item. 
B)  pop an item. 
C)  dequeue an item. 
D)  push an item.

Question 16

Consider a queue represented by a circular array of 10 elements and front and back the two instance variables representing the indexes of the front and the back of the queue, respectively. If the value of front is 0 and the value of back is 9, what can you tell about the queue?

Accepted Answer

A)  It is empty. 
B)  It is full. 
C)  It is neither empty nor full. 
D)  It is either empty or full. 
A)  It is empty. 
B)  It is full. 
C)  It is neither empty nor full. 
D)  It is either empty or full.

Question 17

What is the return value of the method insert( Player p )?

Accepted Answer

The answer of What is the return value of the...

Question 18

The number of available elements for the queue in the array will expand over time as we enqueue and dequeue, since enqueueing and dequeueing both advance their indexes toward the end of the array.

Accepted Answer

A) True 
 B)False

Question 19

It is good practice to define your own exception class as a subclass of another exception class because your class will inherit the existing functionality of the exception class, which simplifies coding the new class; you need to code only the constructor.

Accepted Answer

A) True 
 B)False

Question 20

We cannot use recursion in linked lists.

Accepted Answer

A) True 
 B)False

Assuming the number of items is an instance variable of a linked list class, it is good practice to provide a mutator for it.

_______ represents the index of the element of the array stack that is at the top of the stack.

When using an array to represent a queue, we should deal with the array as if it were __________.

setData( int i ) is the best choice for coding the insert method of the Node class to enter the days of the week.

A recursively defined linked list is made up of:

A node of a linked list typically has which of the following?

A ____________ is a linear data structure that organizes items in a last in, first out manner.

Which of the following is correct regarding the GenericLinkedList class and the PlayerLinkedList class?

In a stack represented by a linked list, we pop at the end of the list.

A Player class encapsulates a player; a(n) ____________ encapsulates a node; and a PlayerLinkedList encapsulates the linked list.

When inserting an element in the middle of a doubly linked list, how many pointers need to be reset?

When deleting an element in the middle of a doubly linked list, how many pointers need to be reset?

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

When using an identifier, for example T, to represent a class that uses generics, what characters surround that identifier?

A tail reference can be used to:

Consider a queue represented by a circular array of 10 elements and front and back the two instance variables representing the indexes of the front and the back of the queue, respectively. If the value of front is 0 and the value of back is 9, what can you tell about the queue?

What is the return value of the method insert( Player p )?

The number of available elements for the queue in the array will expand over time as we enqueue and dequeue, since enqueueing and dequeueing both advance their indexes toward the end of the array.

It is good practice to define your own exception class as a subclass of another exception class because your class will inherit the existing functionality of the exception class, which simplifies coding the new class; you need to code only the constructor.

We cannot use recursion in linked lists.

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

Assuming the number of items is an instance variable of a linked list class, it is good practice to provide a mutator for it.

_______ represents the index of the element of the array stack that is at the top of the stack.

When using an array to represent a queue, we should deal with the array as if it were __________.

setData( int i ) is the best choice for coding the insert method of the Node class to enter the days of the week.

A recursively defined linked list is made up of:

A node of a linked list typically has which of the following?

A ____________ is a linear data structure that organizes items in a last in, first out manner.

Which of the following is correct regarding the GenericLinkedList class and the PlayerLinkedList class?

In a stack represented by a linked list, we pop at the end of the list.

A Player class encapsulates a player; a(n) ____________ encapsulates a node; and a PlayerLinkedList encapsulates the linked list.

When inserting an element in the middle of a doubly linked list, how many pointers need to be reset?

When deleting an element in the middle of a doubly linked list, how many pointers need to be reset?

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

When using an identifier, for example T, to represent a class that uses generics, what characters surround that identifier?

A tail reference can be used to:

Consider a queue represented by a circular array of 10 elements and front and back the two instance variables representing the indexes of the front and the back of the queue, respectively. If the value of front is 0 and the value of back is 9, what can you tell about the queue?

What is the return value of the method insert( Player p )?

The number of available elements for the queue in the array will expand over time as we enqueue and dequeue, since enqueueing and dequeueing both advance their indexes toward the end of the array.

It is good practice to define your own exception class as a subclass of another exception class because your class will inherit the existing functionality of the exception class, which simplifies coding the new class; you need to code only the constructor.

We cannot use recursion in linked lists.

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