Question 1

A linked list uses an extra field in a file to hold the links.

Accepted Answer

A) True 
 B)False  True

Question 2

A linked list is accessed:

Accepted Answer

A) Through a linked field.Each linked field value of the record is the next record to be processed. 
B) Uses a list pointer to specify which record is the first record to be processed. 
C) Uses an empty pointer to specify the first record in which data can be entered. 
D) All of the above. 
A) Through a linked field.Each linked field value of the record is the next record to be processed. 
B) Uses a list pointer to specify which record is the first record to be processed. 
C) Uses an empty pointer to specify the first record in which data can be entered. 
D) All of the above. D

Question 3

The records in a file using a linked list:

Accepted Answer

A) Must be in order when starting. 
B) Must be in order at all times. 
C) Does not need to be in order. 
D) None of the above. 
A) Must be in order when starting. 
B) Must be in order at all times. 
C) Does not need to be in order. 
D) None of the above. A

Question 4

The head pointer holds the field number of the next empty record.

Accepted Answer

A) True 
 B)False

Question 5

You need a head pointer and an empty pointer to process linked lists.

Accepted Answer

A) True 
 B)False

Question 6

The list pointer maintained with a list contains:

Accepted Answer

A) The smallest value in the list. 
B) The record number of the smallest value in the list. 
C) The mid value in the list. 
D) The record number of the mid value in the list. 
A) The smallest value in the list. 
B) The record number of the smallest value in the list. 
C) The mid value in the list. 
D) The record number of the mid value in the list.

Question 7

The linked field shows where the next item of data is to be processed.

Accepted Answer

A) True 
 B)False

Question 8

When using linked lists:

Accepted Answer

A) New records are always added to the bottom of the file. 
B) Deleting data is accomplished by moving all records up,after the deleted record,therefore,eliminating the deleted record. 
C) When data is deleted,the links are changed to jump over the deleted record.The deleted record number is entered into the empty list. 
D) New records are always added to the top of the file. 
A) New records are always added to the bottom of the file. 
B) Deleting data is accomplished by moving all records up,after the deleted record,therefore,eliminating the deleted record. 
C) When data is deleted,the links are changed to jump over the deleted record.The deleted record number is entered into the empty list. 
D) New records are always added to the top of the file.

Question 9

A circularly linked list has no end.

Accepted Answer

A) True 
 B)False

Question 10

A circularly linked list:

Accepted Answer

A) Is the same as any other linked list. 
B) Has no end,as the list value of the last value in the list points to the record number of the first value in the list. 
C) Is connected to the empty list. 
D) b and c 
A) Is the same as any other linked list. 
B) Has no end,as the list value of the last value in the list points to the record number of the first value in the list. 
C) Is connected to the empty list. 
D) b and c

Question 11

Linked lists must always be in order.

Accepted Answer

A) True 
 B)False

Question 12

A multilinked list has multiple linked fields.

Accepted Answer

A) True 
 B)False

Question 13

In a linked list:

Accepted Answer

A) Data is held in records. 
B) Data is held in arrays. 
C) Data is held in separate variables. 
D) None of the above. 
E) All of the above. 
A) Data is held in records. 
B) Data is held in arrays. 
C) Data is held in separate variables. 
D) None of the above. 
E) All of the above.

Question 14

A doubly linked list had two or more linked fields.

Accepted Answer

A) True 
 B)False

Question 15

The number of added field(s)to a file that uses the linked list technique of accessing data are:

Accepted Answer

A) One. 
B) Two. 
C) A linked field for each order of processing the file. 
D) Two linked fields for each order of processing the file. 
A) One. 
B) Two. 
C) A linked field for each order of processing the file. 
D) Two linked fields for each order of processing the file.

Question 16

The empty pointer holds the field number of the next empty record.

Accepted Answer

A) True 
 B)False

Question 17

After adding to and deleting from a linked list,the list must be sorted.

Accepted Answer

A) True 
 B)False

A linked list uses an extra field in a file to hold the links.

A linked list is accessed:

The records in a file using a linked list:

The head pointer holds the field number of the next empty record.

You need a head pointer and an empty pointer to process linked lists.

The list pointer maintained with a list contains:

The linked field shows where the next item of data is to be processed.

When using linked lists:

A circularly linked list has no end.

A circularly linked list:

Linked lists must always be in order.

A multilinked list has multiple linked fields.

In a linked list:

A doubly linked list had two or more linked fields.

The number of added field(s)to a file that uses the linked list technique of accessing data are:

The empty pointer holds the field number of the next empty record.

After adding to and deleting from a linked list,the list must be sorted.

General Problem-Solving Concepts

Beginning Problem-Solving Concepts for the Computer

Planning Your Solution

An Introduction to Programming Structure

Problem Solving With the Sequential Logic Structure

Problem Solving With Decisions

Problem Solving With Loops

Processing Arrays

Sorting,stacks,and Queues

File Concepts

Binary Trees

Database Management

Relational Database Management Systems

Concepts of Object Oriented Programming

Object Oriented Program Design

Introduction to Concepts of Game Development Using Object Oriented Programming

Introduction to Assembly Language

Sequential-Access File Applications

Sequential File Updating

Filters

Exam 11: Linked Lists

A linked list uses an extra field in a file to hold the links.

A linked list is accessed:

The records in a file using a linked list:

The head pointer holds the field number of the next empty record.

You need a head pointer and an empty pointer to process linked lists.

The list pointer maintained with a list contains:

The linked field shows where the next item of data is to be processed.

When using linked lists:

A circularly linked list has no end.

A circularly linked list:

Linked lists must always be in order.

A multilinked list has multiple linked fields.

In a linked list:

A doubly linked list had two or more linked fields.

The number of added field(s)to a file that uses the linked list technique of accessing data are:

The empty pointer holds the field number of the next empty record.

After adding to and deleting from a linked list,the list must be sorted.

General Problem-Solving Concepts

Beginning Problem-Solving Concepts for the Computer

Planning Your Solution

An Introduction to Programming Structure

Problem Solving With the Sequential Logic Structure

Problem Solving With Decisions

Problem Solving With Loops

Processing Arrays

Sorting,stacks,and Queues

File Concepts

Binary Trees

Database Management

Relational Database Management Systems

Concepts of Object Oriented Programming

Object Oriented Program Design

Introduction to Concepts of Game Development Using Object Oriented Programming

Introduction to Assembly Language

Sequential-Access File Applications

Sequential File Updating

Filters