Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


how to estimate the disk access time?
e.g. the time between read one byte and another byte in the
disk.

Answers were Sorted based on User's Feedback



how to estimate the disk access time? e.g. the time between read one byte and another byte in the ..

Answer / prasad jvv

Disks are block devices. Mean one block of data can be read
at one point of time. So there is no point of time between
read one byte and another byte. If intended to calculate
time to read one byte, first of all we need to calculate
the time required to read one block and devide that by
block size.

Access Time = Command Overhead Time + Seek Time + Settle
Time + Latency

This equation is not universal standard.

Is This Answer Correct ?    6 Yes 2 No

how to estimate the disk access time? e.g. the time between read one byte and another byte in the ..

Answer / daniele

http://www.linuxinsight.com/how_fast_is_your_disk.html


% sudo hdparm -t /dev/hda

/dev/hda:
Timing buffered disk reads: 140 MB in 3.02 seconds = 46.28
MB/sec

Substitute /dev/hda with the name of your raw disk device,
of course (for example, it might be /dev/sda if you're using
libata, or something else).

Is This Answer Correct ?    1 Yes 0 No

how to estimate the disk access time? e.g. the time between read one byte and another byte in the ..

Answer / arbit

I suppose the answer is to be figured out programmatically
not by handwaving. Every stupid in Computer Science knows
what you have answered

Is This Answer Correct ?    1 Yes 3 No

Post New Answer

More C Interview Questions

write an interactive C program that will encode or decode a line of text.To encode a line of text,proceed as follows. 1.convert each character,including blank spaces,to its ASCII equivalent. 2.Generate a positive random integer.add this integer to the ASCII equivalent of each character.The same random integer will be used for the entire line of text. 3.Suppose that N1 represents the lowest permissible value in the ASCII code,and N2 represents the highest permissible value.If the number obtained in step 2 above(i.e.,the original ASCII equivalent plus the random integer)exceeds N2,then subtract the largest possible multiple of N2 from this number,and add the remainder to N1.Hence the encoded number will always fall between N1 and N2,and will therefore always represent some ASCII character. 4.Dislay the characters that correspond to the encoded ASCII values.  The procedure is reversed when decoding a line of text.Be certain,however,that the same random number is used in decodingas was used in encoding.

0 Answers  


code for quick sort?

0 Answers  


int x=5; printf("%d%d%d",x,x<<2,x>>2);

2 Answers   TANCET,


Is void a keyword in c?

0 Answers  


What would happen to X in this expression: X += 15; (assuming the value of X is 5)

0 Answers  


What is difference between array and pointer in c?

0 Answers  


What is a header file?

0 Answers  


what is difference between userlevel threads and kernel level threads ?what are the trades offs between these two approaches ? what approach is most frequently used and why ?

1 Answers  


How would you write qsort?

1 Answers  


Diff: between this 2 classes in terms of memory class A { int i; char c; double d; }; class A { double d; int i; char c; }; How it is calculating?

1 Answers   HCL,


Is python a c language?

0 Answers  


main() { int i=1; while (i<=5) { printf("%d",i); if (i>2) goto here; i++; } } fun() { here: printf("PP"); }

3 Answers   ME,


Categories