Geschreven door studenten die geslaagd zijn Direct beschikbaar na je betaling Online lezen of als PDF Verkeerd document? Gratis ruilen 4,6 TrustPilot
logo-home
Tentamen (uitwerkingen)

Spring 2022 Exam 3 Georgia Institute Of Technology CS 2200

Beoordeling
-
Verkocht
-
Pagina's
12
Cijfer
A+
Geüpload op
04-04-2023
Geschreven in
2022/2023

Spring 2022 Exam 3 You have 70 minutes. The exam includes three bonus points, so the total points tally up to 100. Please be concise: avoid verbose answers. Good luck! The Code educates all members of the Georgia Tech Community about the Institute’s expectations and Students’ rights and creates a standard by which Students are expected to conduct themselves for the purpose of establishing an environment conducive to academic excellence. Georgia Tech Students, Registered Student Organizations, and Groups are responsible for their own behavior, and the Institute has the authority to establish an internal structure for the enforcement of its policies and procedures, the terms of which students have agreed to accept by their enrollment. Question 1: Memory Fragmentation (12 points) (8 minutes) Yesha’s memory system has 16KB (1KB = 1024 Bytes) of memory. At a given point in time, there are 4 active processes with the following memory footprints: P0: 3220 bytes P1: 3210 bytes P2: 2200 bytes P3: 3251 bytes a) A memory management system that uses memory paging with a page size of 4KB results in the following memory layout: Calculate the total amount of memory lost to internal fragmentation at this time. b) A different memory management system tries to solve the paged system’s internal fragmentation problem by using bounds registers to allocate static memory partitions matching exactly the memory footprint of each process. At a given time, memory looks like this: We then try to insert a new process, P5, with a memory footprint of 4001 bytes. Is this possible? Explain your reasoning. c) Explain an approach that could minimize both internal and external fragmentation in our system. d) This question is independent from all previous assumptions introduced in questions a to c. Charles proposes hardware support for the LC-2200 processor to aid memory management that uses a pair of “bounds” registers to define the memory occupied by a process. The registers are used by the memory manager as follows: ● A process P4 is currently running occupying memory from address 1024 to address 2048 (i.e., the lower bound register would be set to 1024 and the upper bound register would be set to 2048, when P4 is running). ● P4 makes a blocking I/O call and is swapped out. ● Later when the I/O is complete and P4 is ready to run again, the memory manager brings P4 into memory in the address range 4096 to 5120. Is this a correct system behavior? Explain y

Meer zien Lees minder
Instelling
Vak

Voorbeeld van de inhoud

Spring 2022 Exam 3

You have 70 minutes. The exam includes three bonus points, so the total points tally up to 100.
Please be concise: avoid verbose answers. Good luck!




The Code educates all members of the Georgia Tech Community about the
Institute’s expectations and Students’ rights and creates a standard by which Students are
expected to conduct themselves for the purpose of establishing an environment conducive
to academic excellence. Georgia Tech Students, Registered Student Organizations, and
Groups are responsible for their own behavior, and the Institute has the authority to
establish an internal structure for the enforcement of its policies and procedures, the terms
of which students have agreed to accept by their enrollment.

, Question 1: Memory Fragmentation (12 points) (8 minutes)

Yesha’s memory system has 16KB (1KB = 1024 Bytes) of memory. At a given point in time,
there are 4 active processes with the following memory footprints:

P0: 3220 bytes
P1: 3210 bytes
P2: 2200 bytes
P3: 3251 bytes

a) A memory management system that uses memory paging with a page size of 4KB
results in the following memory layout:




Calculate the total amount of memory lost to internal fragmentation at this time.

b) A different memory management system tries to solve the paged system’s internal
fragmentation problem by using bounds registers to allocate static memory partitions
matching exactly the memory footprint of each process. At a given time, memory looks
like this:

Geschreven voor

Vak

Documentinformatie

Geüpload op
4 april 2023
Aantal pagina's
12
Geschreven in
2022/2023
Type
Tentamen (uitwerkingen)
Bevat
Vragen en antwoorden

Onderwerpen

$9.49
Krijg toegang tot het volledige document:

Verkeerd document? Gratis ruilen Binnen 14 dagen na aankoop en voor het downloaden kun je een ander document kiezen. Je kunt het bedrag gewoon opnieuw besteden.
Geschreven door studenten die geslaagd zijn
Direct beschikbaar na je betaling
Online lezen of als PDF

Maak kennis met de verkoper

Seller avatar
De reputatie van een verkoper is gebaseerd op het aantal documenten dat iemand tegen betaling verkocht heeft en de beoordelingen die voor die items ontvangen zijn. Er zijn drie niveau’s te onderscheiden: brons, zilver en goud. Hoe beter de reputatie, hoe meer de kwaliteit van zijn of haar werk te vertrouwen is.
ExamsConnoisseur Self
Volgen Je moet ingelogd zijn om studenten of vakken te kunnen volgen
Verkocht
587
Lid sinds
3 jaar
Aantal volgers
344
Documenten
1492
Laatst verkocht
3 weken geleden

4.2

68 beoordelingen

5
40
4
11
3
13
2
1
1
3

Recent door jou bekeken

Waarom studenten kiezen voor Stuvia

Gemaakt door medestudenten, geverifieerd door reviews

Kwaliteit die je kunt vertrouwen: geschreven door studenten die slaagden en beoordeeld door anderen die dit document gebruikten.

Niet tevreden? Kies een ander document

Geen zorgen! Je kunt voor hetzelfde geld direct een ander document kiezen dat beter past bij wat je zoekt.

Betaal zoals je wilt, start meteen met leren

Geen abonnement, geen verplichtingen. Betaal zoals je gewend bent via iDeal of creditcard en download je PDF-document meteen.

Student with book image

“Gekocht, gedownload en geslaagd. Zo makkelijk kan het dus zijn.”

Alisha Student

Bezig met je bronvermelding?

Maak nauwkeurige citaten in APA, MLA en Harvard met onze gratis bronnengenerator.

Bezig met je bronvermelding?

Veelgestelde vragen