MC	Which of the following statements on secondary file organization is correct?	Secondary files only work with atomic attribute types.	incorrect	Using a secondary index increases performance in retrieving records.	correct	Using an inverted file requires an additional sequential block access.	incorrect	When using a non-unique search key, we should use a sparse index.	incorrect	
MC	What does DASD stand for?	Directly accumulative storage device	incorrect	Directly accessible storage device	correct	Database appropriate storage device	incorrect	Data accumulative storage device	incorrect	
MC	Which of the following statements on file organization is not correct?	A heap file organization is very efficient for adding records.	incorrect	When searching a record with a unique search key in a heap file organization, we need on average NBLK/2 sequential block accesses.	incorrect	We can define only one primary file organization method on a file, unless we duplicate the file.	incorrect	A search key can only be a primary key or a candidate key.	correct	
MC	Given following information, which of these statements is correct?<br><br>Average seek time: 7.2 ms<br>Spindle speed: 7600 rpm<br>Transfer rate: 125 MBps<br>Block size: 4096 bytes	T<sub>rba</sub> = 14.5893 ms and T<sub>sba</sub> = 7.3893 ms	incorrect	T<sub>rba</sub> = 11.1836 ms and T<sub>sba</sub> = 3.9836 ms	incorrect	T<sub>rba</sub> = 11.1797 ms and T<sub>sba</sub> = 3.9797 ms	correct	T<sub>rba</sub> = 7.2927 ms and T<sub>sba</sub> = 0.0927 ms	incorrect	
MC	Which of the following statements with regards to random file organization is correct?	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	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	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	Given following information, which of these statements is correct?<br><br>Average seek time: 7.2 ms<br>Spindle speed: 7600 rpm<br>Transfer rate: 125 MBps<br>Block size: 4096 bytes	T<sub>rba</sub> = 11.1797 ms and T<sub>sba</sub> = 3.9797 ms	correct	T<sub>rba</sub> = 14.5893 ms and T<sub>sba</sub> = 7.3893 ms	incorrect	T<sub>rba</sub> = 11.1836 ms and T<sub>sba</sub> = 3.9836 ms	incorrect	T<sub>rba</sub> = 7.2927 ms and T<sub>sba</sub> = 0.0927 ms	incorrect	
MC	How is a row/tuple translated into an internal data model?	Physical storage structure	incorrect	Data set	incorrect	Stored record	correct	Data item	incorrect	
MC	Which of the following statements on file organization is correct?	In a binary search tree, each node has at least two children. 	incorrect	A B-tree is more efficient for range queries than a B+-tree. 	incorrect	A B-tree cannot deal with a non-unique search key. 	incorrect	In a binary search tree, the search space is narrowed by navigating the tree, choosing left or right in each node. 	correct	
MC	Which statement is CORRECT?	A search key can be used to retrieve all records of which a certain attribute type falls within a range	correct	An inverted file defines an index over a unique, ordered search key of the data set.	incorrect	Search trees are a good alternative to B-trees and B+-trees because they allow for better maintenance.	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