Deck 13: File Structure
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/17
Play
Full screen (f)
Deck 13: File Structure
1
The address produced by a hashing algorithm is the _______ address.
A) probe
B) synonym
C) collision
D) home
A) probe
B) synonym
C) collision
D) home
D
2
If the transaction file key is 20 and the first master file key is 25, then we _______.
A) add the new record to the new master file
B) revise the contents of the old master file
C) delete the data
D) write the old master file record to the new master file
A) add the new record to the new master file
B) revise the contents of the old master file
C) delete the data
D) write the old master file record to the new master file
A
3
In the _______ hashing method, there are no synonyms or collisions.
A) direct
B) modulo division
C) division remainder
D) digit extraction
A) direct
B) modulo division
C) division remainder
D) digit extraction
A
4
After a sequential file is updated, the _______ file contains the most current data.
A) new master
B) old master
C) transaction
D) error report
A) new master
B) old master
C) transaction
D) error report
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
5
In the _______ hashing method, the key is divided by the file size, and the address is the remainder plus 1.
A) direct
B) modulo division
C) division remainder
D) digit extraction
A) direct
B) modulo division
C) division remainder
D) digit extraction
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
6
When a sequential file is updated, the ______ file contains a list of all errors occurring during the update process.
A) new master
B) old master
C) transaction
D) error report
A) new master
B) old master
C) transaction
D) error report
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
7
_______ file can be accessed sequentially.
A) A sequential
B) An indexed
C) A hashed
D) No
A) A sequential
B) An indexed
C) A hashed
D) No
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
8
In the _______ hashing method, selected digits are extracted from the key and used as the address.
A) direct
B) division remainder
C) modulo division
D) digit extraction
A) direct
B) division remainder
C) modulo division
D) digit extraction
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
9
When a sequential file is updated, the ______ file contains the changes to be applied.
A) new master
B) old master
C) transaction
D) error report
A) new master
B) old master
C) transaction
D) error report
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
10
When a sequential file is updated, the ______ file gets the actual update.
A) new master
B) old master
C) transaction
D) error report
A) new master
B) old master
C) transaction
D) error report
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
11
The _______ area is the file area that contains all the home addresses.
A) probe
B) linked
C) hash
D) prime
A) probe
B) linked
C) hash
D) prime
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
12
In the ______ collision resolution method, we try to put data that cannot be placed in location 123 into location 124.
A) open addressing
B) linked list
C) bucket hashing
D) random hashing
A) open addressing
B) linked list
C) bucket hashing
D) random hashing
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
13
_______ are keys that hash to the same location in the data file.
A) Collisions
B) Buckets
C) Synonyms
D) Linked lists
A) Collisions
B) Buckets
C) Synonyms
D) Linked lists
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
14
_______ file can be accessed randomly.
A) A sequential
B) An indexed
C) A hashed
D) Any
A) A sequential
B) An indexed
C) A hashed
D) Any
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
15
The index of an indexed file has _______ fields.
A) two
B) three
C) four
D) any number of
A) two
B) three
C) four
D) any number of
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
16
When a hashing algorithm produces an address for an insertion key and that address is already occupied, it is called a _______.
A) collision
B) probe
C) synonym
D) linked list
A) collision
B) probe
C) synonym
D) linked list
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck
17
If the transaction file key is 20 with a delete code and the master file key is 20, then we _______.
A) add the transaction to the new master file
B) revise the contents of the old master file
C) delete the data
D) write the old master file record to the new master file
A) add the transaction to the new master file
B) revise the contents of the old master file
C) delete the data
D) write the old master file record to the new master file
Unlock Deck
Unlock for access to all 17 flashcards in this deck.
Unlock Deck
k this deck