Deck 16: Linked Lists

Question 1

In a linked list, the order of the nodes is determined by the address, called the ____, stored in each node.

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

Answer 1

C

Question 2

What is the purpose of the following code?

A) Insertion of a node
B) Selection of a node
C) Traversal of a linked list
D) Creation of a new list

Answer 2

C

Question 3

A doubly linked list can be traversed in either direction.

Answer 3

True

Question 4

It is not possible to create an ordered linked list.

Question 5

In a linked list, if a new item is always inserted at the beginning or at the end of the list and the data we read is unsorted, the linked list will be unsorted.

Question 6

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

Question 7

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

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

Question 8

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.

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

Question 9

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

Question 10

You can use the pointer head of a linked list to traverse the list.

Question 11

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

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

Question 12

A linked list is a random access data structure.

Question 13

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

Question 14

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

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

Question 15

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

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

Question 16

A linked list is a collection of components, called ____.

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

Question 17

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

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

Question 18

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

Question 19

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

Question 20

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

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

Question 21

In C++, the dereferencing operator is ____________________.

Question 22

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

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.

Question 23

Create a new node.
2.Store the new item in the new node.
3.Insert the node before first.
d.

Question 24

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

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 25

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

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

Question 26

Consider the following code which deletes all the nodes in a linked list. Which of the following is the missing statement?

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

Question 27

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

Question 28

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 29

Every node in a doubly linked list has two pointers: ____ and ____.

A) top; bottom
B) back; next
C) current; forward
D) previous; forward

Question 30

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

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 31

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

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

Question 32

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

Question 33

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

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

Question 34

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

Question 35

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.

Question 36

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

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

Question 37

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

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

Question 38

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

Question 39

Create a new node.
2.Insert the node before first.
3.Increment the counter by 1.
b.

Question 40

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

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

Question 41

For classes that include pointer data members, the assignment operator must be explicitly ____________________.

Question 42

The ____________________ constructor executes when an object is declared and initialized using another object.

Question 43

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

Question 44

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