Question 1

Which of the following will be true when the reference variable curr references the last node in a linear linked list?

Accepted Answer

A) curr == null 
B) head == null 
C) curr.getNext()== null 
D) head.getNext()== null 
A) curr == null 
B) head == null 
C) curr.getNext()== null 
D) head.getNext()== null

Question 2

To delete a node N from a linear linked list,you will need to ______.

Accepted Answer

A) set the reference next in the node that precedes N to reference the node that follows N 
B) set the reference next in the node that precedes N to reference N 
C) set the reference next in the node that follows N to reference the node that precedes N 
D) set the reference next in N to reference the node that follows N 
A) set the reference next in the node that precedes N to reference the node that follows N 
B) set the reference next in the node that precedes N to reference N 
C) set the reference next in the node that follows N to reference the node that precedes N 
D) set the reference next in N to reference the node that follows N

Question 3

What are two advantages of using a reference-based implementation of the ADT list instead of an array-based implementation?

Accepted Answer

First,a reference-based implem

Question 4

_______ is a process that transforms an object into a stream of bytes that can be saved to and restored from a file.

Accepted Answer

A) Information hiding 
B) Object serialization 
C) Encapsulation 
D) Inheritance 
A) Information hiding 
B) Object serialization 
C) Encapsulation 
D) Inheritance

Question 5

The constant null can be used as the value of a reference to any type of object.

Accepted Answer

A) True 
 B)False

Question 6

When you declare a variable that refers to an object of a given class,you are creating a(n)______ to the object.

Accepted Answer

A) interface 
B) reference 
C) method 
D) ADT 
A) interface 
B) reference 
C) method 
D) ADT

Question 7

In a reference-based implementation of an ADT list ______.

Accepted Answer

A) increasing the size of the list can waste storage and time 
B) less memory is required to store an item than in an array-based implementation 
C) an item explicitly references the next item 
D) the location of the item after a particular item is implied 
A) increasing the size of the list can waste storage and time 
B) less memory is required to store an item than in an array-based implementation 
C) an item explicitly references the next item 
D) the location of the item after a particular item is implied

Question 8

Insertion at the end of a linear linked list is a special case.

Accepted Answer

A) True 
 B)False

Question 9

A reference variable whose sole purpose is to locate the first node in a linked list is called ______.

Accepted Answer

A) top 
B) front 
C) head 
D) first 
A) top 
B) front 
C) head 
D) first

Question 10

Write the code fragment to delete the node that the reference variable curr references in a circular doubly linked list?

Accepted Answer

curr.getPrecede().se

Question 11

In a circular doubly linked list,inserting into the first position of the list is a special case.

Accepted Answer

A) True 
 B)False

Question 12

What are the three high-level steps to delete a node from a linear linked list?

Accepted Answer

The three high-level steps to delete a n

Question 13

The last node of a linear linked list ______.

Accepted Answer

A) has the value null 
B) has a next reference whose value is null 
C) has a next reference which references the first node of the list 
D) cannot store any data 
A) has the value null 
B) has a next reference whose value is null 
C) has a next reference which references the first node of the list 
D) cannot store any data

Question 14

A _______ can be used to facilitate adding nodes to the end of a linear linked list.

Accepted Answer

A) head record 
B) dummy head node 
C) tail reference 
D) precede reference 
A) head record 
B) dummy head node 
C) tail reference 
D) precede reference

Question 15

What are the three high-level steps to insert a new node into a linear linked list?

Accepted Answer

The three high-level steps to insert a n

Question 16

Write the code fragment to insert a new node that the reference variable newNode references before the node referenced by the reference variable curr in a doubly linked list.

Accepted Answer

newNode.setNext(curr);
newNode

Question 17

No node in a circular linked list contains the value null in its next reference.

Accepted Answer

A) True 
 B)False

Question 18

In the following code segment: Integer maxNum;
MaxNum = new Integer (15);
______ is a reference variable.

Accepted Answer

A) Integer 
B) maxNum 
C) new 
D) 15 
A) Integer 
B) maxNum 
C) new 
D) 15

Question 19

An array-based implementation of an ADT list ______.

Accepted Answer

A) requires less memory to store an item than a reference-based implementation 
B) is not a good choice for a small list 
C) has a variable size 
D) has items which explicitly reference the next items 
A) requires less memory to store an item than a reference-based implementation 
B) is not a good choice for a small list 
C) has a variable size 
D) has items which explicitly reference the next items

Question 20

In Java,the programmer must explicitly deallocate memory.

Accepted Answer

A) True 
 B)False

Which of the following will be true when the reference variable curr references the last node in a linear linked list?

To delete a node N from a linear linked list,you will need to ______.

What are two advantages of using a reference-based implementation of the ADT list instead of an array-based implementation?

_______ is a process that transforms an object into a stream of bytes that can be saved to and restored from a file.

The constant null can be used as the value of a reference to any type of object.

When you declare a variable that refers to an object of a given class,you are creating a(n)______ to the object.

In a reference-based implementation of an ADT list ______.

Insertion at the end of a linear linked list is a special case.

A reference variable whose sole purpose is to locate the first node in a linked list is called ______.

Write the code fragment to delete the node that the reference variable curr references in a circular doubly linked list?

In a circular doubly linked list,inserting into the first position of the list is a special case.

What are the three high-level steps to delete a node from a linear linked list?

The last node of a linear linked list ______.

A _______ can be used to facilitate adding nodes to the end of a linear linked list.

What are the three high-level steps to insert a new node into a linear linked list?

Write the code fragment to insert a new node that the reference variable newNode references before the node referenced by the reference variable curr in a doubly linked list.

No node in a circular linked list contains the value null in its next reference.

In the following code segment: Integer maxNum; MaxNum = new Integer (15); ______ is a reference variable.

An array-based implementation of an ADT list ______.

In Java,the programmer must explicitly deallocate memory.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters

Exam 5: Linked Lists

Which of the following will be true when the reference variable curr references the last node in a linear linked list?

To delete a node N from a linear linked list,you will need to ______.

What are two advantages of using a reference-based implementation of the ADT list instead of an array-based implementation?

_______ is a process that transforms an object into a stream of bytes that can be saved to and restored from a file.

The constant null can be used as the value of a reference to any type of object.

When you declare a variable that refers to an object of a given class,you are creating a(n)______ to the object.

In a reference-based implementation of an ADT list ______.

Insertion at the end of a linear linked list is a special case.

A reference variable whose sole purpose is to locate the first node in a linked list is called ______.

Write the code fragment to delete the node that the reference variable curr references in a circular doubly linked list?

In a circular doubly linked list,inserting into the first position of the list is a special case.

What are the three high-level steps to delete a node from a linear linked list?

The last node of a linear linked list ______.

A _______ can be used to facilitate adding nodes to the end of a linear linked list.

What are the three high-level steps to insert a new node into a linear linked list?

Write the code fragment to insert a new node that the reference variable newNode references before the node referenced by the reference variable curr in a doubly linked list.

No node in a circular linked list contains the value null in its next reference.

In the following code segment: Integer maxNum; MaxNum = new Integer (15); ______ is a reference variable.

An array-based implementation of an ADT list ______.

In Java,the programmer must explicitly deallocate memory.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Problem Solving With Abstract Data Types

Stacks

Queues

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters