Scribd
Upload
5 views

ALM2

Uploaded by

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

ALM2

Uploaded by

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

ALM CO2

1. Apply the Optimal Page Replacement Algorithm to the page string 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1


7 0 1 with three frames, and calculate the Page Fault Rate.
2. Illustrate the process of mapping virtual addresses to physical addresses using paging. Detail the
steps involved in this mapping process with an appropriate example.
3. Apply the FIFO algorithm to calculate the page faults for the reference string 5 6 7 8 5 6 7 8 5 6 7
8 9 0 4 3 using both 4 frames and 3 frames.
4. Utilize the FIFO page replacement algorithm to calculate the page fault rate for the reference
string 0 1 2 3 0 1 2 3 01 2 3 4 5 6 7 using 4 frames. Construct a detailed explanation of the FIFO
algorithm based on your findings.
5. Develop a detailed explanation of the Optimal Page Replacement Algorithm. Utilize the
algorithm on the reference string 1 2 3 2 5 6 3 4 6 3 4 6 3 7 3 1 5 3 6 3 4 2 43 4 5 1 using four
frames to calculate the Page Fault Rate.
6. Utilize a machine with 48-bit virtual addresses and 32-bitphysical addresses, where pages are 8
KB in size, to determine the number of entries required for a single-level linear page table.
Identify the elements typically found in a page table entry.
7. Apply the Least Recently Used (LRU) and Least Frequently Used (LFU) algorithms to the
reference string0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 6, 7 with 3mainframes. Analyze the page faults
for each algorithm and compare the results to understand how each algorithm manages the
page faults.
8. Analyze the number of bits required for the Virtual Page Number(VPN) and offset in a small
address space of 16 KB with 64-bytepages. Calculate the number of entries in a linear page
table. Design a two-level page table for this address space and develop the multi-level page
table control flow algorithm.
9. Assume that memory contains only three frames. Initially, all three frames are empty. The page
reference string is 2, 3, 2, 1, 5, 2, 4, 5,3, 2, 5, 2. Experiment with the Optimal Page Replacement,
Least Recently Used, and Clock algorithms to determine how many page faults occur. Pictorially
show which pages are replaced.
10. Illustrate why segmentation and paging are sometimes combined into one scheme. For a given
virtual address of a paged segment in binary number, rephrase the hybrid approach: combining
segmentation and paging control flow algorithm.
11. Illustrate contiguous and non contiguous memory allocation approaches and different Memory
Allocation Techniques.
12. Identify the page table size for a machine with 32 KB physical memory and a 16-bit virtual
address space, given a page size of 4KB and Page Table Entry (PTE) size of 4bytes. Develop an
algorithm for accessing memory with paging for a given virtual address in a binary number.
13. Assume that memory contains only three frames. Initially, all three frames are empty. The page
reference string is7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. Experiment with the FIFO, Optimal Page
Replacement, and Least Recently Used algorithms to determine how many page faults occur.
Pictorially show which pages are replaced.
14. Illustrate the purpose of a translation look aside buffer(TLB). For a given virtual address in a
binary number, write the hardware-managed translation look aside buffer control flow
algorithm.
15. Assume that memory contains only four frames. The page reference string is c a d b e b a b c d.
We shall call the pages of the program a, b, c, to distinguish them from the time (1,2, 3, ...).
Assume references at times 2, 4, and 7 are writes and initially, pages a, b, c, and d occupy frames
0, 1, 2, and3 respectively. Experiment with the following replacement algorithms to determine
how many page faults would occur: • Not-Recently-Used or Not Used Recently (NRU,NUR) •
Second-chance Cyclic
16. Analyze the function of the Translation Look aside Buffer(TLB) and interpret its impact on
memory management.
17. Identify the number of Page faults with Optimal Page Replacement Algorithm and FIFO Page
Replacement Algorithm with reference string 1 2 3 2 5 6 3 4 6 3 4 6 3 73 1 5 3 6 3 4 2 4 3 4 5 1.
Assume that the memory size is four frames and differentiate both algorithms.

You might also like