Scribd
Upload
32 views

Assignment (Memory Management)

Logical memory refers to addresses seen by a process, while physical memory refers to actual hardware addresses. Operating systems use techniques like paging and segmentation to map processes' logical addresses to physical addresses to avoid fragmentation. Paging divides physical memory into fixed-size pages that can each be mapped to a process' virtual address space. The page number and page offset make up a physical address, with the page number identifying the page in memory and the offset locating a byte within the page. Virtual memory allows processes to access more space than actual physical memory by swapping pages to disk as needed. Page replacement algorithms determine which pages to swap out when new pages must be brought in from disk.

Uploaded by

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

Assignment (Memory Management)

Logical memory refers to addresses seen by a process, while physical memory refers to actual hardware addresses. Operating systems use techniques like paging and segmentation to map processes' logical addresses to physical addresses to avoid fragmentation. Paging divides physical memory into fixed-size pages that can each be mapped to a process' virtual address space. The page number and page offset make up a physical address, with the page number identifying the page in memory and the offset locating a byte within the page. Virtual memory allows processes to access more space than actual physical memory by swapping pages to disk as needed. Page replacement algorithms determine which pages to swap out when new pages must be brought in from disk.

Uploaded by

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

ASSIGNMENT 3 - MEMORY MANAGEMENT

1. Explain the differences between logical versus physical memory.


2. To achieve 100% memory utilization, OSes need avoid fragmentation. Discuss the type
of fragmentation occur in memory management.
3. Explain the techniques used to solve the external fragmentation problem.
4. What is the compaction? Explain the needed of compaction in memory management.
5. What is paging?
6. Physical address generated by CPU can be divided into page number (p) and page offset
(d). Explain what is p and d.
7. What is Virtual Memory? What is the benefit of Virtual memory.
8. Explain the characteristic of lazy swapper in demad paging.
9. What is the page fault? Explain the step required to handle page fault.
10. Page replacement is required to copy the missing page from hardisk to main memory ,
explain the basic step of page replacement when there is no free frame available in main
memory.
11. Explain at least 2 best algorithm of page replacement. The best algorithm determine by
the lowest page-fault rate.
12. What is thrashing and how to avoid the thrashing
13. What is the principle of locality in memory management.
EXERCISE : Memory Management
1. Given a heap of memory management scheme with the following free list where U: Used and
H: Hole:
U
0K

H 48
20K

H 20
U
68K
88K

U
118K

H 30
150K

The following process requests will be received in order:

U
180K

U
230K

H 155
245K

400K

Process number
1
2
3

Size in Kilobytes
20
45
30

66

Show how the memory requests above are allocated using each of the allocation schemes:
i.
Best Fit (BF)
[4 Marks]
ii.
First Fit (FF)
[4 Marks]
iii.
Worst Fit (WF)
[4 Marks]
2. Given a heap memory management scheme with the following free list where U: Used and
H: Hole:

The following process requests will be received in order:


Process number
1
2
3

Size in Kilobytes
13
51
27

4
5

83
9

Show how the memory requests above are allocated using each of the allocation schemes:
iv. Best Fit (BF)
[4 Marks]
v. First Fit (FF)
[4 Marks]
vi.
Worst Fit (WF)
[4 Marks]

3. Show the allocation of the segments from the following segment table:
Segment #
0

Limit
250

Base
200

1
2
3

300
550
600

1200
460
2200

You might also like