Written by students who passed Immediately available after payment Read online or as PDF Wrong document? Swap it for free 4.6 TrustPilot
logo-home
Document preview thumbnail
Preview 2 out of 13 pages
Exam (elaborations)

OSG 202 chap 3 Test Questions with Correct Answers Latest Update

Document preview thumbnail
Preview 2 out of 13 pages

OSG 202 chap 3 Test Questions with Correct Answers Latest Update Consider a swapping system in which the memory consists of the following hole sizes: 10 K, 4 K, 20 K, 15 K, 9 K. Assume first fit algorithm is used. Which holes are taken for successive segment requests of 8 K, 12 K, 10 K? * A.None of the other choices B. 10 K, 20 K, 15 K C. 9 K, 15 K, 10 K D. 20 K, 15 K, 4 K - Answers B Which of the following information bits in the entry of page table is used to indicate Page Fault? * A.Present/absent bit B. Status bit C. Referenced bit D .Modified bit - Answers A To specify an address in this segmented memory, the _____ form is used * A virtual address, offset B process, offset C physical address, offset D segment-number, offset - Answers D Page replacement algorithms determine A Which pages should be brought into memory because a process is likely to reference them soon B Which page to remove to provide space for an incoming page C How many pages should be added to the main memory D When the system should update page table entries - Answers B The page table for each process maintains _________ . A) the physical memory location of the process B) the frame location for each page of the process C) the page location for each frame of the process D) the logical memory location of the process - Answers B The modified/dirty bit is used for the purpose of: * A. None of the other choices B. Implementing FIFO page replacement algorithm C. Dynamic allocation of memory used by one process to another D. Reduce the average time required to service page faults - Answers D There are ____ entries per page in the Page table: * A 4 B 3 C 1 D 2 - Answers C Consider a swapping system in which the memory consists of the following hole sizes: 10K, 4K, 20K, 15K, 9K. Assume best fit algorithm is used. Which holes are taken for successive segment requests of 8K, 12K, 10K? * A 9K, 15K, 10K B 10K, 20K, 15K C 10K, 15K, 20K D 20K, 15K, 10K - Answers A When a virtual memory system manages memory in fixed-length units, which of the following terms correctly represents its unit? * A Segment B Block C Page D Frame - Answers C Which of these statements about the algorithm "First fit" is true? * A. Memory Manager starting searching the list of segments from the place where it left off last time. B. Memory Manager searches the entire list of segments from beginning to end and takes the smallest hole that is adequate. C. None of the choices D. Memory Manager scans along with the list of segments until it finds a hole that is big enough. - Answers D What is not the technique of implementation for Virtual Memory? * A paging B segmentation C all of the other choices D partition - Answers D Which solutions are used to solve the shared libraries? * 0/1 A Static reallocation and position-independent code B Relocation on the fly and position-independent code C position-independent code D None of the others - Answers C Which of the following information bits in the entry of page table is used to indicate what

Content preview

OSG 202 chap 3 Test Questions with Correct Answers Latest Update 2025-2026

Consider a swapping system in which the memory consists of the following hole sizes: 10 K, 4 K,
20 K, 15 K, 9 K. Assume first fit algorithm is used. Which holes are taken for successive
segment requests of 8 K, 12 K, 10 K? *



A.None of the other choices

B. 10 K, 20 K, 15 K

C. 9 K, 15 K, 10 K

D. 20 K, 15 K, 4 K - Answers B

Which of the following information bits in the entry of page table is used to indicate Page Fault?
*



A.Present/absent bit

B. Status bit

C. Referenced bit

D .Modified bit - Answers A

To specify an address in this segmented memory, the _____ form is used *

A <virtual address, offset>

B <process, offset>

C <physical address, offset>

D <segment-number, offset> - Answers D

Page replacement algorithms determine



A Which pages should be brought into memory because a process is likely to reference them
soon



B Which page to remove to provide space for an incoming page

, C How many pages should be added to the main memory

D When the system should update page table entries - Answers B

The page table for each process maintains _________ .



A) the physical memory location of the process

B) the frame location for each page of the process

C) the page location for each frame of the process

D) the logical memory location of the process - Answers B

The modified/dirty bit is used for the purpose of: *



A. None of the other choices

B. Implementing FIFO page replacement algorithm

C. Dynamic allocation of memory used by one process to another

D. Reduce the average time required to service page faults - Answers D

There are ____ entries per page in the Page table: *



A4

B3

C1

D 2 - Answers C

Consider a swapping system in which the memory consists of the following hole sizes: 10K, 4K,
20K, 15K, 9K. Assume best fit algorithm is used. Which holes are taken for successive segment
requests of 8K, 12K, 10K? *



A 9K, 15K, 10K

B 10K, 20K, 15K

Document information

Uploaded on
September 15, 2025
Number of pages
13
Written in
2025/2026
Type
Exam (elaborations)
Contains
Questions & answers
$10.99

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
TutorJosh
3.4
(74)
Sold
481
Followers
16
Items
32590
Last sold
20 hours ago


Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions