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

Basic idea - learning decision trees, Basic idea: However in the above...

Basic idea: However in the above decision of tree which it is significant that there the "parents visiting" node came on the top of the tree. Whether we don't know exactly the

Simple application to model a garden, Requirement Specification for a Simpl...

Requirement Specification for a Simple Application to Model a Garden The following is a requirements statement for a simple application to model the design of a garden. The requ

Why is xml superior to other forms of data exchange, Why is XML superior to...

Why is XML superior to other forms of data exchange? The XML gives universal data format for integrated electronic business solutions. Other database systems and Relational dat

The maximum number of dimensions an array can have in c, The maximum number...

The maximum number of dimensions an array can have in C is C permits arrays of three or more dimensions. The exact limit is examined by the compiler.

How can we use ordered lists, Q. How can we use Ordered Lists? Lists ha...

Q. How can we use Ordered Lists? Lists having numbered items are termed as ordered lists. They are used when items in the list have a natural order. They can also be used when

Which scheduling is suitable for time-shared operatin system, Which schedul...

Which scheduling policy is most suitable for a time-shared operating system? Ans. Round-Robin scheduling policy is most appropriate for a time-shared operating system.

C programming, At a shop of marbles, packs of marbles are prepared. Packets...

At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes

How many select lines will have a 16 to 1 multiplexer, How many select line...

How many select lines will a 16 to 1 multiplexer will have ?   Ans. For 16 to 1 MUX four select lines will be needed to select 16 (2 4 ) inputs.

Memory that can be used in a 16-bit computer, What is the maximum size of t...

What is the maximum size of the memory that can be used in a 16-bit computer and 32 bit computer? The maximum size of the memory that can be used in a 16-bit computer is 2 memo

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