Course Title: Operating Course Code: CACS251 Year/Semester: WAV Class Load: 6 Hrs. / Week (Theory: 3 Hrs, Tutorial: 1, Practical: 2 Hrs.) tem (3 Cr.) This course includes the topics that help students understand operating system and it’s functionality along with its types. Course Objectives The general objectives of this subject are Wo provide the basic feature, function and interface with the hardware and application software to run the computer smoothly. Course Contents Unit 1 Introduction to Operating System 2 Urs 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 2 Urs, Introduction, Layered System, Kemel, Types of Kernel (Monolithic/Macro Kernel and Micro / Exo-Kernel), Client-Server Model, Virtual Machines, Shell. Unit 3 Process Management 15 Hrs. Process Concepts(3 Hrs.): Definitions of Process, The Process Model, Process States, Process State Transition, The Proves Control Block, Operations on Processes (Creation, Termination, Hierarchies, Implementation). Cooperating Processes, System Calls (Process Management, File management, Directory Management). ‘Threads (I Mr): Definitions of Threads, Types of Thread Provess (Single aud Multithreaded Process), Benefits of Multithread, Multithreading Models (Many- to-One Model, One-to-One Model, Many-to Many Model). Inter-Process C Race Condition, Critical R ns, Avoiding Critical And Serializability, Mutual Exclusion Conditions Mutual Exclusion: Disabling Interrupts, Lock Va (Peterson's Solution), The TSL Insittetion, Sleep and Exclusion (Semaphore, Monitors, Mutexes, N a El phe Sleeping Barber's Problem) 5 cols and T s Problems, The Reader Serializability: L Problems (Dining Phile ki v PageProcess Scheduling(S Hrs): Basic Concept, ype of Scheduling (Preemptive Scheduling, Nonpreemptive Scheduling, Batch, Intersctive, 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, ‘chectuling, HRN, Multiple Queue, Multilevel Feedback Queue); Some Numerical Examples on Scheduling. Guaranteed, Lottery it 4 Deadlocks 4 Hrs. System Model, System Resources: Preemptable and Non-Preemptable; Conditions for Resource Deudlocks, 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 Memory Management 7 Hrs, Basic Memory Management (3 Hrs.); Introduction, Memory Hierarchy, Logical Versus Physical Addtess 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 Pattitioning Vs. Variable Partitioning, Relocation and Protection, Coalescing and Compaction. Virtual Memory (4 Hours): Background, Paging, Structure of Page Table Hierarchical Page Table, Hashed Page Table, Inverted Page Table, 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, Unit6 Input/ Output Device Management 4 Hrs. Principle of VO Hardware: 0 Devices, Device Controllers, Memory Mapped VO, Direct Memory Access; Principle of 1/0 Software: Goals of /O Software, Program 1/O, Interrupt -Driven VO, VO Using DMA; VO Software Layers: Interrupts Handler, Device Drivers, Device Independent 1/0 Software, User - Space I/O Software; Disk: Disk Hardware: Disk Scheduling: Seek Time, Rat er Time: Disk Scheduling Algorithms: FCFS Scheduling, SSTF SCAN Scheduling, C-SCAN Scheduling, Lock Scheduling Unit 7 File System Interface M: 2 Hrs. File Concept: File Naming File Type, ile Ace File Operation and File Descriptors: Diréctor’ Directory Systems, Hierarchical Directory Systems, Path ‘Operation; Access W : g Pee? tsMethods: Sequential, Direct; Protection: ‘Types of Access, Access Control List, ity Management 3 Mrs. 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 Bufler Overflow; System Threats: Worms, Viruses, Denial of Services. Unit 9 Distributed Operating System 4 Hrs, Introduction, Advantages of Distributed System over Centralized System Advantages of Distributed System over Independent PCs, Disadvantages Distributed System, Hardware and Software Concepts, Communication in Distributed Systems, Message Passing, Remote Procedure Call, Process. in Distribution System, Clock Synchronization. it 10 Case Study 2 Hrs. DOS and Windows Operating System, Unix Operating System, Linux Operating System ry Works Lab works should be done cavering all the topies listed above and a small project work should be carried out using the concept learnt in this course, Project should be assigned on Individual Basis. ‘Teaching Methods The general teaching pedagogy includes class lectures, group discussions, case studies, guest lectures, research work, project work, assignments (theoretical and practical), and examinations (written and verbal), depending upon the nature of the topics, The teaching fuculty will determine the choice of teaching pedagouy as per the need of the topics, Examination Scheme Internal Assessment | External Assessment Theory Practical, | Theory | Practical | Total 20 20 60 100 G Hrs.) Page | 56Text Books 1. Andrew S, Tanenbaum, "Modern Operating System 6/e", PHIL, 2011/12 2, Silberschavz, P.B. Galvin, G. Gagne, "Operating System Concepts 8/e ", Wiley India, 2014 ISBN : 9788126520510 Reference Books 1. Andrew S. Tanenbaum, "Distributed Operating System", Pearson 2. DM Dhamdhere, Hill, 2009 P, Pal Choudhury, "Operating Systems Principles and Design’ PHI, 2011 ¥, YY System Programming and Operating System", Tata MeGraw-