Operating System Syllabus PDF

Operating System Semester:3rd Presented by Er.Harendra Bikram Shah (Lecturer) Department of BCA NAST  OUTLINES  Syllabus  Course Objective  Practical Works ...

Operating System Semester:3rd Presented by Er.Harendra Bikram Shah (Lecturer) Department of BCA NAST  OUTLINES  Syllabus  Course Objective  Practical Works  Tutorials  Evaluation System  SYLLABUS Course Code:CMP 230 Total Hour:48 Hrs Unit 1: Basic of Operating Systems [ 6 hours ] 1.1 Introduction, goals of operating system 1.2 Operating-System Structures and functions 1.3 Types of Operating Systems  Batch Processing  Multiprogramming  Multiprocessing  Networking  Real Time (RTOS)  Distributed  Embedded system 1.4 Kernel Data Structures, System Interface, System Calls 1.5 Virtual Machine UNIT- II: Process, Threads and Scheduling [13 hours] 2.1 Process 2.1.1 The Process Model 2.1.2 Process Creation and Process Termination 2.1.3 Process Hierarchies 2.1.4 Process States 2.1.5 Implementation of Processes 2.2 Threads 2.2.1 Thread Usage 2.2.2 Threads Models (Many-to-one model, One-to-One Model, Many-to many model) 2.2.3 User Space and Kernel Space Threads 2.2.4 Hybrid Implementations 2.2.5 Difference between Threads and Processes 2.3 Inter-process Communication 2.3.1 Race Conditions 2.3.2 Critical Regions 2.3.3 Mutual Exclusion with Busy Waiting 2.3.4 Sleep and Wakeup, Semaphores, Mutexes, Monitors, Message Passing 2.3.9 Avoiding Locks: Read-Copy-Update 2.4 Process Scheduling 2.4.1 Basic Concept 2.4.2 Type of scheduling (Preemptive scheduling, Non-preemptive scheduling, batch, Interactive, real time scheduling), 2.4.3 Scheduling Criteria or performance analysis, Scheduling Algorithm (Round-robin, First come first served, Shortest-job- first,  2.5 Deadlocks 2.5.1 System Resources: Preemptable and Non-preempable 2.5.2 Method of handling Deadlocks, 2.5.3 Deadlock prevention 2.5.4 Deadlock avoidance: Banker’s Algorithm, 2.5.5 Protection-  System Protection  Goals of Protection  Principles of Protection  Domain of Protection  Access Matrix  Implementation of Access Matrix  access Control list  2.6 Research on Processes and Threads UNIT- III: Storage Management [13 hours] 3.1 Memory Management 3.1.1 Logical & physical Address Space 3.1.2 Swapping 3.1.3 Contiguous Allocation 3.1.4 Paging, Structure of Page Table 3.1.5 Segmentation, Segmentation with Paging 3.2 Virtual Memory 3.2.1 Background 3.2.2 Demand Paging, 3.2.3 Performance of Demanding Paging, 3.2.4 Page Replacement, Page Replacement Algorithms, Allocation of Frames, 3.2.5 Thrashing. 3.3. File System Interface and Implementation 3.3.1 File System Interface- The Concept of a File, Access methods, Directory Structure, File System Mounting, File Sharing, Protection 3.3.2 File System Implementation-  File System Structure,  File System Implementation, and Allocation methods,  Free-space Management,  Directory Implementation,  Efficiency and Performance Unit IV : Input/output Management [ 7 hours ] 4.1 Principles of I/O Hardware-  I/O Device,  Device Controller,  Memory Mapped I/O,  Direct Memory Access 4.2 Principles of I/O Software-  Goals of I/O Software,  Polled I/O verses Interrupt Driven I/O,  Character User Interface and Graphical User Interface,  Device Driver,  Device Independent I/O Software,  User-space I/O Software 4.3 Mass Storage Structure  Overview of Mass Storage Structure  Disk Structure  Disk Attachment  Disk Scheduling  Disk Management  Swap space Management Redundant Array of Inexpensive Disks  RAM Disks  Optical Disk Unit V : Case Study [ 5 hours ] 5.1 Linux  Design principles,  Inter-process communication,  Kernel modules,  Network structure, and  Security in Linux/Windows 5.2 Windows  Design principles  Programmer interface  System components  Security level in Linux/Windows Unit VI : New Trend in Operating System [ 4 hours ] 6.1 Concept, character and role of Distributed, Cloud, Mobile and Multimedia operating systems Memory wall and bottleneck for operating system  Course Objective  To acquaint the students with Basic concept of structure of operating systems and their functionality.  To acquaint the students with basic concepts of resource allocation and management.  To develop the skills in students to select and measures the optimal resource allocation schedules.  To acquaint the students with the knowledge of process and thread, I/Os, Memory, CPU, disk management, network security systems.  To acquaint the students with basic concepts of operating systems new trends such as real-time, distributed, cloud systems and mobile.  Practical Works Students should complete the following tasks in laboratory: 1. Understanding and running all the internal command and external commands in Microsoft Disk Operating Systems. 2. Installation and user, application management in Windows (current version) 3. Simulation of Process Scheduling Algorithms 4. Simulation of Page Replacement Algorithms 4. Simulation of Disk Arm Scheduling Algorithms 5. System Administration (user, disk, role, etc.) in any open source operating system. Tutorial  Evaluation System InternalEvaluation Weight Marks ExternalEvaluation Marks Theory 30 Attendance&ClassParticipation 10% Assignments 20% Presentations/Quizzes 10% InternalAssessment 60% Practical 20 Semester- 50 Endexamination Attendance&ClassParticipation 10% LabReport/ProjectReport 20% PracticalExam/ProjectWork 40% Viva 30% Total Internal 50 FullMarks: 50 +50 = 100 THANK YOU