Course Title: Operating System (3 Cr.)
Course Code: CACS2S1
Class Load: 6 Hrs. / Week (Theory: 3 Hrs, Tutorial: I, Practical: 2 Hrs.)

Unit 1 Introduction to Operating System

History. Introduction and Generation of Operating System, Objectives (Resource Manager and Extended Machine), Types of Operating system. Function of Operating system. 

Unit 2 Operating System Structure

 Introduction. Layered System. Kernel. Types of Kernel (Monolithic/Macro Kernel and Micro Exo-Kernel), Client-Server Model. Virtual Machines, Shell. 

Unit 3 Process Management

Process Concepts: Definitions of Process, The Process Model, Process States. Process State Transition. The Process Control Block, Operations on Processes (Creation, Termination, Hierarchies, Implementation). Cooperating Processes, System Calls (Process Management. File management, Directory Management). 

Threads : Definitions of Threads, Types of Thread Process (Single and Multithreaded Process). Benefits of Multithread. Multithreading Models (Many-to-One Model. One-to.One Model. Many-to Many Model). 

Inter-Process Communication and Synchronization Introduction, Race Condition. Critical Regions. Avoiding Critical Region: Mutual Exclusion And Serializability: Mutual Exclusion Conditions, Proposals for Achieving Mutual Exclusion: Disabling intrrupt. Lock Variable. Strict Alteration (Peterson's Solution). The TSL Instructions. Sleep and Wakeup. Types of Mutual Exclusion (Semaphore. Monitors. Mutexes Message Passing; Bounded Buffer). Serializability: Locking Protocols aria Time  Stamp Protocols: Classical IPC Problems (Dining Philosophers Problems/The Readers and 'Writers Problem. The Sleeping Barber's Problem)'

Process Scheduling Basic Concept. Type of Scheduling (Preemptive Scheduling. Nonpreemptive Scheduling. Batch, interactive. Real Time Scheduling). Scheduling Criteria or Performance Analysis. Scheduling Algorithm (Round-Robin, First Come First Served, Shortest-Job- First. Shortest Process Next. Shortest Remaining Time Next, Real Time. Priority Fair Share, Guaranteed, lottery Scheduling. URN, Multiple Queue. Multilevel Feedback Queue): Some Numerical Examples on Scheduling. 

Unit 4 Deadlocks

System Model. System Resources: Preemptable and Non-Preemptable; Conditions for Resource Deadlocks. Deadlock Modeling, The OSTRICH Algorithm. Method of Handling Deadlocks. Deadlock Prevention. Deadlock Avoidance: Banker's Algorithm. Deadlock Detection: Resource Allocation Graph, Recovery from Deadlock. 

Unit 5. Memory Management 

Basic Memory Management  Introduction, Memory hierarchy. Logical Versus Physical Address Space, Memory Management with Swapping: Memory Management with Bitmaps and with Linked List; Memory Management without Swapping, Contiguous-Memory Allocation: Memory Protection, Memory Allocation, Fragmentation (Inter Fragmentation and External Fragmentation); Non-Contiguous Memory Allocation, Fixed Partitioning Vs. Variable Partitioning, Relocation and Protection, Coalescing and Compaction. 

Virtual Memory  Background, Paging. Structure of Page Table: Hierarchical Page Table. Hashed Page Table, Inverted Page -Fable, Shared Page Table: Block Mapping Vs. Direct Mapping, Demand Paging, Page Replacement and Page Faults, Page Replacement Algorithms: FIFO,OPR,LRU, SCP; Some Numerical Examples on Page Replacement, Thrashing, Segmentation, Segmentation With Paging. 


Unit 6 Input/ Output Device Management 

Principle of I/O Hardware: Devices, Device Controllers. Memory Mapped I/O. Direct Memory Access; Principle of I/O Software: Goals of L'O Software. Program 110, Interrupt -Driven I/O. I/O Using DMA, I/O Software Layers: Interrupt Handler, Device Drivers, Device Independent 1/0 Software. User - Space I/O Software; Disk: Disk Hardware: Disk Scheduling: Seek lime. Rational Delay. Transfer Time; Disk Scheduling Algorithms: FCFS Scheduling. SSTF Scheduling. SCAN Scheduling. SCAN Scheduling. Lock Scheduling 

Unit 7 File System Interface Management

File Concept: File Naming,File Structure. File Type. File Access. File Attributes. File Operation and File Descriptors: Directories: Single-Level Directory Systems. Hierarchical Directory Systems. Path Names. Directory Operation; Access Methods: Sequential, Direct; Protection: Types of Access, Access Control List, Access Control Matrix  

Unit 8 Security Management

 Introduction. Security Problems. User Authentication: Passwords, password Vulnerabilities. Encrypted password. One Time Password and Biometrics password; User Authorization. Program Threats: Trojan Horse, Trap Door, Stack and Buffer Overflow: System Threats: Worms. Viruses. Denial of Services.
 
Unit 9 Distributed Operating System

Introduction. Advantages of Distributed System over Centralized System, Advantages of Distributed System over Independent PCs, Disadvantages of Distributed System, Hardware and Software Concepts, Communication in Distributed Systems, Message Passing. Remote Procedure Call. Process in Distribution System, Clock Synchronization. 

Unit 10 Case Study

DOS and Windows Operating System, Unix Operating System, Linux Operating System