Deck 23: Data Structures for Database Processing

Question 1

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

Answer 1

False

Question 2

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

Answer 2

True

Question 3

A flat file is a file that has repeating groups.

Answer 3

False

Question 4

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 5

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

Question 6

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

Question 7

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 8

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

Question 9

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

Question 10

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

Question 11

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

Question 12

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

Question 13

A tree structure cannot be represented using indexes.

Question 14

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

Question 19

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

Question 20

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

Question 21

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 22

What is a set?

Question 23

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 24

What is a linked list?

Question 25

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 26

What is a B-tree?

Question 27

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

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

Question 28

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

Question 29

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.

Question 30

DBMS products represent trees using:

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

Question 31

Keys may include:

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

Question 32

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 33

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 34

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 35

What are tress,simple networks and complex networks?