Scribd
Upload
287 views

Memory Management-Tutorial

The document discusses several concepts related to memory management in computer systems: 1) Processes must remain in main memory so the CPU can quickly access their code and data. 2) It compares logical vs physical addresses, page tables vs segment tables, and different memory allocation techniques like first-fit, best-fit, and worst-fit placement. 3) It poses questions about applying these allocation techniques, the advantages of different memory management strategies, mapping logical addresses to physical addresses using paging and segmentation, and calculating memory fragmentation.

Uploaded by

Aadhil Mohamed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
287 views

Memory Management-Tutorial

The document discusses several concepts related to memory management in computer systems: 1) Processes must remain in main memory so the CPU can quickly access their code and data. 2) It compares logical vs physical addresses, page tables vs segment tables, and different memory allocation techniques like first-fit, best-fit, and worst-fit placement. 3) It poses questions about applying these allocation techniques, the advantages of different memory management strategies, mapping logical addresses to physical addresses using paging and segmentation, and calculating memory fragmentation.

Uploaded by

Aadhil Mohamed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Memory management

Q1: Why does the computer must keep several processes in main memory?

Q2: What are the differences between?


a) Logical and physical address?
b) Page table and segment table?
c) First-fit placement and best-fit placement?
d) Contiguous and non – contiguous storage allocation
e) Multiple contiguous fixed partitions (MFT) and multiple contiguous
variable partitions (MVT).
f) Segmentation and paging storage?
a) Contiguous and non – contiguous storage allocation

Q3: Suppose that we have free segments with sizes: 6, 17, 25, 14, and 19. Place a
program with size 13kB in the free segment using first-fit, best-fit and worst fit?

Q4: What are the advantages of?


a) Overlays allocation storage.
b) Compaction.
c) Page table.
d) Segment table.

Q5: Consider a user program of logical address of size 6 pages and page size is 4
bytes. The physical address contains 300 frames. The user program consists of
22 instructions a, b, c, . . . u, v . Each instruction takes 1 byte. Assume at that
time the free frames are 7, 26, 52, 20, 55, 6, 18, 21, 70, and 90.
Find the following? (10 degrees)
A) Draw the logical and physical maps and page tables?
B) Allocate each page in the corresponding frame?
C) Find the physical addresses for the instructions m, d, v, r?
D) Calculate the fragmentation if exist?
Q6: Consider a program consists of five segments: S0 = 600, S1 = 14 KB, S2= 100
KB, S3 =580 KB, and S4 = 96 KB. Assume at that time, the available free
space partitions of memory are 1200–1805, 50 – 150, 220-234, and 2500-3180.
Find the following:
1. Draw logical to physical maps and segment table?
2. Allocate space for each segment in memory?
3. Calculate the external fragmentation and the internal fragmentation?
4. What are the addresses in physical memory for the following logical
addresses: 0.580, (b) 1.17 (c) 2.66 (d) 3.82 (e) 4.20?

You might also like