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 > Accounting Posted 23 May 2017 My Price 6.00

Assume a task is divided into four equal-sized segments

Assume a task is divided into four equal-sized segments and that the system builds an eight-entry page descriptor table for each segment. Thus, the system has a combination of segmentation and paging. Assume also that the page size is 2 KBytes.

a. What is the maximum size of each segment?

b. What is the maximum logical address space for the task?

c. Assume that an element in physical location 00021ABC is accessed by this task. What is the format of the logical address that the task generates for it? What is the maximum physical address space for the system?

 

Answers

Alpha Geek
(8)
Status NEW Posted 23 May 2017 08:05 AM My Price 6.00

-----------

Attachments

file 1495529799-Answer.docx preview (141 words )
A-----------ssu-----------me -----------a t-----------ask----------- is----------- di-----------vid-----------ed -----------int-----------o f-----------our----------- eq-----------ual------------si-----------zed----------- se-----------gme-----------nts----------- an-----------d t-----------hat----------- th-----------e s-----------yst-----------em -----------bui-----------lds----------- an----------- ei-----------ght------------en-----------try----------- pa-----------ge -----------des-----------cri-----------pto-----------r t-----------abl-----------e f-----------or -----------eac-----------h s-----------egm-----------ent-----------. T-----------hus-----------, t-----------he -----------sys-----------tem----------- ha-----------s a----------- co-----------mbi-----------nat-----------ion----------- of----------- se-----------gme-----------nta-----------tio-----------n a-----------nd -----------pag-----------ing-----------. A-----------ssu-----------me -----------als-----------o t-----------hat----------- th-----------e p-----------age----------- si-----------ze -----------is -----------2 K-----------Byt-----------es.----------- a-----------. W-----------hat----------- is----------- th-----------e m-----------axi-----------mum----------- si-----------ze -----------of -----------eac-----------h s-----------egm-----------ent-----------? -----------b. -----------Wha-----------t i-----------s t-----------he -----------max-----------imu-----------m l-----------ogi-----------cal----------- ad-----------dre-----------ss -----------spa-----------ce -----------for----------- th-----------e t-----------ask-----------? -----------c. -----------Ass-----------ume----------- th-----------at -----------an -----------ele-----------men-----------t i-----------n p-----------hys-----------ica-----------l l-----------oca-----------tio-----------n 0-----------002-----------1AB-----------C i-----------s a-----------cce-----------sse-----------d b-----------y t-----------his----------- ta-----------sk.-----------
Not Rated(0)