Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 2 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Computer Science Posted 16 May 2017 My Price 8.00

Suppose that a disk unit has the following parameters:

 

Suppose that a disk unit has the following parameters: seek time s = 20 msec; rotational delay rd = 10 msec; block transfer time bu = 1 msec; block size B = 2400 bytes; interblock gap size G = 600 bytes. An EMPLOYEE file has the following fields: SSN, 9 bytes; LASTNAME, 20 bytes; FIRSTNAME, 20 bytes; MIDDLE INIT, 1 byte; BIRTHDATE, 10 bytes; ADDRESS, 35 bytes; PHONE, 12 bytes; SUPERVISORSSN, 9 bytes; DEPARTMENT, 4 bytes; JOBCODE, 4 bytes; deletion marker, 1 byte. The EMPLOYEE file has r = 30,000 records, fixed-length format, and unspanned blocking. Write appropriate formulas andcalculate the following values for the above EMPLOYEE file:

 

a. The record size R (including the deletion marker), the blocking factor bfr, and the number of disk blocks b.

b. Calculate the wasted space in each disk block because of the unspanned organization.

c. Calculate the transfer rate tr and the bulk transfer rate btr for this disk unit (see Appendix B for definitions of tr and btr).

d. Calculate the average number of blockaccesses needed to search for an arbitrary record in the file, using linear search.

e. Calculate in msec the average time needed to search for an arbitrary recordin the file, using linear search, if the file blocks are stored on consecutive disk blocks and double buffering is used.

f. Calculate in msec the average time needed to search for an arbitrary recordin the file, using linear search, if the file blocks are not stored on consecutive disk blocks.

g. Assume that the records are ordered via some key field. Calculate the average number of block accesses and the average time needed to search for an arbitrary record in the file, using binary search.

 

 

 
 

Answers

Alpha Geek
(8)
Status NEW Posted 16 May 2017 07:05 AM My Price 8.00

-----------

Attachments

file 1494921132-Answer.docx preview (328 words )
S-----------upp-----------ose----------- th-----------at -----------a d-----------isk----------- un-----------it -----------has----------- th-----------e f-----------oll-----------owi-----------ng -----------par-----------ame-----------ter-----------s: -----------see-----------k t-----------ime----------- s -----------= 2-----------0 m-----------sec-----------; r-----------ota-----------tio-----------nal----------- de-----------lay----------- rd----------- = -----------10 -----------mse-----------c; -----------blo-----------ck -----------tra-----------nsf-----------er -----------tim-----------e b-----------u =----------- 1 -----------mse-----------c; -----------blo-----------ck -----------siz-----------e B----------- = -----------240-----------0 b-----------yte-----------s; -----------int-----------erb-----------loc-----------k g-----------ap -----------siz-----------e G----------- = -----------600----------- by-----------tes-----------. A-----------n E-----------MPL-----------OYE-----------E f-----------ile----------- ha-----------s t-----------he -----------fol-----------low-----------ing----------- fi-----------eld-----------s: -----------SSN-----------, 9----------- by-----------tes-----------; L-----------AST-----------NAM-----------E, -----------20 -----------byt-----------es;----------- FI-----------RST-----------NAM-----------E, -----------20 -----------byt-----------es;----------- MI-----------DDL-----------E I-----------NIT-----------, 1----------- by-----------te;----------- BI-----------RTH-----------DAT-----------E, -----------10 -----------byt-----------es;----------- AD-----------DRE-----------SS,----------- 35----------- by-----------tes-----------; P-----------HON-----------E, -----------12 -----------byt-----------es;----------- SU-----------PER-----------VIS-----------ORS-----------SN,----------- 9 -----------byt-----------es;----------- DE-----------PAR-----------TME-----------NT,----------- 4 -----------byt-----------es;----------- JO-----------BCO-----------DE,-----------
Not Rated(0)