Scribd
Upload
4 views2 pages

OS Notes

The document provides an overview of key concepts in operating systems, focusing on memory management techniques such as paging, page replacement algorithms, virtual memory, demand paging, and segmentation. It explains the workings of paging, the advantages and disadvantages of various memory allocation methods, and compares paging with segmentation. Additionally, it discusses fragmentation types and their implications on memory allocation.

Uploaded by

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

OS Notes

The document provides an overview of key concepts in operating systems, focusing on memory management techniques such as paging, page replacement algorithms, virtual memory, demand paging, and segmentation. It explains the workings of paging, the advantages and disadvantages of various memory allocation methods, and compares paging with segmentation. Additionally, it discusses fragmentation types and their implications on memory allocation.

Uploaded by

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

OPERATING SYSTEM SHORT NOTES (15 MARKS)

1. Paging – Diagram & Working

Paging is a memory management method where memory is divided into fixed-size blocks.

Logical memory → pages; Physical memory → frames.

Page size = Frame size.

Working:

1. CPU generates logical address (page number + offset).

2. Page number goes to page table.

3. Page table gives frame number.

4. Frame number + offset = physical address.

Advantages: No external fragmentation, easy memory management.

2. Page Replacement Algorithms

Used when page fault occurs and memory is full.

FIFO – Removes oldest page first.

LRU – Removes least recently used page.

Optimal – Removes page not needed for longest time.

Second Chance – FIFO with a use bit.

LFU – Removes least frequently used page.

3. Virtual Memory + Demand Paging

Virtual Memory:

Uses hard disk as extension of RAM. Allows large programs to run. Gives illusion of large memory.

Advantages: More programs run, efficient memory use, supports multiprogramming.

Demand Paging:

Pages loaded only when needed. Page fault occurs if page not in memory. OS loads page from
disk.

Benefits: Saves memory, reduces loading time.


4. Segmentation + Paging vs Segmentation

Segmentation:

Memory divided into variable-size segments like code, data, stack.

Logical address = segment number + offset.

Advantages: Programmer-friendly, modular.

Disadvantages: External fragmentation.

Paging vs Segmentation:

Paging: fixed-size pages, no external fragmentation.

Segmentation: variable-size segments, external fragmentation, logical division.

5. Fragmentation & Memory Allocation Methods

Fragmentation:

Internal – waste inside allocated fixed block.

External – free memory scattered in small holes.

Memory Allocation:

Single Contiguous – one process.

Fixed Partitioning – fixed-size partitions; internal fragmentation.

Dynamic Partitioning – variable partitions; external fragmentation.

Paging – fixed-size pages; no external fragmentation.

Segmentation – variable-size segments; external fragmentation possible.

You might also like