True/False Indicate whether the
statement is true or false.
|
|
|
1.
|
The universal serial bus (USB) controller acts as an interface between the
operating system, device drivers, and applications and the devices that are attached via the USB
host.
|
|
|
2.
|
On a magnetic tape, the inter-record gap (IRG) is about two inches long
regardless of the sizes of the records it separates.
|
|
|
3.
|
Direct access storage devices (DASDs) are devices that can directly read or
write to a specific place on a disk.
|
|
|
4.
|
A fixed-head disk is lower in cost than a movable head disk.
|
|
|
5.
|
Among the many differences between an optical disc and a magnetic disk is the
design of the disc track and sectors.
|
|
|
6.
|
An optical disc drive adjusts the speed of the disc’s spin to compensate
for the sector’s location on the disc—this is called continuous linkage velocity
(CLV).
|
|
|
7.
|
A DVD with a fast data transfer rate will drop fewer frames when playing back a
recorded video segment than will a unit with a slower transfer rate.
|
|
|
8.
|
Blu-ray discs are available in several formats: read-only (BD-ROM), recordable
(BD-R), and rewritable (BD-RE).
|
|
|
9.
|
Each unit in the I/O subsystem can finish its operation independently from the
others.
|
|
|
10.
|
Buffers are used extensively to better synchronize the movement of data between
the relatively slow I/O devices and the very fast CPU.
|
|
|
11.
|
The traffic controller maintains a database containing the status and
connections for each unit in the I/O subsystem, grouped into Channel Control Blocks, Control Unit
Control Blocks, and Device Control Blocks.
|
|
|
12.
|
A find strategy determines the order in which the processes get the I/O handler
device, and the goal is to keep seek time to a minimum.
|
|
|
13.
|
First-come, first-served (FCFS) is the simplest device-scheduling
algorithm.
|
|
|
14.
|
The SCAN algorithm moves the arm methodically from the inner to the outer track,
servicing every request in its path.
|
|
|
15.
|
RAID is a set of logical disk drives that is viewed as a single physical
unit by the operating system.
|
|
|
16.
|
Most RAID configurations require fewer disk drives, which decreases hardware
costs.
|
|
|
17.
|
RAID Level 0 is the only one that does not provide error correction, or
redundancy, and so it is not considered a true form of RAID because it cannot recover from hardware
failure.
|
|
|
18.
|
The advantage of RAID Level 3 is that if any one drive fails, data can be
restored using the bits in the parity disk.
|
|
|
19.
|
Additional complex configurations of RAID can be created by combining multiple
levels.
|
Multiple Choice Identify the
choice that best completes the statement or answers the question.
|
|
|
20.
|
____ devices are assigned to only one job at a time.
a. | Dedicated | c. | Virtual | b. | Shared | d. | Static |
|
|
|
21.
|
The USB controller assigns bandwidth to each device depending on its priority,
and the ____ priority is assigned to real-time exchanges where no interruption in the data flow is
allowed, such as video or sound data.
a. | highest | c. | lowest | b. | medium | d. | standard |
|
|
|
22.
|
The number of characters that can be recorded per inch on a magnetic tape is
determined by the ____ of the tape.
a. | width | c. | density | b. | length | d. | parity |
|
|
|
23.
|
If the transport speed for a magnetic tape is 200 inches per second and the
density is 1600 bpi, a total of ____ bytes can be transferred in one second.
a. | 3,200 | c. | 320,000 | b. | 32,000 | d. | 3,200,000 |
|
|
|
24.
|
It takes 2.5 minutes to reach the last record on a tape, ____ is the average
access time.
a. | .5 minutes | c. | 1.25 minutes | b. | 1 minute | d. | 2 minutes |
|
|
|
25.
|
In a fixed-head magnetic disk, each circle is called a ____.
a. | sector | c. | track | b. | block | d. | platter |
|
|
|
26.
|
Movable-head magnetic disks, such as the computer hard drive, have ____
read/write head(s).
|
|
|
27.
|
The advent of optical discs was made possible by developments in ____
technology.
a. | magnetic | c. | storage | b. | laser | d. | silicone |
|
|
|
28.
|
On an optical disc, all sectors are ____.
a. | of varying sizes depending upon where you are on the disc | b. | larger as you move
to the edge | c. | smaller as you move to the edge | d. | of the same size throughout the
disc |
|
|
|
29.
|
The data-transfer rate for an optical disc is measured in ____ per second and
refers to the speed at which massive amounts of data can be read from the disc.
a. | kilobytes | c. | gigabytes | b. | megabytes | d. | terabytes |
|
|
|
30.
|
To put data on an optical disc requires a high-intensity laser beam, which burns
indentations, called pits, and flat areas, called ____.
a. | lands | c. | hills | b. | valleys | d. | lakes |
|
|
|
31.
|
The software used to create a CD-R uses a standard format, such as ____, which
automatically checks for errors and creates a table of contents, used to keep track of each
file’s location.
a. | CD 1000 | c. | AMC 22 | b. | ISA 9102 | d. | ISO 9096 |
|
|
|
32.
|
A dual-layer, single-sided DVD can hold the equivalent of ____ CDs.
|
|
|
33.
|
Data recorded on fixed-head DASDs may or may not be blocked at the discretion of
the ____.
a. | end user | c. | operator | b. | application programmer | d. | database
administrator |
|
|
|
34.
|
Of the three components of access time in a movable-head DASDs, ____ is the
longest.
a. | seek time | c. | transfer time | b. | search time | d. | delay time |
|
|
|
35.
|
____ control the transfer of information between the disk drives and the rest of
the computer system.
a. | System controllers | c. | System interfaces | b. | Disk drive controllers | d. | Disk drive
interfaces |
|
|
|
36.
|
The I/O ____ allocates the devices, control units, and channels.
a. | scheduler | c. | device handler | b. | traffic controller | d. | director |
|
|
|
37.
|
____ uses the same underlying philosophy as shortest job next, where the
shortest jobs are processed first and longer jobs are made to wait.
|
|
|
38.
|
The RAID level ____ uses word parity for error correction.
|
|
|
39.
|
The RAID level ____ requires two different parity calculations.
|