Storage and File Structures set 1

1 Que: _________ is around one-half of the maximum seek time.
a. Access time  
b. Average seek time  
c. Seek time
d. Rotational latency time
2 Que: _________ is the time from when a read or write request is issued to when data transfer begins.
a. Access time    
b. Average seek time
c. Seek time
d. Rotational latency time
3 Que: __________ is a contiguous group of blocks allocated for use as part of a table, index, and so forth.  
a. Tablespace  
b. Segment
c. Extent
d. Block
4 Que:  __________ is increasingly being used in server systems to improve performance by caching frequently used data, since it provides faster access than disk, with larger storage capacity than main memory.
a. Flash memory      
b. Disk  
c. Main memory
d. Secondary memory  
5 Que: ___________ is popular for applications such as storage of log files in a database system, since it offers the best write performance.
a. RAID level 1      
b. RAID level 2  
c. RAID level 0
d. RAID level 3  
6 Que: ______________ partitiones data and parity among all N+1 disks, instead of storing data in N-disks and parity in one disk.
a. Block interleaved parity       
b. Block interleaved distributed parity  
c. Bit parity
d. Bit interleaved parity
7 Que: ______________ which increases the number of I/O operations needed to write a single logical block, pays a significant time penalty in terms of write performance.
a. RAID level 1         
b. RAID level 2
c. RAID level 5
d. RAID level 3
8 Que: ___________________ frees the space occupied by a block as soon as the final tuple of that block has been processed.
a. Replacement strategy    
b. Forced strategy
c. Toss immediate strategy
d. Most recently used  
9 Que: A ____ Contains the smallest unit of meaningful data, so you might call it the basic building block for a data file.
a. File structure      
b. Records
c. Fields
d. Database  
10 Que: A _____ Contains fields of data about one entity.
a. Record      
b. File
c. Fields
d. Document