MC	Which of the following statements with regards to random file organization is correct?	Division, a hashing techniques that divides the key by a positive integer M and takes the remainder as the record address, frequently performs very poorly.	incorrect	A higher loading factor leads to less overflow but also more wasted storage space.	incorrect	In order to avoid overflow, the hashing algorithm that distributes keys to bucket addresses needs to be carefully chosen.	correct	Retrieving a record only requires a single block access, more particularly a random block access to the first block of the bucket indicated by the hashing algorithm.	incorrect	
MC	How is a row/tuple translated into an internal data model?	Data item	incorrect	Data set	incorrect	Stored record	correct	Physical storage structure	incorrect	
MC	Which statement is CORRECT?	Search trees are a good alternative to B-trees and B+-trees because they allow for better maintenance.	incorrect	An unbalanced B-tree allows for additional performance gain by reducing the height of the tree.	incorrect	B-trees are a primary file organization method and directly impact the physical location of records.	incorrect	The performance gain of binary search trees over linear search becomes larger as the number of key values increases.	correct	
MC	When translating a logical data model into an internal data model, what should be taken into account?	The physical storage properties	incorrect	The types of operations that will be executed on the data	incorrect	The size of the database	incorrect	All of these aspects should be taken into account	correct	
MC	Which statement is CORRECT?	B-trees are a primary file organization method and directly impact the physical location of records.	incorrect	An advantage of one-way linked lists, where each record contains a pointer to its logical successor, is that not all records must be retrieved any longer, because frequently only part of the list needs to be processed.	incorrect	A search key can be composite, meaning that it can consist of a combination of values	correct	Secondary file organization methods make insertion and deletion of records a lot easier.	incorrect	
MC	In which of these cases can we make use of delimiters to separate attributes?	The data is stored in mixed files	incorrect	Some attributes have data types that can have variable lengths as input	incorrect	Some attributes are multivalued	incorrect	In all of these cases	correct	
MC	Which of the following file organization methods is not a primary file organization method?	Sequential file organization	incorrect	Heap files	incorrect	Hash file organization	incorrect	Linked lists	correct	
MC	Which of the following statements with regards to indexed sequential file organization is correct?	Entries of dense indexes always refer to a group of records.	incorrect	The search key of a sparse index is a unique key (i.e. a primary key or candidate key).	incorrect	Dense indexes are more complex to maintain than sparse indexes.	correct	Sparse indexes are generally faster than dense indexes.	incorrect	
MC	What does DASD stand for?	Directly accumulative storage device	incorrect	Directly accessible storage device	correct	Data accumulative storage device	incorrect	Database appropriate storage device	incorrect	
MC	Which of the following file organization methods is not a primary file organization method?	Linked lists	correct	Heap files	incorrect	Sequential file organization	incorrect	Hash file organization	incorrect