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, 6 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 01 May 2017 My Price 6.00

Consider an application where students’ records are stored in a file

 

34.    Consider an application where students’ records are stored in a file. The application takes a student ID as input and subsequently reads, updates, and writes the correspond- ing student record; this is repeated till the application quits. Would the "block read- ahead" technique be useful here?

35.    Consider a disk that has 10 data blocks starting from block 14 through 23. Let there be 2 files on the disk: f1 and f2. The directory structure lists that the first data blocks of f1 and f2 are respectively 22 and 16. Given the FAT table entries as below, what are the data blocks allotted to f1 and f2?

(14,18); (15,17); (16,23); (17,21); (18,20); (19,15); (20, -1); (21, -1); (22,19); (23,14).

In the above notation, (x, y) indicates that the value stored in table entry x points to data block y.

 

 
 

Answers

Alpha Geek
(8)
Status NEW Posted 01 May 2017 05:05 PM My Price 6.00

-----------

Attachments

file 1493660148-answer1.docx preview (327 words )
3-----------4.Â----------- Â ----------- Â----------- Co-----------nsi-----------der----------- an----------- ap-----------pli-----------cat-----------ion----------- wh-----------ere----------- st-----------ude-----------nts-----------’----------- re-----------cor-----------ds -----------are----------- st-----------ore-----------d i-----------n a----------- fi-----------le.----------- Th-----------e a-----------ppl-----------ica-----------tio-----------n t-----------ake-----------s a----------- st-----------ude-----------nt -----------ID -----------as -----------inp-----------ut -----------and----------- su-----------bse-----------que-----------ntl-----------y r-----------ead-----------s, -----------upd-----------ate-----------s, -----------and----------- wr-----------ite-----------s t-----------he -----------cor-----------res-----------pon-----------d- -----------ing----------- st-----------ude-----------nt -----------rec-----------ord-----------; t-----------his----------- is----------- re-----------pea-----------ted----------- ti-----------ll -----------the----------- ap-----------pli-----------cat-----------ion----------- qu-----------its-----------. W-----------oul-----------d t-----------he -----------&qu-----------ot;-----------blo-----------ck -----------rea-----------d- -----------ahe-----------ad&-----------quo-----------t; -----------tec-----------hni-----------que----------- be----------- us-----------efu-----------l h-----------ere-----------? -----------35.----------- Â----------- Â ----------- C-----------ons-----------ide-----------r a----------- di-----------sk -----------tha-----------t h-----------as -----------10 -----------dat-----------a b-----------loc-----------ks -----------sta-----------rti-----------ng -----------fro-----------m b-----------loc-----------k 1-----------4 t-----------hro-----------ugh----------- 23-----------. L-----------et -----------the-----------re -----------be -----------2 f-----------ile-----------s o-----------n
Not Rated(0)