$"$In operating systems, memory management is the function responsible for managing the computer's primary memory.

The memory management function keeps track of the status of each memory location, either allocated or free. It determines how memory is allocated among competing processes, deciding which gets memory, when they receive it$,$ and how much they are allowed. When memory is allocated it determines which memory locations will be assigned. It tracks when memory is freed or unallocated and updates the status.

This is distinct from application memory management, which is how a process manages the memory assigned to it by the operating system.

File management is organizing and keeping track of files and folders. It helps you stay organised so information is easy to locate and use. Using the file management tools, you can save files in folders with appropriate names so these files can be found or identified easily, create new folders quickly for recognition of information, delete unnecessary files and folders, search for files and folders, create shortcuts of files for quick access and compress files and folders to save space. TB$11$

Disk Management is a utility built into different operating systems which can be used to create, delete, format partitions, assign drive letters, and much more. Disk Management can also be used to view partitions and their formatted file systems on the hard drive.

Task to do:

Discuss situation under which the most frequently used page replacement algorithm generate fewer page faults than the least recently used page$-$replacement algorithm. Also discuss under which circumstances the opposite holds.

Discuss the given memory management technique with diagrams

$($i$)$ partition allocation methods

$($ii$)$ paging and translation look aside buffer

When do page faults occur? Consider the reference string: $1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6.$ How many page faults and page faults rate occur for the FIFO, LRU and optimal page replacement algorithms, assuming one, two, three, four page frames?

With a neat sketch explain how logical address is translated into physical address using paging mechanism.

Illustrate an application that could benefit from operating system support for random access to indexed files.

On a disk with $200$ cylinders, numbers $0$ to $199,$ compute the number of tracks the disk arm must move to the satisfy the entire request in the disk queue. Assume the last request received was at track $100.$ The queue in FIFO order contains requests for the following tracks, $55,58,39,18,90,160,150,38,184.$ Perform the computation to find the seek length for the following scheduling algorithm. $(25)$

$($i$)$ FCFS

$($ii$)$ SSTF

$($iii$)$ SCAN

$($iv$)$ C$-$SCAN

$($v$)$ LOOK"