Scribd
Upload
0 views

Assignment

The document is an assignment for a Computer Science course at BGC Trust University Bangladesh, focusing on Operating Systems. It includes questions on virtual memory, page replacement algorithms, effective memory access time, segment tables, thrashing, and file system metadata. Students are required to perform calculations and explain concepts related to these topics.

Uploaded by

riyadulislamctg47
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
0 views

Assignment

The document is an assignment for a Computer Science course at BGC Trust University Bangladesh, focusing on Operating Systems. It includes questions on virtual memory, page replacement algorithms, effective memory access time, segment tables, thrashing, and file system metadata. Students are required to perform calculations and explain concepts related to these topics.

Uploaded by

riyadulislamctg47
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

BGC Trust University Bangladesh

Department of Computer Science & Engineering


5th Semester (Section: B), B.Sc. (Hons) 2025
Course Title: Operating Systems
Course Code: 07-0613-OS 503
Assignment: 02

1. Define virtual memory and explain demand paging with a neat diagram.
2. Consider the following page reference string:
1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7
Assume a frame size of 4 pages.
(a) Calculate the number of page faults using the FIFO algorithm.
(b) Repeat using the LRU algorithm.
(c) Which performs better here and why?

3. A system has a TLB hit time of 15 ns and a main memory access time of 100 ns.
If the TLB hit ratio is 90%, calculate the effective memory access time.
4. A system uses a 36-bit virtual address and a page size of 4 KB. Each page table
entry takes 6 bytes.

(a) How many pages does the virtual address space have?
(b) What is the total size of the page table?

5. Given the following segment table:

Segment Base Limit


0 500 200
1 1000 300
(a) Is the logical address (1, 290) valid? If valid, translate it to a physical ad-
dress.
(b) What happens with the logical address (0, 210)?

6. Explain the concept of thrashing in virtual memory systems. How does a high
degree of multiprogramming contribute to thrashing?
7. A file system stores metadata as follows:

• Name: 32 bytes
• Type, Owner, Permissions: 20 bytes
• Timestamps (created, modified, accessed): 24 bytes

(a) How much metadata is needed for 10,000 files?


(b) How does this affect storage efficiency? Explain with computing overhead
ratio. [Each file is 2 KB in size.]

You might also like