Siksha Sarovar

Siksha Sarovar (sikshasarovar.com) is a free educational web application that helps students in India learn programming and prepare for academic and competitive exams. The platform offers structured coding courses (C, C++, Python, Java, HTML, CSS, PHP, Power BI, AI, Machine Learning, Data Science), complete university curriculum notes for BCA/MCA students with previous year question papers, Class 10 and Class 12 CBSE/HBSE school notes, and dedicated preparation material for SSC, UPSC, Banking, Railway and other government exams. Browsing the site is completely free and requires no account. Users may optionally sign in with Google solely to save their learning progress, quiz scores and personal preferences across devices.

Privacy Policy | Terms of Service | Contact Siksha Sarovar | About Siksha Sarovar

v4.0.9 · PWA
Siksha Sarovar logo
Siksha Sarovar
Your Learning Universe

Siksha Sarovar is a free e-learning platform for coding courses, BCA university notes and competitive exam preparation. Optional Google sign-in saves your learning progress across devices.

Initializing knowledge base…
Compiling modules 0%

Unit 3: Overview

Lesson 17 of 31 in the free Operating System & Linux Programming notes on Siksha Sarovar, written by Rohit Jangra.

Unit 3: Memory Management, Virtual Memory and Deadlocks

This unit shows how the OS gives every process its own apparent address space when physical RAM is shared and finite, and how it copes when too many processes deadlock over scarce resources.

The Big Idea

The OS provides each process with a private virtual address space that may be larger than physical RAM. Hardware (the MMU) and OS data structures (page tables) translate virtual addresses to physical ones, paging data in and out of disk on demand.

When several processes hold partial resources and wait for each other forever, we have a deadlock — handled by prevention, avoidance, detection, or by ignoring it (the "ostrich algorithm").

Learning Outcomes

  • Distinguish logical and physical addresses; explain swapping, paging, segmentation.
  • Apply FIFO, Optimal, LRU, LFU/MFU page-replacement algorithms to a reference string.
  • Recognize and combat thrashing.
  • State the four conditions for deadlock and apply Banker's algorithm.