Question 1

A linked list contains components,called ______,which are linked to one another.

Accepted Answer

A) nodes 
B) arrays 
C) vectors 
D) references 
A) nodes 
B) arrays 
C) vectors 
D) references A

Question 2

What does a traversal operation do?

Accepted Answer

A traversal operation sequentially visits each node in a list until it reaches the end of the list.

Question 3

Which of the following statements is used to insert a new node,referenced by newNode,at the end of a linear linked list?

Accepted Answer

A) newNode.setNext(curr);
Prev.setNext(newNode); 
B) newNode.setNext(head);
Head = newNode; 
C) prev.setNext(newNode); 
D) prev.setNext(curr);
NewNode.setNext(curr); 
A) newNode.setNext(curr);
Prev.setNext(newNode); 
B) newNode.setNext(head);
Head = newNode; 
C) prev.setNext(newNode); 
D) prev.setNext(curr);
NewNode.setNext(curr); A

Question 4

When a linked list is empty,the value of the head reference is null.

Accepted Answer

A) True 
 B)False

Question 5

Which of the following is NOT true about all circular linked lists?

Accepted Answer

A) every node references a successor 
B) the last node references the first node 
C) the precede reference of each node references the node that precedes it 
D) no node contains null in its next reference 
A) every node references a successor 
B) the last node references the first node 
C) the precede reference of each node references the node that precedes it 
D) no node contains null in its next reference

Question 6

A reference variable declared as a data field within a class has the default value ______.

Accepted Answer

A) 0 
B) -1 
C) null 
D) empty 
A) 0 
B) -1 
C) null 
D) empty

Question 7

What does a node of a linear linked list contain?

Accepted Answer

A node of a linked l

Question 8

A local reference variable has a default value of null.

Accepted Answer

A) True 
 B)False

Question 9

What is a head record?

Accepted Answer

A record that contains the ext

Question 10

Write the code segment which is used to insert a new node,referenced by the reference variable newNode,between the nodes referenced by the reference variables prev and curr in a linear linked list.

Accepted Answer

newNode.se

Question 11

Why is a loop necessary to find an arbitrary node in a linked list?

Accepted Answer

Because a linked list typically has many

Question 12

Which of the following is true about a circular doubly linked list?

Accepted Answer

A) inserting into the first position of the list is a special case 
B) deleting from the last position of the list is not a special case 
C) the precede reference of the last node has the value null 
D) the next reference of the last node has the value null 
A) inserting into the first position of the list is a special case 
B) deleting from the last position of the list is not a special case 
C) the precede reference of the last node has the value null 
D) the next reference of the last node has the value null

Question 13

What is the difference between a linked list and an array in terms of their capacity to store data?

Accepted Answer

A linked list is able to grow

Question 14

Every node in a circular linked list has a successor.

Accepted Answer

A) True 
 B)False

Question 15

Suppose we want to write a loop that traverses a doubly-linked circular linked list.Assume that each node has a prev and a next reference,and the list itself maintains a reference to a head node.What is wrong with this loop header?
for (Node curr = head;curr != head.prev;curr = curr.next)

Accepted Answer

It will st

Question 16

In a linear linked list,______.

Accepted Answer

A) the next reference of each node has the value null 
B) the last node references the first node 
C) the precede reference of the dummy head node references the last node 
D) the next reference of the last node has the value null 
A) the next reference of each node has the value null 
B) the last node references the first node 
C) the precede reference of the dummy head node references the last node 
D) the next reference of the last node has the value null

Question 17

If you attempt to use a reference variable before it is instantiated,a(n)______ will be thrown.

Accepted Answer

A) IndexOutOfBoundsException 
B) InstantiationException 
C) IllegalAccessException 
D) NullPointerException 
A) IndexOutOfBoundsException 
B) InstantiationException 
C) IllegalAccessException 
D) NullPointerException

Question 18

Write the code segment that is used to insert a new node,referenced by the reference variable newNode,at the beginning of a linear linked list.

Accepted Answer

newNode.se

Question 19

Name two advantages of implementing the ADT list as a linked list (reference based)instead of an array.

Accepted Answer

Inserting and removing do not

Question 20

In Java,every class is ultimately derived from the class _____ through inheritance.

Accepted Answer

A) String 
B) Object 
C) Math 
D) Exception 
A) String 
B) Object 
C) Math 
D) Exception

A linked list contains components,called ______,which are linked to one another.

What does a traversal operation do?

Which of the following statements is used to insert a new node,referenced by newNode,at the end of a linear linked list?

When a linked list is empty,the value of the head reference is null.

Which of the following is NOT true about all circular linked lists?

A reference variable declared as a data field within a class has the default value ______.

What does a node of a linear linked list contain?

A local reference variable has a default value of null.

What is a head record?

Write the code segment which is used to insert a new node,referenced by the reference variable newNode,between the nodes referenced by the reference variables prev and curr in a linear linked list.

Why is a loop necessary to find an arbitrary node in a linked list?

Which of the following is true about a circular doubly linked list?

What is the difference between a linked list and an array in terms of their capacity to store data?

Every node in a circular linked list has a successor.

Suppose we want to write a loop that traverses a doubly-linked circular linked list.Assume that each node has a prev and a next reference,and the list itself maintains a reference to a head node.What is wrong with this loop header? for (Node curr = head;curr != head.prev;curr = curr.next)

In a linear linked list,______.

If you attempt to use a reference variable before it is instantiated,a(n)______ will be thrown.

Write the code segment that is used to insert a new node,referenced by the reference variable newNode,at the beginning of a linear linked list.

Name two advantages of implementing the ADT list as a linked list (reference based)instead of an array.

In Java,every class is ultimately derived from the class _____ through inheritance.

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

A linked list contains components,called ______,which are linked to one another.

What does a traversal operation do?

Which of the following statements is used to insert a new node,referenced by newNode,at the end of a linear linked list?

When a linked list is empty,the value of the head reference is null.

Which of the following is NOT true about all circular linked lists?

A reference variable declared as a data field within a class has the default value ______.

What does a node of a linear linked list contain?

A local reference variable has a default value of null.

What is a head record?

Write the code segment which is used to insert a new node,referenced by the reference variable newNode,between the nodes referenced by the reference variables prev and curr in a linear linked list.

Why is a loop necessary to find an arbitrary node in a linked list?

Which of the following is true about a circular doubly linked list?

What is the difference between a linked list and an array in terms of their capacity to store data?

Every node in a circular linked list has a successor.

Suppose we want to write a loop that traverses a doubly-linked circular linked list.Assume that each node has a prev and a next reference,and the list itself maintains a reference to a head node.What is wrong with this loop header? for (Node curr = head;curr != head.prev;curr = curr.next)

In a linear linked list,______.

If you attempt to use a reference variable before it is instantiated,a(n)______ will be thrown.

Write the code segment that is used to insert a new node,referenced by the reference variable newNode,at the beginning of a linear linked list.

Name two advantages of implementing the ADT list as a linked list (reference based)instead of an array.

In Java,every class is ultimately derived from the class _____ through inheritance.

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