Question 1

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 2

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 3

Every node (except of the last node) in a singly linked list contains ____.

Accepted Answer

A)  the next node 
B)  no address information 
C)  the address of the next node 
D)  the address of the previous node 
A)  the next node 
B)  no address information 
C)  the address of the next node 
D)  the address of the previous node

Question 4

It is not possible to create an ordered linked list.

Accepted Answer

A) True 
 B)False

Question 5

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

Accepted Answer

A) True 
 B)False

Question 6

A(n) ____________________ linked list is a linked list in which every node has a next pointer and a back pointer.

Accepted Answer

The answer of A(n) ____________________ linked list is a linked...

Question 7

A doubly linked list can be traversed in either direction.

Accepted Answer

A) True 
 B)False

Question 8

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 9

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

Accepted Answer

A) True 
 B)False

Question 10

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 11

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 12

In a linked list, the address of the first node in the list is stored in a separate location, called the ____ or first.

Accepted Answer

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

Question 13

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 14

The length of a linked list is the number of nodes in the list.

Accepted Answer

A) True 
 B)False

Question 15

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

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

Accepted Answer

A) True 
 B)False

Question 17

In C++, the dereferencing operator is ____________________.

Accepted Answer

The answer of In C++, the dereferencing operator is ____________________....

Question 18

Suppose that the pointer head points to the first node in the list, and the link of the last node is nullptr.The first node of the linked list contains the address of the ____ node.

Accepted Answer

A)  head 
B)  first 
C)  second 
D)  tail 
A)  head 
B)  first 
C)  second 
D)  tail

Question 19

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

Accepted Answer

The answer of The ____________________ operator advances the iterator to...

Question 20

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;

Exam 16: Linked Lists

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

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

Every node (except of the last node) in a singly linked list contains ____.

It is not possible to create an ordered linked list.

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

A(n) ____________________ linked list is a linked list in which every node has a next pointer and a back pointer.

A doubly linked list can be traversed in either direction.

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

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

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

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

In a linked list, the address of the first node in the list is stored in a separate location, called the ____ or first.

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

The length of a linked list is the number of nodes in the list.

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

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

In C++, the dereferencing operator is ____________________.

Suppose that the pointer head points to the first node in the list, and the link of the last node is nullptr.The first node of the linked list contains the address of the ____ node.

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

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

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

Operator Overloading and Templates

Exception Handling

Recursion

Stacks and Queue

Searching and Sorting Algorithms

Binary Trees

Graph Algorithms

Standard Template Library

Filters