CSI101(10)
A(n) ____ contains a group of the smallest units that can be accessed on a disk. a. cluster c. NTFS b. file system d. FAT
A
A(n) ____ is a unique value used in hashing algorithms. a. hash key c. directory b. cluster d. overflow area
A
The ____ keeps track of which files are using which clusters. a. file allocation table c. hash key b. directory d. random area
A
Which of the following terms describes an organizational unit within a storage medium that stores files, folders, and subdirectories? a. Directory c. File compression b. Fragmentation d. Volume
A
____ are more compact and faster to access because the system does not have to convert the data. a. Binary files c. Hash files b. Sequential files d. Random files
A
A(n) ____ is the part of the operating system responsible for creating, manipulating, renaming, copying, and removing files to and from storage devices. a. cluster c. overflow area b. file system d. hash key
B
An area in a file that is used in case a collision occurs during the hashing algorithm is called a(n) ____. a. cluster c. reserved area b. overflow area d. random area
B
Clusters are also called ____. a. directories c. algorithms b. allocation units d. overflow areas
B
The ____ improves performance by minimizing movement of the read/write heads. a. file system c. hash key b. disk defragmenter d. directory
B
The ____ is used in NTFS to store data about every file and directory on the volume. a. directory c. cluster b. master file table d. overflow area
B
____ is often referred to as a "journaling" file system because it keeps track of transactions performed when working with files and directories. a. FAT c. MFT b. NTFS d. EFS
B
____ occurs when files have clusters scattered in different locations on the storage medium rather than in contiguous locations. a. Clusterization c. Hashing b. Disk fragmentation d. Disk striping
B
A(n) ____ is a storage location that contains data that is treated as either binary or text. a. cluster c. file b. overflow area d. hash key
C
____ file access allows you to mimic the look of a database table by storing information in the file row by row, similar to a database record. a. Hash c. Sequential b. Binary d. Random
C
____ implies that data is directly read or written anywhere on the disk. a. Sequential access c. Random access b. Hashing d. Collision
C
____ is a common method used for accessing data either in a file or a database table through the use of a unique value. a. Clustering c. Hashing b. Disk fragmenting d. File compression
C
____ provides the ability to assign access rights to files and directories. a. FAT12 c. NTFS b. FAT24 d. FAT32
C
A(n) ____ is a drive or partition on a drive that is formatted with a file system. a. hash algorithm c. hash key b. CPU d. volume
D
The term ____ implies reading and writing data in order, from the beginning. a. random access c. collision b. hashing d. sequential access
D
____ occur when the hashing algorithm generates the same relative key for more than one original key value. a. Clusters c. Compressions b. Directories d. Collisions
D
A hard disk is a sequential access device.
F
All files are stored as text files.
F
An advantage of FAT is that overall performance increases as more files are stored on the partition.
F
FAT has a larger overhead than NTFS.
F
If your hard disk is 10GB or less then you may want to use NTFS because it is more efficient in handling smaller volumes of data.
F
One of the main disadvantages of NTFS is the lack of security.
F
The fastest way to access data is via sequential access.
F
Tracks are contained within sectors.
F
Under FAT, an administrator can specify which individual users or groups or users can perform certain operations on files and directories.
F
A hard disk is the most common place to store files.
T
An advantage of relative file access is that records can be updated in place.
T
An example of a sequential file might be an audio file or video file.
T
NTFS is geared toward a networked environment.
T
Text files consist of ASCII or Unicode characters.
T
The NTFS file management system is used to locate files on a storage medium.
T
The disadvantage of relative file access is that disk space can be wasted if data does not fill the entire record if some of the relative records do not have data.
T
The first Microsoft file system was called the file allocation table.
T
Updating a sequential file requires the entire file to be copied to a new file, modifying the record as it is written to the new file.
T
With respect to FAT, data is stored in 512-byte sectors on the hard drive and depending on the size of the file, the data might occupy one or more sectors.
T
With the FAT file management system, deleting a file does not actually remove it from the hard drive. Instead, a hex value of E5h is placed in the first position of the file name.
T
