Deck 19: Data Structures for Database Processing

Question 1

The term set refers to all records having the same nonunique secondary key.

Answer 1

True

Question 2

The DBMS creates physical records,also called blocks,on its direct access fields.

Answer 2

True

Question 3

Each physical record is addressed by its sequential record number (SRN).

Answer 3

False

Question 4

A flat file is a file that has repeating groups.

Question 5

An intersection record is a record that is created when a complex network is decomposed into a simple network.

Question 6

A ________ is a file that has no repeating groups.

A)flat file
B)stacked file
C)record file
D)key file
E)secondary file

Question 7

A tree structure cannot be represented using indexes.

Question 8

An index is a table that cross-references record addresses with some attribute value.

Question 9

A complex network is a collection of records and the 1:N relationships between them.

Question 10

A complex network cannot be decomposed into trees or simple networks.

Question 11

A two-way linked list has links in both directions.

Question 12

To represent a tree structure using indexes,store each 1:N relationship as an index.

Question 13

A simple network is a collection of records and the 1:N relationships between them.

Question 14

The word key indicates a field or fields whose value uniquely or nonuniquely identifies a record.

Question 15

A simple network can be represented using linked lists and indexes.

Question 16

In a linked list,the sequence field holds the address of the next record in the logical sequence.

Question 17

The primary work key is a field or fields whose value uniquely identifies a record.

Question 18

Linked lists can be used to keep records in a logical order even if they are not necessarily in physical order.

Question 19

The DBMS creates ________,also called blocks,on its direct access fields.

A)psuedo records
B)physical records
C)longlife records
D)key file records
E)secondary file records

Question 20

A multilevel index that allows both sequential and direct processing of data records is called a C-tree.

Question 21

DBMS products represent trees using:

A)indexes.
B)linked lists.
C)sequential lists.
D)A and B
E)A,B,and C

Question 22

What are tress,simple networks and complex networks?

Question 23

Keys may include:

A)primary keys.
B)unique secondary keys.
C)nonunique secondary keys.
D)B and C
E)A,B,and C

Question 24

A collection of records and the N:M relationships between them is a:

A)simple network.
B)complex network.
C)compound network.
D)logical network.
E)sequential network.

Question 25

Linked lists can be used to keep records in:

A)logical order.
B)physical order.
C)sequential order.
D)A and B
E)B and C

Question 26

Complex networks can be represented by reducing them to simple networks,and then representing the simple networks using:

A)indexes.
B)linked lists.
C)sequential lists.
D)A and B
E)A,B,and C

Question 27

What is a set?

Question 28

What is a linked list?

Question 29

How does a DBMS store data on its direct access files?

Question 30

Each physical record is addressed by its:

A)relative record number (RRN).
B)sequential record number (SRN).
C)transaction record number (TRN).
D)ultimate record number (URN).
E)unknown record number (XRN).

Question 31

The term set refers to all records that have the same:

A)primary key.
B)unique secondary key.
C)nonunique secondary key.
D)B and C
E)A,B,and C

Question 32

Complex networks can be represented by reducing them to simple networks,which requires the introduction of a(n):

A)association record.
B)link record.
C)intersection record.
D)sequential record.
E)index record.

Question 33

What is a B-tree?

Question 34

Simple networks can be represented by using:

A)indexes.
B)linked lists.
C)sequential lists.
D)A and B
E)A,B,and C

Question 35

A collection of records and the 1:N relationships between them is a:

A)simple network.
B)complex network.
C)compound network.
D)logical network.
E)sequential network.