ZuoTi.Pro
Question

A disk scheduling method that stops at needed tracks in a single direction is O B. C-SCAN CSCAN D.LOOK QUESTION8 of a disk involves the movement of the disk head and the time it takes for it to settle to a stop. OA Rotational Latency O B. Transfer Time CRotational Delay O D.Seek Time
engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Answer 1- The answer is SCAN. As in SCAN disk algorithm, the disk arm starts at one end and moves toward the other end in a particular direction, servicing requests as it reaches each cylinder, until it gets to the other end of the disk. At the other end, the direction of the head movement is reversed, and servicing continues. The head continuously scans back and forth across the disk.

Answer 2- The answer is SEEK TIME. The seek time is the time taken to locate the disk arm to a specified track where the data is to be read or write. Simply put, the seek time is the time for the disk arm to move the heads to cylinder containing the desired sector.

0 0
Add a comment
Know the answer?
Add Answer to:
A disk scheduling method that stops at needed tracks in a single direction is O B....
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of...

    Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of tracks on one side of platter: 30,000; number of sectors per track: 600; seek time: one ms for every hundred tracks traversed. Let the disk receive a request to access a random sector on a random track and assume the disk head starts at track 0. a. What is the average seek time? b. What is the average rotational latency? c. What is the transfer time...

  • single-platter disk

    Question DetailsConsider a single-platter disk with the following parameters:rotation speed: 7200 rpm; number of tracks on one side ofplatter:30,000; number of sectors per track:600;seek time: one msfor every hundred tracks traversed. Let the disk receive a requestto access a random sector on a random track and assume the diskhead starts at track0.a) What is the average seek time?b) What is the average rotational latency?c) What is the transfer time for a sector?d) What is the total average time to satisfy...

  • (a) Describe the three fundamental ways for performing I/O and compare their advantages and disadvantages. b)...

    (a) Describe the three fundamental ways for performing I/O and compare their advantages and disadvantages. b) A hard disk rotates at 15,000 rpm and has 1024 tracks, each with 2048 sectors. It takes 100 ms for the head to cross 1024 racks. Assume that the head is above the innermost track. i. What is the average seek time? ii. What is the average rotational delay (latency)? iii. What is the transfer time for one sector? You can round the result...

  • Write a  program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN d. C-SCAN Your program will service a disk with 5,000 cylinders numbered 0 to 4,999. The program will...

    Write a  program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN d. C-SCAN Your program will service a disk with 5,000 cylinders numbered 0 to 4,999. The program will be passed the initial position of the disk head (as a parameter on the command line) and report the total amount of head movement and total number of change of direction required by each algorithm under each of the following cases: a)The program will generate a random...

  • Write a java program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN...

    Write a java program that implements the following disk-scheduling algorithms: a. FCFS b. SSTF c. SCAN Your program will service a disk with 5000 cylinders numbered 0 to 4999. The program will generate a random series of 1,000 cylinder requests and service them according to each of nth algorithms listed above. The program will be passed the initial position of the disk head and report the total amount of head movement required by the algorithm.

  • 9. a. What are the advantages of using a glass substrate for a magnetic disk? b....

    9. a. What are the advantages of using a glass substrate for a magnetic disk? b. How are data written and read onto/from a magnetic disk? c. What common characteristics are shared by all RAID levels? Describe the seven RAID levels with appropriate illustrations. Explain the term striped data. How is redundancy achieved in a RAID system? d. Consider a 4-drive, 200GB-per-drive RAID array. What is the available data storage capacity for each of the RAID levels 0, 1, 3,...

  • Question 12 Consider a magnetic disk drive with 10 double sided platters, 512(=2^9) tracks per surface,...

    Question 12 Consider a magnetic disk drive with 10 double sided platters, 512(=2^9) tracks per surface, and 1024 (=2^10) sectors per track. Sector size is 2KBytes (=2^10 Bytes ). Assume the average seek time 0.02 ms, the seek time from a track to its adjacent track can be ignored. The drive rotates at 5400 rpm. Successive tracks in a cylinder can be read without head movement. Furthermore, disks can be handled independently, so multiple tracks in a cylinder can be...

  • I/O Scheduling Algorithms a) For each of the following scheduling algorithms, give a 1-2 sentence description...

    I/O Scheduling Algorithms a) For each of the following scheduling algorithms, give a 1-2 sentence description of how it works. The description should be precise enough to distinguish each algorithm from the others. Algorithms: FCFS, SSTF, SCAN, C-SCAN, C-LOOK. (1 point) b) Given a hard disk with 200 cylinders and a queue with jobs having the following cylinder requests: 80, 190, 70, 130, 30, draw a diagram of the movements of the head for each of the algorithms listed in...

  • Please help me with 6 questions in 2 pictures below! The question is very clear. Please...

    Please help me with 6 questions in 2 pictures below! The question is very clear. Please help me is the Of the three components of access time in a movable-head Disk Arm Scheduling Algorithms, longest. Select one: a. delay time b. seek time c. transfer time d. search time DMA can operate in mode Select one: a. Word-at-time, Fly-by, Block mode b. Word-at-time, response, Block mode O c. Word-at-time, Fly-by, request d. Word-at-time, Fly-by The requirements for long-term information storage...

  • TRUE/FALSE QUESTIONS:  Foundations of Information Security and Assurance 1. There is a problem anticipating and testing for...

    TRUE/FALSE QUESTIONS:  Foundations of Information Security and Assurance 1. There is a problem anticipating and testing for all potential types of non-standard inputs that might be exploited by an attacker to subvert a program. 2. Without suitable synchronization of accesses it is possible that values may be corrupted, or changes lost, due to over-lapping access, use, and replacement of shared values. 3. The biggest change of the nature in Windows XP SP2 was to change all anonymous remote procedure call (RPC)...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT