MC	What does DASD stand for?	Database appropriate storage device	incorrect	Directly accumulative storage device	incorrect	Directly accessible storage device	correct	Data accumulative storage device	incorrect	
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	How is a row/tuple translated into an internal data model?	Data item	incorrect	Stored record	correct	Data set	incorrect	Physical storage structure	incorrect	
MC	When can the relative location technique for record organization be problematic?	When there are many missing values in records	correct	When there are a large number of records	incorrect	When there are many different data types	incorrect	When there are a lot of relations	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	Why is the blocking factor important to know?	For calculating the seek time of a hard disk drive	incorrect	For achieving efficient access to records	correct	For determining the maximum size of the database	incorrect	For none of these reasons	incorrect	
MC	Which statement is NOT CORRECT?	A search key can be composite, meaning that it can consist of a combination of values	incorrect	A search key needs to be a unique identifier of a record	correct	A search key can be used to retrieve all records of which a certain attribute type falls within a range	incorrect	A search key determines the criteria for retrieving records	incorrect	
MC	Which of the following file organization methods is not a primary file organization method?	Linked lists	correct	Sequential file organization	incorrect	Heap files	incorrect	Hash file organization	incorrect	
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	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	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	
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 statement is CORRECT?	Secondary file organization methods make insertion and deletion of records a lot easier.	incorrect	An important application of tree data structures is when they provide a physical index structure to speed up retrieval of records.	correct	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	An inverted file defines an index over a unique, ordered search key of the data set.	incorrect	
MC	Which statement is CORRECT?	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	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