Scribd
Upload
14 views1 page

OS Practice Questions F24

The document contains a list of practice questions for a Software Engineering course, focusing on topics such as memory management, addressing, fragmentation, and paging algorithms. Key questions explore differences between logical and physical addresses, memory allocation strategies, and the impact of TLBs on memory reference times. It serves as a study guide for understanding fundamental concepts in operating systems and memory management.

Uploaded by

xyz.roughuse
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
14 views1 page

OS Practice Questions F24

The document contains a list of practice questions for a Software Engineering course, focusing on topics such as memory management, addressing, fragmentation, and paging algorithms. Key questions explore differences between logical and physical addresses, memory allocation strategies, and the impact of TLBs on memory reference times. It serves as a study guide for understanding fundamental concepts in operating systems and memory management.

Uploaded by

xyz.roughuse
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

Software Engineering Department

OS Practice Questions

1. Name two differences between logical and physical addresses.


2. Describe a mechanism by which one segment could belong to the address space of two
different processes.
3. Why are page sizes always powers of 2?
4. Consider a logical address space of 64 pages of 1,024 words each, mapped onto a
physical memory of 32 frames.
5. Explain the difference between internal and external fragmentation.
6. Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125
KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes
of size 115 KB, 500 KB, 358 KB, 200 KB, and 375 KB (in order)? Rank the algorithms
in terms of how efficiently they use memory.
7. On a system with paging, a process cannot access memory that it does not own. Why?
How could the operating system allow access to other memory? Why should it or
should it not?
8. Consider a paging system with the page table stored in memory.
a. If a memory reference takes 50 nanoseconds, how long does a paged memory
reference take? b. If we add TLBs and 75 percent of all page-table references are
found in the TLBs, what is the effective memory reference time? (Assume that
finding a page-table entry in the TLBs takes 2 nanoseconds if the entry is present.)
b. If we add TLBs, and 75 percent of all page-table references are found in the TLBs
9. Difference Between First Fit, Best Fit, Worst Fit.
10. Difference Between Contiguous and Non-Contiguous Memory Allocation.

You might also like