[F5-FORMATIVE] Fifth Formative Assessment

The system stores information by recording it ______ on the sector under the read-write head.

Group of answer choices

mentally

logically

magnetically

mechanically

magnetically

The disk surface is logically divided into _____, which are subdivided into sectors.

Group of answer choices

tracks

bits

patterns

waves

tracks

Modern disks are addressed as large one-dimensional arrays of logical blocks, where the ______ is the smallest unit of transfer.

Group of answer choices

sector block

local block

logical block

physical block

logical block

_______ was used as an early secondary-storage medium, but the access time is much slower than for disks.

Group of answer choices

video tape

Magnetism tape

electrical tape

Magnetic Tape

Magnetic Tape

The main requirement of secondary storage is to be able to store very large amount of data _______

Group of answer choices

sometime

permanently

temporarily

everyday

permanently

Each disk platter has a flat _______ shape, like a phonograoh record.

Group of answer choices

circular

triangular

oval

square

circular

LOOK disk scheduling algorithm is sometimes called the elevator algorithm

Group of answer choices

True

False

False

A ________ movable-head system has only one read-write head per surface and the system moves the head to access a particular track

Group of answer choices

Movable-Joint System

Movable-Head system

Fixed-Head System

Rotational-head system

Movable-Head system

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-LOOK (going higher tracks direction), how many THM?

Group of answer choices

59 tracks

29 tracks

48 tracks

18 tracks

29 tracks

It is a way to read and write data on disks, where the number of bits per track is uniform (constant number of sectors).

Group of answer choices

Constant Angular Velocity

Constant Line Velocity

Constant Angle Velocity

Constant Linear Velocity

Constant Angular Velocity

One or more blocks that are unreadable or not writable

Group of answer choices

Bug block

Closed block

Boot block

Bad block

Bad block

The size of a logical block is usually ____ bytes.

Group of answer choices

64

512

125

215

512

______ are rigid metal or glass platters covered with magnetic recording material.

Group of answer choices

Compact Disc

Disks

Flash Drive

Video tape

Disks

A _______ has a separate read-write head for each track.

Group of answer choices

Magnetic tape

Movable-head system

Rotational-head system

Fixed-head system

Fixed-head system

It is the time it takes to actually transfer data between disk and main memory.

Group of answer choices

Latency Time

Transfer time

Rotation time

Seek time

Transfer time

Which of the given is considered aspects of disk management for which an operating system is responsible.

Group of answer choices

Bad-block recovery

disk formatting

Booting from disk

all of these

all of these

It is the time it takes to move the read-write head to the correct track.

Group of answer choices

Latency time

Rotation time

Seek time

Transfer time

Seek time

A typical hard disk have a rotation speed from __

Group of answer choices

3500 to 7200

4500 to 7200

3500 to 6200

500 to 1200

4500 to 7200

The Shortest Seek Time First disk scheduling selects the request with the minimum seek time from the current head position.

Group of answer choices

True

False

True

The Shortest Seek Time First disk scheduling selects the request with the maximum seek time from the current head position.

Group of answer choices

True

False

False

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SCAN, what is the last served track request?

Group of answer choices

track 99

track 98

track 0

track 1

track 98

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using FCFS, what is the first served track request?

Group of answer choices

track 98

track 99

track 1

track 0

track 98

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SCAN (heading towards 0 point), what is the first served track from the initial head position?

Group of answer choices

track 24

track 1

track 99

track 0

track 0

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using FCFS, what is the last served track request?

Group of answer choices

track 0

track 1

track 99

track 24

track 24

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SCAN (heading towards 0 point), what is the last served track request?

Group of answer choices

track 0

track 38

track 99

track 67

track 99

In C-SCAN scheduling, when it reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.

Group of answer choices

True

False

True

The First Come First Served disk scheduling selects the request according to the order in the disk queue

Group of answer choices

True

False

True

Since most jobs depend heavily on the disk for loading and input and output files, it is important that disk service be as fast as possible.

Group of answer choices

True

False

True

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using FCFS, how many THM?

Group of answer choices

98 tracks

130 tracks

99 tracks

131 tracks

99 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SCAN (heading towards 0 point), how many THM?

Group of answer choices

48 tracks

49 tracks

98 tracks

99 tracks

49 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-SCAN (going lower tracks direction), what is the farthest distance between 2 tracks?

Group of answer choices

130 tracks

98 tracks

121 tracks

143 tracks

98 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going higher tracks direction), what is the first served track request?

Group of answer choices

track 14

track 79

track 99

track 24

track 14

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using FCFS, what is the first served track request?

Group of answer choices

track 39

track 99

track 0

track 10

track 39

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going lower tracks direction), what is the last served track request?

Group of answer choices

99 tracks

98 tracks

130 tracks

143 tracks

98 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-SCAN (going lower tracks direction), what is the farthest distance between 2 tracks?

Group of answer choices

44 tracks

30 tracks

29 tracks

43 tracks

43 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going lower tracks direction), what is the last served track request?

Group of answer choices

98 tracks

85 tracks

130 tracks

143 tracks

98 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-SCAN (going lower tracks direction), what is the shortest distance between 2 tracks?

Group of answer choices

1 track

2 tracks

4 tracks

3 tracks

1 track

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-SCAN (going lower tracks direction), what is the farthest distance between 2 tracks?

Group of answer choices

102 tracks

39 tracks

99 tracks

42 tracks

99 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SCAN (heading towards 0 point), how many THM?

Group of answer choices

190 tracks

108 tracks

148 tracks

130 tracks

190 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-LOOK (going lower tracks direction), how many THM?

Group of answer choices

146 tracks

159 tracks

148 tracks

143 tracks

143 tracks

It is a way to read and write data on disks, where the density of bits (bits/unit length) per track is uniform.

Group of answer choices

Constant Linear Velocity

Constant Angular Velocity

Constant Line Velocity

Constant Circular Velocity

Constant Linear Velocity

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going higher tracks direction), what is the last served track request?

Group of answer choices

track 38

track 99

track 39

track 98

track 38

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going higher tracks direction), what is the last served track request?

Group of answer choices

track 98

track 24

track 53

track 16

track 16

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going higher tracks direction), how many THM?

Group of answer choices

147 tracks

130 tracks

143 tracks

148 tracks

148 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SCAN (heading towards 0 point), how many THM?

Group of answer choices

190 tracks

130 tracks

108 tracks

148 tracks

130 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going lower tracks direction), what is the first served track request?

Group of answer choices

99 tracks

24 tracks

16 tracks

53 tracks

24 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SSTF, what is the last served track request?

Group of answer choices

track 0

track 67

track 99

track 38

track 38

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using FCFS, what is the last served track request?

Group of answer choices

track 17

track 0

Track 16

track 99

track 17

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-SCAN (going lower tracks direction), how many THM?

Group of answer choices

130 tracks

141 tracks

177 tracks

156 tracks

177 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-LOOK (going lower tracks direction), how many THM?

Group of answer choices

48 tracks

54 tracks

59 tracks

43 tracks

54 tracks

An incident where the head contacts the disk surface, the head will scrape the recording medium off the disk.

Group of answer choices

Head accident

Head crushes

Head bang

Head crashes

Head crashes

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SSTF, what is the first served track request?

Group of answer choices

track 0

track 1

track 99

track 24

track 24

These disks are coated with a hard surface, so the read-write head scans it directly on the disk surface without destroying the data.

Group of answer choices

flappy disks

Blu-ray discs

compact discs

floppy disks

floppy disks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using FCFS, how many THM?

Group of answer choices

131 tracks

98 tracks

99 tracks

130 tracks

99 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-SCAN (going lower tracks direction), how many THM?

Group of answer choices

156 tracks

194 tracks

130 tracks

175 tracks

194 tracks

One of the earliest secondary-storage media is the _______.

Group of answer choices

Magnetic Tape

Compact Disc

Duct Tape

Floppy Disk

Magnetic Tape

A ______ disk system has several disk platters.

Group of answer choices

Electrical

Soft

Magnetic

Hard

Magnetic

In a disk the information is recorded on the __

Group of answer choices

outside

inside

edge

surface

surface

A disk normally has a device _______ indicating which files are on the disk.

Group of answer choices

cabinet

housing

block

directory

directory

It provides the bulk of secondary storage for modern computer systems.

Group of answer choices

RAM

Magnetic Disk

Cache memory

Registers

Magnetic Disk

It is the time it takes for the sector to rotate under the head.

Group of answer choices

Transfer Time

Latency time

Rotation time

Seek time

Latency time

SCAN disk scheduling algorithm is sometimes called the elevator algorithm

Group of answer choices

True

False

True

The OS can improve on the average disk service time by scheduling the requests for disk access.

Group of answer choices

True

False

True

C-SCAN scheduling essentially treats the disk as though it were circular where the last track is adjacent to the first one.

Group of answer choices

True

False

True

The Look disk scheduling selects the request with the minimum seek time from the current head position.

Group of answer choices

True

False

False

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going higher tracks direction), how many THM?

Group of answer choices

143 tracks

130 tracks

148 tracks

147 tracks

130 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using SSTF, what is the last served track request?

Group of answer choices

track 1

track 99

track 98

track 0

track 98

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using C-SCAN (going lower tracks direction), what is the farthest distance between 2 tracks?

Group of answer choices

99 tracks

69 tracks

39 tracks

102 tracks

99 tracks

Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 98, 53, 22, 16, 24. Consider that the read write head is positioned at location 32. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using FCFS, how many THM?

Group of answer choices

156 tracks

53 tracks

130 tracks

98 tracks

156 tracks

Directions: Given the following track requests in the disk queue compute for the total head movement (THM) of the R/W Head 39, 14, 38, 17. Consider that the read write head is positioned at location 10. Compute for the total head movement for a 100 (0 - 99) track disk for each disk scheduling algorithm.

Using LOOK (going higher tracks direction), what is the first served track request?

Group of answer choices

track 24

track 79

track 99

track 14

track 14