Operating Systems Syllabus
Unit 1: Introduction
- Concept of Operating Systems
- Generations of Operating Systems
- Types of Operating Systems
- OS Services
- System Calls
- Structure of an OS - Layered, Monolithic, Microkernel Operating Systems
- Concept of Virtual Machine
- System Call Interface for Process Management: fork, exit, wait, waitpid, exec
Unit 2: Processes
- Definition
- Process Relationship
- Different States of a Process
- Process State Transitions
- Process Control Block (PCB)
- Context Switching
- Thread: Definition, Various States, Benefits of Threads, Types of Threads, Concept of Multi
Threads
- Process Scheduling: Foundation and Scheduling Objectives
- Types of Schedulers
- Scheduling Criteria: CPU Utilization, Throughput, Turnaround Time, Waiting Time, Response Time
Operating Systems Syllabus
- Scheduling Algorithms: Pre-emptive and Non-preemptive, FCFS, SJF, RR, Priority, Preemptive
Priority, SRTF
Unit 3: Inter-process Communication
- Critical Section
- Race Conditions
- Mutual Exclusion
- Hardware Solution
- Strict Alternation
- Peterson's Solution
- The Producer-Consumer Problem
- Semaphores
- Message Passing
- Classical IPC Problems: Reader's and Writer Problem, Dining Philosopher Problem
- Deadlocks: Definition, Necessary and Sufficient Conditions for Deadlock, Deadlock Prevention
- Deadlock Avoidance: Banker's Algorithm (Safety and Resource Request Algorithm)
- Deadlock Detection and Recovery
Unit 4: Memory Management
- Basic Concept
- Logical and Physical Address Map
- Memory Allocation: Contiguous Memory Allocation - Fixed and Variable Partition
- Internal and External Fragmentation
Operating Systems Syllabus
- Compaction
- Paging: Principle of Operation, Page Allocation, Hardware Support for Paging, Page Fault,
Demand Paging
- Page Replacement Algorithms: Optimal, FIFO, Second Chance (SC), Least Recently Used (LRU)
Unit 5: Disk Management
- Disk Structure
- Disk Scheduling Algorithms: FCFS, SSTF, LOOK, C-LOOK, SCAN, C-SCAN