Question 1

Linked lists allow you to overcome the size limitations of an array data type.

Accepted Answer

A) True 
 B)False

Question 2

Each node of a singly linked list has two components: ____ and ____.

Accepted Answer

A)  info, head 
B)  link, back 
C)  back, head 
D)  info, link 
A)  info, head 
B)  link, back 
C)  back, head 
D)  info, link

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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 5

Because each node of a linked list has two components, we need to declare each node as a(n) ____.

Accepted Answer

A)  reference and string 
B)  int and object 
C)  index and element 
D)  class or struct 
A)  reference and string 
B)  int and object 
C)  index and element 
D)  class or struct

Question 6

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 7

Data can be organized and processed sequentially using an array, called a(n) ____ list.

Accepted Answer

A)  linked 
B)  ordered 
C)  sequential 
D)  ascending 
A)  linked 
B)  ordered 
C)  sequential 
D)  ascending

Question 8

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

Accepted Answer

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

Question 9

-Consider the accompanying statements. The operation returns true if the list is empty; otherwise, it returns false. The missing code is ____.

Accepted Answer

A)  protected 
B)  int 
C)  void 
D)  bool 
A)  protected 
B)  int 
C)  void 
D)  bool

Question 10

It is not possible to create an ordered linked list.

Accepted Answer

A) True 
 B)False

Question 11

A(n) ____________________ is an object that produces each element of a container, such as a linked list, one element at a time.

Accepted Answer

The answer of A(n) ____________________ is an object that produces...

Question 12

Consider the following code: The statement that provides the length of the linked list is ____.

Accepted Answer

A)  cout <<< count; 
B)  destroy(); 
C)  return count; 
D)  return next; 
A)  cout <<< count; 
B)  destroy(); 
C)  return count; 
D)  return next;

Question 13

Each node of a linked list must store the data as well as the ____________________ of the next node in the list.

Accepted Answer

The answer of Each node of a linked list must...

Question 14

The ____ deallocates the memory occupied by the nodes of a list when the class object goes out of scope.

Accepted Answer

A)  constructor 
B)  destructor 
C)  head pointer 
D)  tail pointer 
A)  constructor 
B)  destructor 
C)  head pointer 
D)  tail pointer

Question 15

-Consider the statements above. The list is empty if the pointer first is ____.

Accepted Answer

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

Question 16

The link field of the last node of a linked list is ____.

Accepted Answer

A)  nullptr 
B)  1 
C)  n-1 
D)  n 
A)  nullptr 
B)  1 
C)  n-1 
D)  n

Question 17

Memory for the components of an array does not need to be contiguous.

Accepted Answer

A) True 
 B)False

Question 18

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...

Question 19

-Consider the accompanying code. What is the effect of the following statement? newNode->info = 50;

Accepted Answer

A)  Stores 50 in the info field of the newNode 
B)  Creates a new node 
C)  Places the node at location 50 
D)  Cannot be determined from this code 
A)  Stores 50 in the info field of the newNode 
B)  Creates a new node 
C)  Places the node at location 50 
D)  Cannot be determined from this code

Question 20

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 nearly 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 nearly full. 
D)  Make a copy of the linked list.

Linked lists allow you to overcome the size limitations of an array data type.

Each node of a singly linked list has two components: and .

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

Which of the following statements appears in the insert function of a doubly linked list?

Because each node of a linked list has two components, we need to declare each node as a(n) ____.

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

Data can be organized and processed sequentially using an array, called a(n) ____ list.

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

-Consider the accompanying statements. The operation returns true if the list is empty; otherwise, it returns false. The missing code is ____.

It is not possible to create an ordered linked list.

A(n) ____________________ is an object that produces each element of a container, such as a linked list, one element at a time.

Consider the following code: The statement that provides the length of the linked list is ____.

Each node of a linked list must store the data as well as the ____________________ of the next node in the list.

The ____ deallocates the memory occupied by the nodes of a list when the class object goes out of scope.

-Consider the statements above. The list is empty if the pointer first is ____.

The link field of the last node of a linked list is ____.

Memory for the components of an array does not need to be contiguous.

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

-Consider the accompanying code. What is the effect of the following statement? newNode->info = 50;

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

An Overview of Computers and Programming Languages

Basic Elements of C++

Inputoutput

Control Structures I Selection

Control Structures II Repetition

User-Defined Function

Namespaces, the Class String, and User-Defined Simple Data Types

Arrays

Records Structs

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, and Abstract Classes

Overloading and Templates

Exception Handling

Recursion

Searching and Sorting

Stacks and Queues

Filters

Exam 17: Linked Lists

Linked lists allow you to overcome the size limitations of an array data type.

Each node of a singly linked list has two components: ____ and ____.

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

Which of the following statements appears in the insert function of a doubly linked list?

Because each node of a linked list has two components, we need to declare each node as a(n) ____.

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

Data can be organized and processed sequentially using an array, called a(n) ____ list.

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

-Consider the accompanying statements. The operation returns true if the list is empty; otherwise, it returns false. The missing code is ____.

It is not possible to create an ordered linked list.

A(n) ____________________ is an object that produces each element of a container, such as a linked list, one element at a time.

Consider the following code: The statement that provides the length of the linked list is ____.

Each node of a linked list must store the data as well as the ____________________ of the next node in the list.

The ____ deallocates the memory occupied by the nodes of a list when the class object goes out of scope.

-Consider the statements above. The list is empty if the pointer first is ____.

The link field of the last node of a linked list is ____.

Memory for the components of an array does not need to be contiguous.

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

-Consider the accompanying code. What is the effect of the following statement? newNode->info = 50;

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

An Overview of Computers and Programming Languages

Basic Elements of C++

Inputoutput

Control Structures I Selection

Control Structures II Repetition

User-Defined Function

Namespaces, the Class String, and User-Defined Simple Data Types

Arrays

Records Structs

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, and Abstract Classes

Overloading and Templates

Exception Handling

Recursion

Searching and Sorting

Stacks and Queues

Filters

Each node of a singly linked list has two components: and .