Finding total available storage capacity

Assignment Help Data Structure & Algorithms
Reference no: EM1380152

Question: A certain hard disk has 480 cylinders, sixteen tracks, and thirty-two sectors of 512 bytes each. It spins at 4800 revolutions per minute, and has an adjacent cylinder seek time of eighty msec, and a max seek time of onde hundred msec. Switching between tracks in the same cylinder is instantaneous. Use this information to answer the following 4 questions.
1. What is the total available storage capacity of the disk?
2. What is the minimum worst-case time required to read all the data on the disk, starting with the first track of the first cylinder, reading all the tracks in that cylinder, advancing to the next cylinder, etc.?
3. How much bandwidth (Mbytes/second) would a bus need to keep up with this drive at its maximum sustained data rate? Round your answer to three significant digits.
4. How large a buffer would be needed to allow a complete cylinder to be stored to permit reading or writing to occur at top speed?

Reference no: EM1380152

Questions Cloud

Find efficiency of high speed digital transmission system : Assume I have a multiplexer that is connected to a high speed digital transmission system that can transfer 1,536,000 data bits per second.
Website creation : Construct a basic, generic structure of a web site. Name it something generic etc. Demonstrate some basic layout of the content of the pages.
Design a dss to help decision-makers : Design a DSS to help decision-makers run the 2012 London Olympics-Write down the step-by-step solution to train the classifier by the basic perceptron learning rule.
Problems on edges and graphs : Suppose if we add an edge to a biconnected graph with k strongly connected components, then there are 3-situations: the endpoints of edge lie in different strongly connected component and there is no path between 2 in the original graph,
Finding total available storage capacity : A certain hard disk has 480 cylinders, sixteen tracks, and thirty-two sectors of 512 bytes each. It spins at 4800 revolutions per minute, and has an adjacent cylinder seek time of eighty msec, and a max seek time of onde hundred msec.
Creating visual studio.net web application : Make a Visual Studio.NET 2005 web application with one aspx form. Place a CheckBoxList, TextBox, Button, and Label control on the form.
Creating a data flow chart : Create a Data Flow Chart and then make an application that allows a user to enter a stock transaction and determine the stockbroker's commission.
Computing available storage space : There are twenty gigabyte of space on a computer's hard disk. I transfer information via a telephone line (connection) at the rate of 14,400 bits per second.
Question about communication recovery plan : Think about a natural or man made disaster, and explain how a communications network could be recovered from such a disaster.

Reviews

Write a Review

 

Data Structure & Algorithms Questions & Answers

  Primitives-remove ambiguities in algorithm-s representation

Describe how the use of primitives helps remove ambiguities in an algorithm's representation.

  Linear-time algorithm to find odd-length cycle in graph

Give a linear-time algorithm to find an odd-length cycle in a directed graph. You may not suppose that graph is strongly connected.

  Describe implementation of algorithm on simd computer

Describe an implementation of that algorithm on an SIMD computer where the processors are connected to form a linear array

  Describe why algorithm runs in on time

Assume you have the array A of n items, and you want to find k items in A closest to the median of A. Describe why your algorithm runs in O(n) time.

  How output of leaky bucket policer can be fed in second

Illustrate how output of the leaky bucket policer can be fed into second leaky bucket policer so that two leaky buckets in series police average rate, peak rate, and burst size.

  Write algorithm to calculate the volume of water

Write an algorithm to calculate the volume of water in cubic feet, flowing through pipe of diameter d in feet, with a velocity of v feet per second.

  Computing time complexity of procedure

What is the time complexity of the procedure? If A[l .. r] = [24, 30, 09, 46, 15, 19, 29, 86,78], what is the output?

  Create a solution algorithm using pseudocode

Algorithm that will receive two integer items from a terminal operator, and display to the screen their sum, difference, product and quotient.

  Find terminal nodes in tree nil if pointer is represented

The node's right child. If the nil pointer is represented by 00 and the tree's root pointer contains 53, how many terminal nodes are in tree?

  Sort array of elements using the quick sort algorithm

"sort an array of 10,000 elements using quick sort algorithm as follows: sort the array using pivot as middle element of the array

  Pseudocode for divide-and-conquer algorithm

Write a pseudocode for a divide-and-conquer algorithm for finding the position of the largest element in an array of n numbers.

  Determining hash value of modified file

Determine hash value of modified file look like, as compared with original hash value?

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