Deck 21: Data Structures for Database Processing

Question 1

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

Answer 1

False

Question 2

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

Answer 2

False

Question 3

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

Answer 3

False

Question 4

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

Question 5

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

Question 6

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

Question 7

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

Question 8

A ________ is a file that has no repeating groups.

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

Question 9

A tree structure cannot be represented using indexes.

Question 10

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

Question 11

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

Question 12

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

Question 13

A flat file is a file that has repeating groups.

Question 14

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

Question 15

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

Question 16

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

Question 17

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

Question 18

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

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

Question 19

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

Question 20

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

Question 21

What are tree,simple networks and complex networks?

Question 22

DBMS products represent trees using all of the following except ________.

A)indexes
B)linked lists
C)sequential lists
D)secondary lists

Question 23

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

A)indexes or linked lists
B)linked lists or sequential lists
C)sequential lists or indexes
D)trees

Question 24

What is a B-tree?

Question 25

Linked lists can be used to keep records in ________.

A)logical order
B)physical order
C)sequential order
D)pseudo order

Question 26

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

Question 27

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

Question 28

An important property of B-Trees is that they are balanced to maintain efficient and predictable performance."Balanced" here means that ________.

A)every pointers allows access to the same number of data records
B)the numbers at every level of the B-Tree have the same average value
C)the key field values are the same at every level
D)every data record is the same distance from the top entry of the B-Tree

Question 29

Data structures are typically used to ________.

A)unbalance a B-Tree
B)represent simple and complex networks
C)enhance database security
D)fry an egg

Question 30

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

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)search key

Question 32

In a B-Tree whose top entry contains the values 47 and 88,the middle arrow allows access to all records whose key field values are ________.

A)less than 47
B)greater than 47 and less than 88
C)greater than 47 and less than or equal to 88
D)greater than 88

Question 33

Keys may include all of the following except ________.

A)primary keys
B)unique secondary keys
C)nonunique secondary keys
D)nonunique primary keys

Question 34

What is a linked list?

Question 35

What is a set?

Question 36

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)

Question 37

Each of the following is an example of a data structure except ________.

A)binary relationship
B)sequential list
C)linked list
D)index

Question 38

Simple networks can be represented by using ________.

A)indexes or linked lists
B)linked lists or sequential lists
C)sequential lists or indexes
D)complex networks

Question 39

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