Scribd
Upload
9 views5 pages

Operating Systems Study Notes

The document provides an overview of Operating Systems, detailing their definition, functions, types, and system calls. It covers key concepts in process management, synchronization, deadlocks, memory management, and file systems, including various scheduling algorithms and memory allocation techniques. Each unit highlights essential components and tools necessary for understanding OS functionality and management.

Uploaded by

rt
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
9 views5 pages

Operating Systems Study Notes

The document provides an overview of Operating Systems, detailing their definition, functions, types, and system calls. It covers key concepts in process management, synchronization, deadlocks, memory management, and file systems, including various scheduling algorithms and memory allocation techniques. Each unit highlights essential components and tools necessary for understanding OS functionality and management.

Uploaded by

rt
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/ 5

Operating Systems - Study Notes

Unit 1 - Introduction to OS
• Definition: OS is a program that acts as an interface between user and hardware.

• Functions: Process management, Memory management, File management, I/O system


management, Security.

• Types of OS: Batch, Time-sharing, Distributed, Real-time, Multiprogramming,


Multiprocessing.

• System Calls: Interface between process and OS (examples: fork, exec, read, write).
Unit 2 - Process Management
• Process: Program in execution.

• Process States: New, Ready, Running, Waiting, Terminated.

• PCB (Process Control Block): Stores process information.

• Scheduling: FCFS, SJF, Priority Scheduling, Round Robin, Multilevel Queue.


Unit 3 - Synchronization & Deadlocks
• Race Condition: When processes share data concurrently.

• Synchronization tools: Mutex, Semaphores, Monitors.

• Deadlock: A situation where processes wait indefinitely.

• Deadlock Conditions: Mutual exclusion, Hold & wait, No preemption, Circular wait.

• Deadlock Handling: Prevention, Avoidance (Banker’s Algorithm), Detection, Recovery.


Unit 4 - Memory Management
• Concepts: Logical vs Physical address space.

• Swapping, Contiguous Allocation.

• Paging: Divides memory into fixed-size blocks.

• Segmentation: Divides memory based on logical divisions.

• Virtual Memory: Demand paging, Page replacement algorithms (FIFO, LRU, Optimal).
Unit 5 - File System and IO
• File: Collection of related information.

• File Access Methods: Sequential, Direct, Indexed.

• Directory Structures: Single-level, Two-level, Tree, Acyclic Graph.

• Disk Scheduling: FCFS, SSTF, SCAN, C-SCAN, LOOK.

• I/O Systems: Spooling, Buffering, Caching.

You might also like