Module 5 Flashcards
1
Q
A system that has several disk platters made of metal or glass with a flat circular shape.
A
Magnetic Disk System
2
Q
Where is the information stored in a magnetic disk?
A
In a magnetic recording material covering the two surfaces.
3
Q
The disk surface is divided into ________ then subdivided into ________.
A
divided into TRACKS then subdivided into SECTORS
4
Q
True or False
In a Disk Structure, the head doesn’t touch the disk surface but it floats microns above supported by a cushion of air.
A
True
5
Q
What is the typical rotation speed of hard disks?
A
4500 to 7500 rpm.
6
Q
True or False
In a hard disk, the faster the disk rotation, the higher the transfer rate.
A
True
7
Q
True or False
If a hard disk rotates faster, it also becomes louder and hotter.
A
True
8
Q
True or False
Modern hard disks read all sectors of a track in one turn (Interleave 1:1)
A
True
9
Q
In modern hard disks, the rotation speed is _______.
A
Constant
10
Q
It is when the head contacts the disk surface, scraping the recording medium off the disk, destroying data.
A
Head crashes
11
Q
It is one of the earliest secondary-storage media.
A
Magnetic Tape
12
Q
It was too slow compared with the access time of main memory and slower than disks.
A
Magnetic Tape
13
Q
It is currently used mainly for backup, rarely useful information, and for transferring information.
A
Magnetic Tape
14
Q
It provides the bulk of secondary storage for modern computers.
A
Magnetic Disks
15
Q
In a magnetic disk, information is recorded ______________ on the sector under the read-write head.
A
Magnetically
16
Q
A __________ system has a separate read-write head for each track.
A
Fixed-head system
17
Q
This system allows the computer to switch from track to track quickly/
A
Fixed-head system
18
Q
This system requires a large number of heads, making it expensive.
A
Fixed-head system
19
Q
A _______________ system has only one read-write head per surface and the system moves the head to access a particular track (slower but less expensive).
A
Moveable-head system
20
Q
All the tracks on one drive that can be accessed without moving the heads are called a _______.
A
Cylinder
21
Q
____________ are coated with a hard surface, so the read-write head scans it directly on the disk surface without destroying the data.
A
Floppy Disks
22
Q
One of the most commonly used floppy diskettes capable of storing 1.44 MB of data.
A
3.5” floppy diskette
23
Q
How much data can a 3.5” floppy diskette store?
A
1.44 MB
24
Q
A disk normally has a _________ indicating which files are on the disk.
A
Device directory
25
The directory lists the file by ________, and includes necessary information.
Name
26
The system stores the disk directory on the device, often at some ________.
Fixed disk address
27
Modern disks are addressed as ______________________ of logical blocks, the smallest unit of transfer, typically 512 bytes.
Large one-dimensional arrays
28
In modern disks, what is the smallest unit of transfer?
512 bytes
29
Some disks can be _________________ to choose another size such as 1024 bytes.
Low-level formatted
30
What are the two ways of reading and writing data on disks?
- Constant Linear Velocity (CLV)
- Constant Angular Velocity (CAV)
31
The density of bits (bits/unit length) per track is uniform.
Constant Linear Velocity (CLV)
32
The outer tracks are longer with more bits than inner tracks, there are more sectors on the outer tracks.
Constant Linear Velocity (CLV)
33
The drive increases its rotation speed as the head from the outer to the inner tracks to keep the same rate of data moving the head.
Constant Linear Velocity (CLV)
34
This method is used in CD-ROM and DVD-ROM drives.
Constant Linear Velocity (CLV)
35
The number of bits per track is uniform (constant number of sectors).
Constant Angular Velocity (CAV)
36
This means that the density of bits per track increases from outer tracks to inner tracks.
Constant Angular Velocity (CAV)
37
This implies that the disk rotation stays constant.
Constant Angular Velocity (CAV)
38
This method is used in hard disks and floppy disks.
Constant Angular Velocity (CAV)
39
The time it takes to access a sector depends on:
(SLT)
- Seek Time
- Latency Time
- Transfer Time
40
It is the time it takes to move the read-write head to the correct track.
Seek Time
41
It is the time it takes for the sector to rotate under the head.
Latency Time
42
It is the time it takes to actually transfer data between disk and main memory.
Transfer Time
43
Aspects of Disk Management:
- Disk Formatting
- Boot Block
- Bad Blocks
44
Before a computer can make use of a new disk, the disk must be broken into the sectors that the computer can understand. What is this process called?
Physical Formatting
45
When formatted, a disk consists of a set of sectors on each track the head can address.
Disk Formatting
46
Each sector has a header containing the sector number and space for ____________.
Error Correcting Code (ECC)
47
Each sector has a header containing the sector number and space for Error Correcting Code (ECC).
Disk Formatting
48
This program initializes all aspects of the system, from CPU registers to device controllers to memory contents.
Bootstrap program
49
The __________ program initializes all aspects of the system.
Bootstrap program
50
Disks have moving parts and small tolerances so they are __________.
Prone to failure
51
This means that the disk needs to be replaced or one or more blocks become unreadable and not writable.
Bad Blocks
52
True or False
In Free Space Management, it is necessary to reuse space from deleted files for new files.
True
53
To keep track of the free disk space, the system maintains a ____________.
Free-space list
54
The four implementations of the free-space list are:
- Bit Vector
- Linked List
- Grouping
- Counting
55
True or False
In Bit Vector, a single bit represents each block.
True
56
True or False
If the block is free, the bit is 0; otherwise, the bit is 1.
True
57
What is the main disadvantage of Bit Vector?
The bit map is kept in the main memory
58
This approach is to link all the free disk blocks together, keeping a pointer to the first free block.
Linked List
59
In Linked List, the approach is to link all the free disk blocks together, keeping a pointer to the ___________.
First free block
60
This technique is not efficient because of the sequential nature of lists.
Link List
61
In Grouping, a modification of the free-list approach is to store the _____________ in the first free block.
addresses of n free blocks
62
True or False
In Grouping, the first n-1 is free.
True
63
True or False
In Grouping, the last one is the address of another block with the addresses of another n free blocks.
True
64
True or False
In Grouping, the addresses of a large number of free blocks can be found quickly.
True
65
This approach is to consider that several contiguous blocks may be allocated or freed simultaneously.
Counting
66
True or False
In Counting, rather thank keeping a list, the system keeps the address of the first free block and the number of free contiguous blocks that follow the first block.
True
67
In Counting, each entry in the free-space list consists of ____________.
A disk address and a count
68
What are the Allocation Methods:
(LIC)
- Linked-List Allocation
- Indexed Allocation
- Contiguous Allocation
69
This allocation method requires each file to occupy a set of contiguous addresses in the disk.
Contiguous Allocation
70
True or False
In Contiguous Allocation, if the file is "n" blocks long, starts at location "b", it occupies blocks b, b+1, b+2, ..., b + n - 1.
True
71
In Contiguous Allocation, the ___________ indicates the address of the starting block (b) and the length of the area allocated for this file (n).
Directory Entry
72
True or False
In Linked-List allocation, each files is a linked list of disk blocks; these may be scattered anywhere on the disk.
True
73
In Linked-List allocation, the ________ contains a pointer to the first and last blocks of the file. Each block contains a pointer to the next block.
Directory
74
True or False
In Linked-List allocation, there is no external fragmentation.
True
75
In Linked-List allocation, any free block on the free-space list can be used to _________.
Satisfy a request.
76
True or False
In Linked-List allocation, a file can continue to grow as long as there are free blocks.
True
77
True or False
A disadvantage of Linked-List allocation is that pointers also occupy disk space.
True
78
A variation of Linked-List allocation is the use of ___________.
File-Allocation Table (FAT)
79
This table has one entry for each disk block and is indexed by block number.
File-Allocation Table (FAT)
80
This allocation is similar to Linked-List allocation except the pointers to the blocks are not scattered but are grouped in one location which is the index block.
Indexed Allocation
81
In Indexed allocation, each file has its own index block, which is an array of ___________ addresses.
Diskblock addresses
82
Indexed allocation supports direct access, without suffering from ________________.
External fragmentation
83
In Indexed allocation, the _____________________ is greater than the Linked-List allocation.
Pointer overhead
84
True or False
In Indexed allocation, the OS must allocate an entire index block, even if one or two pointers will be non-nil.
True
85
True or False
The OS can improve on the average disk service time by scheduling the requests for disk access.
True
86
In Disk Scheduling, if the desired disk drive and controller are __________, it can service that request immediately.
Available
87
In Disk Scheduling, if the drive or controller is serving on request, any additional requests, normally from other processes, should go to a ________.
Queue
88
What are the Disk Scheduling Algorithms:
- First-come First-served (FCFS) Scheduling
- Shortest Seek Time First (SSTF) Scheduling
- SCAN Scheduling
- C-SCAN Scheduling
- LOOK Scheduling
- C-LOOK Scheduling
89
This is the simplest form of scheduling.
FCFS Scheduling
90
This scheduling selects the request with the minimum seek time from the current head.
SSTF Scheduling
91
In SSTF Scheduling, the system moves the head to the __________________ in the request queue.
Closest Track
92
The problem with SSTF Scheduling is that it may cause _________ of some requests.
Starvation
93
True or False
In theory, SSTF Scheduling can have a continual stream of requests near one another could arrive, causing the request for a farther track to wait indefinitely.
True
94
The _________ algorithm, although a substantial improvement over the FCFS algorithm, is not optimal.
SSTF Algorithm
95
In _______ scheduling, the read-write head starts at one end of the disk, servicing requests as it reaches each track, until it gets to the other end.
SCAN Scheduling
96
In SCAN scheduling, the direction of head movement reverses and servicing _______________, at the other end.
Continues
97
It is also called the elevator algorithm, since it is similar to the behavior of elevators as they service requests to move from floor to floor.
SCAN Scheduling
98
This algorithm is a variant of SCAN scheduling.
Circular-SCAN (C-SCAN) Scheduling
99
This scheduling moves the head from one end of the disk to the other, servicing requests as it goes.
C-SCAN Scheduling
100
When this scheduling reaches the other end, it immediately returns to the beginning of the disk without servicing the ones in a return trip/
C-SCAN Scheduling
101
This scheduling treats the disk as though it were circular, with the last track adjacent to the first one.
C-SCAN Scheduling
102
In these scheduling, the head always moves from one end of the disk to the other.
SCAN and C-SCAN Scheduling
103
In these scheduling, the head only moves as far as the last request in each direction.
LOOK and C-LOOK Scheduling
104
These scheduling are more appropriate for systems that place a heavy load on the disk.
SCAN and C-SCAN Scheduling
105
If the queue sometimes has more than one outstanding request, then all scheduling algorithms are effectively equivalent. In this case, ____________ scheduling is a reasonable algorithm due to its simplicity.
FCFS Scheduling
