2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page numbers and 4 frame (4 pages can be in memory at a time per process [6 marks] Reference string: 7, 0, 1, 2, 4, 6, 8, 3, 0, 1, 2, 3 1) explain the page replacement algorithm: First-In-First-Out (FIFO). How many page faults? [2 marks] 2) explain the page replacement algorithm: Optimal. How many page faults? [2 marks] 3) explain the page replacement algorithm: Least Recently Used (LRU). How many page faults? [2 marks]
2. The memory management has contiguous memory allocation, dynamic partitions, and paging. Compare the internal fragmentation and external fragmentation for these three approaches. [2 marks] 3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2), Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks] 1) Total # of pages ? 2) Total # of frames ? 3) Number of bits to represent logical address? 4) Number of bits to represent offset ? 5) Number of bits to represent physical address? 6) Number of bits to represent a page number? 7) Number of bits to represent a frame number / 4. What is translation look-aside buffers (TLBS)? Why we need them to implement the page table? [2 marks] 5. Why we need shared pages for multiple processes? Give one example to show the benefits. [2 marks] 6. How to implement the virtual memory by using page out and page in? Explain with an example. [2 marks] 7. We have a reference string of referenced page numbers and 4 frame (4 pages can be in memory at a time per process [6 marks] Reference string: 7, 0, 1, 2, 4, 6, 8, 3, 0, 1, 2, 3 1) explain the page replacement algorithm: First-In-First-Out (FIFO). How many page faults? [2 marks] 2) explain the page replacement algorithm: Optimal. How many page faults? [2 marks] 3) explain the page replacement algorithm: Least Recently Used (LRU). How many page faults? [2 marks]
Chapter11: Operating Systems
Section: Chapter Questions
Problem 21VE
Related questions
Question
![2. The memory management has contiguous memory allocation, dynamic partitions,
and paging. Compare the internal fragmentation and external fragmentation for
these three approaches. [2 marks]
3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2),
Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks]
1) Total # of pages ?
2) Total # of frames ?
3) Number of bits to represent logical address?
4) Number of bits to represent offset ?
5) Number of bits to represent physical address?
6) Number of bits to represent a page number?
7) Number of bits to represent a frame number /
4. What is translation look-aside buffers (TLBS)? Why we need them to implement the
page table? [2 marks]
5. Why we need shared pages for multiple processes? Give one example to show the
benefits. [2 marks]
6. How to implement the virtual memory by using page out and page in? Explain with
an example. [2 marks]
7. We have a reference string of referenced page numbers and 4 frame (4 pages can
be in memory at a time per process [6 marks]
Reference string: 7, 0, 1, 2, 4, 6, 8, 3, 0, 1, 2, 3
1) explain the page replacement algorithm: First-In-First-Out (FIFO). How
many page faults? [2 marks]
2) explain the page replacement algorithm: Optimal. How many page faults? [2
marks]
3) explain the page replacement algorithm: Least Recently Used (LRU). How
many page faults? [2 marks]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F92e5c125-0162-44af-aecb-b4cf9027a9d3%2F0dc8fbbb-83ee-439e-a391-3b6dfc09ae3f%2F0woxfykp_processed.png&w=3840&q=75)
Transcribed Image Text:2. The memory management has contiguous memory allocation, dynamic partitions,
and paging. Compare the internal fragmentation and external fragmentation for
these three approaches. [2 marks]
3. Suppose we have Logical address space = 24 = 16 (m = 4), Page size=2² =4 (n = 2),
Physical address space = 26 = 64 (r = 6). Answer the following questions: [4 marks]
1) Total # of pages ?
2) Total # of frames ?
3) Number of bits to represent logical address?
4) Number of bits to represent offset ?
5) Number of bits to represent physical address?
6) Number of bits to represent a page number?
7) Number of bits to represent a frame number /
4. What is translation look-aside buffers (TLBS)? Why we need them to implement the
page table? [2 marks]
5. Why we need shared pages for multiple processes? Give one example to show the
benefits. [2 marks]
6. How to implement the virtual memory by using page out and page in? Explain with
an example. [2 marks]
7. We have a reference string of referenced page numbers and 4 frame (4 pages can
be in memory at a time per process [6 marks]
Reference string: 7, 0, 1, 2, 4, 6, 8, 3, 0, 1, 2, 3
1) explain the page replacement algorithm: First-In-First-Out (FIFO). How
many page faults? [2 marks]
2) explain the page replacement algorithm: Optimal. How many page faults? [2
marks]
3) explain the page replacement algorithm: Least Recently Used (LRU). How
many page faults? [2 marks]
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
Fundamentals of Information Systems
Computer Science
ISBN:
9781337097536
Author:
Ralph Stair, George Reynolds
Publisher:
Cengage Learning
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781305627482
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning