0% found this document useful (0 votes)
9 views

Operating System

syllabus

Uploaded by

yopax90880
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
9 views

Operating System

syllabus

Uploaded by

yopax90880
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
Course Title: Operating System (3 Cr.) Course Code: CACS251 Year/Semester: M/V Class Load: 6 Hrs. / Week (Theory: 3 Hrs, Tutorial: 1, Practical: 2 Hrs.) Course Description 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 to 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 Hrs. History, Introduction and Generation of Operating System, Objectives (Resource Manager and Extended Machine), Types of Operating system, Function of Operating system, it 2 Operating System Structure 2 Hrs. Introduction, Layered System, Kemel, ‘Types of Kernel (Monolithie/Macro Kemel 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 Process Control Block, Operations on Processes (Creation, Termination, Hierarchies, Implementation), Cooperating Processes, System Calls (Process Management, File management, Directory Management). Threads (1 Mr): 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 Communi and Synehronization(6 Hrs): Introduction, Race Condition, Critical Ré ding Critical Region: Mutual Exclusion And Serializability; Mutual Exclusion Conditions, Mutual Exclusion: Disablidg. Interrupts, (Peterson's Solution), The TSL Insttuction, Exclusion (Semaphore, Monitors, Mutexes, M Serializability: Locki Problems (Dining Philosophers Problems, The R Sleeping Barber's Problem) Protocols and Time Sta Process Scheduling(5 Hrs): 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, HRN, Multiple Queue, Multilevel Feedback Queue); Some Numerical Examples on Scheduling, Deadlocks 4 Hrs, 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. Memory Management 7 Hrs, Basic Memory Management (3 Hrs.): Introduction, Memory Iierarchy, 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, Coaleseing and Compaction. Virtual Memory (4 Hours): Background, Paging, Structure of Page Table: Hictarchical 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, Thrishing, Segmentation, Segmentation With Paging. Unité Input/ Output Device Management 4 Hrs. Principle of /O Hardware: YO Devices, Device Controllers, Memory Mapped VO, Direct Memory Access; Principle of 1/0 Software: Goals of 1/0 Software, Program I/O, Interrupt -Driven VO, /O Using DMA; V/O Software Layers: Interrupts, Handler, Device Drivers, Device Independent /O Software, User - Space 1/O Software: Disk: Disk Hardware; Disk Scheduling: Seek Time, Ratio Delay, Transfer Time; Disk Scheduling Al C-SCAN Schedulin Unit7 Pile System Interface Manages! File Concept: File Naming, File Structure, File T File Operation and File Descriptors; Direclpries: Si Hierarchical Directory Systems, Path Names, Direttory “Operation; Access on , File Access, Eile evel Directory Systems Page | 5 Methods; Sequential, Direct; Protection: Types of Access, Access Control List, Aceess Control Matrix Unit 8 Security Management 3 Hrs. 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 Buller 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 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 2 Hrs. DOS and Windows Operating System, Unix Operating System, Linux Operating System Laboratory Works Lab works should be done covering all the topics 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 jgnments (theoretical and studies, guest lectures, research work, project work, as practical), and examinations (written and verbal), depending upon the nature of the topics. The teaching faculty will determine the choice of teaching pedagogy as per the need of the topics. Evaluation Examination Scheme Internal Assessment] Extermal Assessment Theory | Practical, [ Theory ] Practical | Total fi 20 20 60 5 100: GHrs) | Guisy - Page | 56 Text Books I. Andrew S. ‘Tanenbaum, "Modern Operat 2, Silberschatz, P.B. Galvin, G. Gagne, India, 2014 ISBN : 9788126520510 ng System 6/e", PEL, 2011/12 Operating System Concepts 8/e *, Wiley Reference Books 1. Andrew S. Tanenbaum, "Distributed Operating System", Pearson 2. DM Dhamdhere, "System Programming and Operating System", Tata MeG Hill, 2009 3. P, Pal Choudhury, "Operating Systems Princ

You might also like