MC	When can the relative location technique for record organization be problematic?	When there are a large number of records	incorrect	When there are many missing values in records	correct	When there are many different data types	incorrect	When there are a lot of relations	incorrect	
MC	What does DASD stand for?	Data accumulative storage device	incorrect	Directly accessible storage device	correct	Directly accumulative storage device	incorrect	Database appropriate storage device	incorrect	
MC	Which statement is NOT CORRECT?	DASD stands for directly accessible storage device.	incorrect	A search key determines the criteria for retrieving records	incorrect	The performance gain of binary search trees over linear search becomes larger as the number of key values increases.	incorrect	DASD stands for data accumulative storage device.	correct	
MC	Which statement is CORRECT?	The performance gain of binary search trees over linear search becomes larger as the number of key values increases.	correct	A search key needs to be a unique identifier of a record	incorrect	DASD stands for database appropriate storage device.	incorrect	B-trees are a primary file organization method and directly impact the physical location of records.	incorrect	
MC	Which statement is NOT CORRECT?	The performance gain of binary search trees over linear search becomes larger as the number of key values increases.	incorrect	An inverted file defines an index over a unique, ordered search key of the data set.	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 can be composite, meaning that it can consist of a combination of values	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	A search key can only be a primary key or a candidate key.	correct	We can define only one primary file organization method on a file, unless we duplicate the file.	incorrect	
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	Which of the following statements on list data organization is not correct?	If one of the pointers is lost in a one-way linked list, we cannot reconstruct the file.	incorrect	In a tree data structure, the physical position of the records may express the tree structure. The records are then stored from left to right, top to bottom.	incorrect	A tree structure can also be implemented using a linked list. In this way, the hierarchy is no longer physically represented but by means of pointers.	correct	Pointers of a one way linked list can be stored in a separate directory, which allows for faster navigation.	incorrect	
MC	Which of the following statements with regards to indexed sequential file organization is correct?	Dense indexes are more complex to maintain than sparse indexes.	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	
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