Determine the order in which optimized c-scan would service, Computer Engineering

Assignment Help:

Consider the situation in which the disk read/write head is currently located at track 45 (of tracks 0-255) and moving in the positive direction. Assume that the following track requests have been made in this order: 40, 67, 11, 240, and 87. What is the order in which optimized C-SCAN would service these requests and what is the total seek distance? Ans:

Disk queue: 40, 67, 11, 240, 87 and disk are presently located on track 45.The order wherein optimized C-SCAN would service such requests is demonstrated by the following diagram.

1514_Disk queue.png

Total seek distance = (67-45)+(87-67)+(240-87)+(255-240)+255+(11-0)+(40-11)

=22+20+153+15+255+11+29

=505


Related Discussions:- Determine the order in which optimized c-scan would service

Carry look-ahead adder and booth''s algorithm, Describe carry look-ahead ad...

Describe carry look-ahead adder? Ans: The input carry required by a stage is directly computed from carry signals obtained from all of the preceding stages i-1,i-2,.....0, rat

Digital forensics, a) What do you meant by digital forensics? b) What ...

a) What do you meant by digital forensics? b) What is the job of Computer Forensic Analyst c) From the point of view of : i. An employer ii. An employee Give thre

Iterative deepening search, Iterative Deepening Search: So, breadth fi...

Iterative Deepening Search: So, breadth first search is always guaranteed to find a solution (if one exists), actually it eats all the memory. For the depth first search, ther

Mapping, what is transform mapping and transaction mapping?

what is transform mapping and transaction mapping?

Propositional inference rules, Propositional Inference Rules: Proposit...

Propositional Inference Rules: Propositional Inference Rules Equivalence rules are mostly useful because of the vice-versa aspect, that means like we can search backwards and

Bilinear interpolated images , Transfer  Functions Change the last bili...

Transfer  Functions Change the last bilinear interpolated images and the original images into the frequency domain using the FFT.  Try to measure the magnitude transfer functio

Enumerate about the specialised hardware, Enumerate about the Specialised h...

Enumerate about the Specialised hardware Specialised hardware such as protected memory or cryptographic memory module for storing and protecting the keys proves to be a good s

write a ''c'' program to accept any 3 digit integer number, Write a 'C' pr...

Write a 'C' program to accept any 3 digit integer number from the keyboard and display the word equivalent representation of the given number

Control section in computer system, CONTROL SECTION: The control sectio...

CONTROL SECTION: The control section directs the flow of traffic (operations) and data. Also it maintains order within the computer. The control section chooses one program sta

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd