[go: up one dir, main page]
Scribd
Upload
30 views1 page

OS Assignment-4

This document is an assignment for B. Tech students in the CSE (AIML) branch at Galgotias College, focusing on Operating Systems. It includes questions on memory management schemes, addressing physical addresses from a segment table, fragmentation types, TLBs, virtual memory, demand paging, and comparisons between paging and segmentation. The assignment is due for submission on June 22, 2023, and requires detailed explanations and calculations for various scenarios.

Uploaded by

devashishparth23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views1 page

OS Assignment-4

This document is an assignment for B. Tech students in the CSE (AIML) branch at Galgotias College, focusing on Operating Systems. It includes questions on memory management schemes, addressing physical addresses from a segment table, fragmentation types, TLBs, virtual memory, demand paging, and comparisons between paging and segmentation. The assignment is due for submission on June 22, 2023, and requires detailed explanations and calculations for various scenarios.

Uploaded by

devashishparth23
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY

Knowledge Park-II, Greater Noida, U.P.


Department of CSE & Allied Specialized Branches
Even Semester, 2022-23

Course/Branch: B. Tech /CSE (AIML) Semester: IV


Subject Name: Operating Systems Subject Code: KCS 401
Date of Assignment:19-06-2023 Date of Submission: 22-06-2023

ASSIGNMENT-4

CO4: Learn various memory management scheme.

ATTEMPT ALL QUESTIONS

Q1. Consider the segment table:


Segment Base Length
0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96
Calculate what are the physical addresses for the following logical addresses?
a. 0, 430
b. 1, 10
c. 2, 500
d. 3, 400
e. 4, 112
Q2. Explain Internal and External Fragmentation. Given five memory partitions of 100 KB,
500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each of the first-fit, best-fit,
and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in
order)? Which algorithm makes the most efficient use of memory?
Q3. Explain in details about TLBs?
Consider a paging system with the page table stored in memory.
a. If a memory reference takes 200 nanoseconds, how long does a paged memory reference
take?
b. If we add associative registers, and 75 percent of all page-table references are found in
the associative registers, what is the effective memory reference time? (Assume that
finding a page-table entry in the associative registers takes zero time, if the entry is there.)
Q4. Explain the working of Virtual Memory and Demand Paging.
Suppose we have a paging system with 4 frames and 12 pages, where the number of frames
denotes the number of pages that can be held in RAM at any given time. Assume the pages
are accessed by some program in the order shown below, from left to right. Also, assume
that the program has just started, so the frames are initially empty. How many page faults
will be generated assuming that the LRU (Least Recently Used) algorithm is being used?
Order in which pages are accessed:
3, 4, 2, 1, 4, 7, 2, 5, 3, 6, 1, 3
Q5. Compare Paging and Segmentation. Also Explain “Paged Segmentation.”

You might also like