Question 1

The ____________________ operator advances the iterator to the next node in the linked list.

Accepted Answer

increment

Question 2

A linked list must be searched ____________________,starting from the first node.

Accepted Answer

sequentially

Question 3

Consider the following code,which deletes all the nodes in a linked list. void doublyLinkedList::destroy() { $\quad$NodeType *temp; //pointer to delete the node $\quad$While (first != NULL) $\quad${ $\quad$$\quad$Temp = first; $\quad$$\quad$First = first->next; $\quad$$\quad$____ $\quad$} $\quad$Last = NULL; $\quad$Count = 0; } Which of the following is the missing statement?

Accepted Answer

A)  delete first; 
B)  delete temp; 
C)  destroy temp; 
D)  clear temp; 
A)  delete first; 
B)  delete temp; 
C)  destroy temp; 
D)  clear temp; B

Question 4

The deleteNode operation (if the item to be deleted is in a doubly linked list)requires the adjustment of ____ pointer(s)in certain nodes.

Accepted Answer

A)  one 
B)  two 
C)  three 
D)  four 
A)  one 
B)  two 
C)  three 
D)  four

Question 5

template ____ doublyLinkedList::isEmptyList() const { $\quad$return (first == NULL); } -Which of the following statements appears in the insert function of a doubly linked list?

Accepted Answer

A)  current++; 
B)  trailCurrent++; 
C)  newNode++; 
D)  count++; 
A)  current++; 
B)  trailCurrent++; 
C)  newNode++; 
D)  count++;

Question 6

Which of the following is a basic operation on singly linked lists?

Accepted Answer

A)  Retrieve the data of an arbitrary node. 
B)  Swap the head and the last nodes. 
C)  Determine whether the list is full. 
D)  Make a copy of the linked list. 
A)  Retrieve the data of an arbitrary node. 
B)  Swap the head and the last nodes. 
C)  Determine whether the list is full. 
D)  Make a copy of the linked list.

Question 7

Which of the following correctly initializes a doubly linked list in the default constructor?

Accepted Answer

A)  head = NULL;
Back = NULL; 
B)  head = 0;
Back = 0;
Count = 0; 
C)  first = 0;
Last = 0; 
D)  first = NULL;
Last = NULL;
Count = 0; 
A)  head = NULL;
Back = NULL; 
B)  head = 0;
Back = 0;
Count = 0; 
C)  first = 0;
Last = 0; 
D)  first = NULL;
Last = NULL;
Count = 0;

Question 8

template ____ doublyLinkedList::isEmptyList() const { $\quad$return (first == NULL); } -Consider the accompanying statements.The list is empty if the pointer first is ____.

Accepted Answer

A)  NULL 
B)  0 
C)  last 
D)  next 
A)  NULL 
B)  0 
C)  last 
D)  next

Question 9

It is not possible to create an ordered linked list.

Accepted Answer

A) True 
 B)False

Question 10

The ____________________ constructor can make an identical copy of a linked list.

Accepted Answer

The answer of The ____________________ constructor can make an identical...

Question 11

What is the output of the following program segment? (The class unorderedLinkedList is as defined in the book.) unorderedLinkedList<int> list;
List.insertFirst(6);
List.insertLast(5);
List.insertFirst(4);
List.insertFirst(8);
List.insertLast(10);
List.deleteNode(4);
List.insertFirst(1);
List.print();

Accepted Answer

A)  1 6 5 8 10 
B)  1 6 8 10 5 
C)  1 8 6 5 10 
D)  1 8 10 6 5 
A)  1 6 5 8 10 
B)  1 6 8 10 5 
C)  1 8 6 5 10 
D)  1 8 10 6 5

Question 12

In a linked list,the ____________________ operator returns the info of the current node.

Accepted Answer

The answer of In a linked list,the ____________________ operator returns...

Question 13

In a linked list,the link component of each node is a(n)____________________.

Accepted Answer

The answer of In a linked list,the link component of...

Question 14

The steps involved in inserting a new item at the beginning of an unordered linked list are ____.

Accepted Answer

A)  1. Create a new node. 
2. Insert the node before first.
3. Increment the counter by 1. 
B)  1. Create a new node. 
2. Store the new item in the new node.
3. Insert the node before first.
4. Increment the counter by 1. 
C)  1. Create a new node. 
2. Store the new item in the new node.
3. Insert the node before first. 
D)  1. Create a new node. 
2. Store the new item in the new node.
3. Insert the node before first.
4. Decrement the counter by 1. 
A)  1. Create a new node. 
2. Insert the node before first.
3. Increment the counter by 1. 
B)  1. Create a new node. 
2. Store the new item in the new node.
3. Insert the node before first.
4. Increment the counter by 1. 
C)  1. Create a new node. 
2. Store the new item in the new node.
3. Insert the node before first. 
D)  1. Create a new node. 
2. Store the new item in the new node.
3. Insert the node before first.
4. Decrement the counter by 1.

Question 15

You deallocate the memory for a linked list by calling the operator clear.

Accepted Answer

A) True 
 B)False

Question 16

A linked list is a collection of components called ____.

Accepted Answer

A)  elements 
B)  nodes 
C)  members 
D)  pointers 
A)  elements 
B)  nodes 
C)  members 
D)  pointers

Question 17

When you build a linked list in the backward manner,a new node is always inserted at the end of the linked list.

Accepted Answer

A) True 
 B)False

Question 18

A doubly linked list can be traversed in either direction.

Accepted Answer

A) True 
 B)False

Question 19

When building a linked list in the ____ manner,a new node is always inserted at the end of the linked list.

Accepted Answer

A)  backward 
B)  forward 
C)  traversal 
D)  random 
A)  backward 
B)  forward 
C)  traversal 
D)  random

Question 20

In a circular linked list with more than one node,it is convenient to make the pointer first point to the ____________________ node of the list.

Accepted Answer

The answer of In a circular linked list with more...

The ____________________ operator advances the iterator to the next node in the linked list.

A linked list must be searched ____________________,starting from the first node.

The deleteNode operation (if the item to be deleted is in a doubly linked list)requires the adjustment of ____ pointer(s)in certain nodes.

template <class Type> ____ doublyLinkedList<Type>::isEmptyList() const { $\quad$ return (first == NULL); } -Which of the following statements appears in the insert function of a doubly linked list?

Which of the following is a basic operation on singly linked lists?

Which of the following correctly initializes a doubly linked list in the default constructor?

template <class Type> doublyLinkedList<Type>::isEmptyList() const { $\quad$ return (first == NULL); } -Consider the accompanying statements.The list is empty if the pointer first is .

It is not possible to create an ordered linked list.

The ____________________ constructor can make an identical copy of a linked list.

In a linked list,the ____________________ operator returns the info of the current node.

In a linked list,the link component of each node is a(n)____________________.

The steps involved in inserting a new item at the beginning of an unordered linked list are ____.

You deallocate the memory for a linked list by calling the operator clear.

A linked list is a collection of components called ____.

When you build a linked list in the backward manner,a new node is always inserted at the end of the linked list.

A doubly linked list can be traversed in either direction.

When building a linked list in the ____ manner,a new node is always inserted at the end of the linked list.

In a circular linked list with more than one node,it is convenient to make the pointer first point to the ____________________ node of the list.

An Overview of Computers and Programming Languages

Basic Elements of C++

Input/Output

Control Structures I (Selection)

Control Structures II (Repetition)

User-Defined Functions

User-Defined Simple Data Types, Namespaces, and the string Type

Arrays and Strings

Records (structs)

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, Abstract Classes, and Lists

Overloading and Templates

Exception Handling

Recursion

Stacks and Queues

Searching and Sorting Algorithms

Binary Trees

Graphs

Standard Template Library (STL)

Filters

Exam 16: Linked Lists

The ____________________ operator advances the iterator to the next node in the linked list.

A linked list must be searched ____________________,starting from the first node.

The deleteNode operation (if the item to be deleted is in a doubly linked list)requires the adjustment of ____ pointer(s)in certain nodes.

template <class Type> ____ doublyLinkedList<Type>::isEmptyList() const { \quad return (first == NULL); } -Which of the following statements appears in the insert function of a doubly linked list?

Which of the following is a basic operation on singly linked lists?

Which of the following correctly initializes a doubly linked list in the default constructor?

template <class Type> ____ doublyLinkedList<Type>::isEmptyList() const { \quad return (first == NULL); } -Consider the accompanying statements.The list is empty if the pointer first is ____.

It is not possible to create an ordered linked list.

The ____________________ constructor can make an identical copy of a linked list.

In a linked list,the ____________________ operator returns the info of the current node.

In a linked list,the link component of each node is a(n)____________________.

The steps involved in inserting a new item at the beginning of an unordered linked list are ____.

You deallocate the memory for a linked list by calling the operator clear.

A linked list is a collection of components called ____.

When you build a linked list in the backward manner,a new node is always inserted at the end of the linked list.

A doubly linked list can be traversed in either direction.

When building a linked list in the ____ manner,a new node is always inserted at the end of the linked list.

In a circular linked list with more than one node,it is convenient to make the pointer first point to the ____________________ node of the list.

An Overview of Computers and Programming Languages

Basic Elements of C++

Input/Output

Control Structures I (Selection)

Control Structures II (Repetition)

User-Defined Functions

User-Defined Simple Data Types, Namespaces, and the string Type

Arrays and Strings

Records (structs)

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, Abstract Classes, and Lists

Overloading and Templates

Exception Handling

Recursion

Stacks and Queues

Searching and Sorting Algorithms

Binary Trees

Graphs

Standard Template Library (STL)

Filters

template <class Type> ____ doublyLinkedList<Type>::isEmptyList() const { $\quad$ return (first == NULL); } -Which of the following statements appears in the insert function of a doubly linked list?

template <class Type> doublyLinkedList<Type>::isEmptyList() const { $\quad$ return (first == NULL); } -Consider the accompanying statements.The list is empty if the pointer first is .