MC	Which statement is CORRECT?	An important application of tree data structures is when they provide a physical index structure to speed up retrieval of records.	correct	DASD stands for data accumulative storage device.	incorrect	DASD stands for database appropriate storage device.	incorrect	DASD stands for directly accumulative storage device.	incorrect	
MC	Which statement is CORRECT?	B-trees are a primary file organization method and directly impact the physical location of records.	incorrect	An unbalanced B-tree allows for additional performance gain by reducing the height of the tree.	incorrect	Search trees are a good alternative to B-trees and B+-trees because they allow for better maintenance.	incorrect	The performance gain of binary search trees over linear search becomes larger as the number of key values increases.	correct	
MC	When can the relative location technique for record organization be problematic?	When there are a lot of relations	incorrect	When there are many different data types	incorrect	When there are a large number of records	incorrect	When there are many missing values in records	correct	
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 statements with regards to indexed sequential file organization is correct?	The search key of a sparse index is a unique key (i.e. a primary key or candidate key).	incorrect	Sparse indexes are generally faster than dense indexes.	incorrect	Entries of dense indexes always refer to a group of records.	incorrect	Dense indexes are more complex to maintain than sparse indexes.	correct	
MC	Which of the following statements with regards to random file organization is correct?	In order to avoid overflow, the hashing algorithm that distributes keys to bucket addresses needs to be carefully chosen.	correct	A higher loading factor leads to less overflow but also more wasted storage space.	incorrect	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	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	Which statement is CORRECT?	B-trees are a primary file organization method and directly impact the physical location of records.	incorrect	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	The performance gain of binary search trees over linear search becomes larger as the number of key values increases.	correct	
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	When can the relative location technique for record organization be problematic?	When there are many different data types	incorrect	When there are many missing values in records	correct	When there are a large number of records	incorrect	When there are a lot of relations	incorrect	
MC	What does DASD stand for?	Database appropriate storage device	incorrect	Directly accumulative storage device	incorrect	Data accumulative storage device	incorrect	Directly accessible storage device	correct