Deck 11: Linked Lists

Question 1

6.A doubly linked list had two or more linked fields.

Answer 1

False

Question 2

7.A multilinked list has multiple linked fields.

Answer 2

True

Question 3

11.A linked list is accessed:

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.

Answer 3

D

Question 4

14.The list pointer maintained with a list contains:

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 5

19.The records in a file using a linked list:

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.

Question 6

5.A circularly linked list has no end.

Question 7

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

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 8

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

Question 9

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

Question 10

2.Linked lists must always be in order.

Question 11

12.When using linked lists:

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 12

16.A circularly linked list:

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 13

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

Question 14

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

Question 15

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

Question 16

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

Question 17

17.In a linked list:

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.