Scribd
Upload
33 views

Operating Systems

This document outlines a course on operating systems. The course code is V18CSTOE04 and it is worth 3 credits. It will cover key operating system concepts like processes, process scheduling, synchronization, deadlocks, memory management, virtual memory and file systems. The course has 6 units that will cover these topics in depth. The intended learning outcomes are for students to understand operating system services, process management concepts, synchronization techniques, deadlock prevention and detection, memory management and file systems. References for the course include textbooks by Silberschatz, Stallings and Tanenbaum.

Uploaded by

kusuma nadiminti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Operating Systems

This document outlines a course on operating systems. The course code is V18CSTOE04 and it is worth 3 credits. It will cover key operating system concepts like processes, process scheduling, synchronization, deadlocks, memory management, virtual memory and file systems. The course has 6 units that will cover these topics in depth. The intended learning outcomes are for students to understand operating system services, process management concepts, synchronization techniques, deadlock prevention and detection, memory management and file systems. References for the course include textbooks by Silberschatz, Stallings and Tanenbaum.

Uploaded by

kusuma nadiminti
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

VII Operating Systems Course Code: L T P C

Sem (Open Elective-II) V18CSTOE04 3 0 0 3

Course Outcomes: After Successful completion of the Course, the student will be able to:

CO1: Describe Operating System Services and System Calls. (K2)


CO2: Illustrate Process Management Concepts and CPU Scheduling Algorithms. (K3)
CO3: Demonstrate Process Synchronization primitives. (K3)
CO4: Demonstrate Deadlock Prevention, Avoidance and Detection methods. (K3)
CO5: Illustrate Memory Management Techniques and Page Replacement Algorithms. (K3)
CO6: Describe File System Concepts and Mass Storage Structures. (K2)

UNIT-I: Introduction: Operating-System Structure, Operating-System Services, User and Operating-


System Interface, System Calls, Types of System Calls.

UNIT-II: Process Management: Process Concept, Process Scheduling, Operations on Processes,


Interprocess Communication. Threads: Overview, Multithreading Models. CPU Scheduling: Basic
Concepts, Scheduling Criteria, Scheduling Algorithms

UNIT-III : Process Synchronization: The Critical-Section Problem, Peterson’s Solution,


Synchronization Hardware, Mutex Locks, Semaphores, Classic Problems of Synchronization, Monitors

UNIT-IV: Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks,
Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock

UNIT-V: Memory Management Main Memory: Swapping, Contiguous Memory Allocation,


Segmentation, Paging, Structure of the Page Table
Virtual Memory: Introduction, Demand Paging, Page Replacement, Allocation of Frames, Thrashing

UNIT-VI: Storage Management :Overview of Mass-Storage Structure, Disk Scheduling, File Concept,
Access Methods, Directory and Disk Structure, File-System Mounting, File Allocation Methods

Text Book:
1. Operating System Concepts, Abraham Silberschatz, ,Peter Baer Galvin,Greg Gagne, 9th Edition, John
Wiley and Sons Inc., 2012

Reference Books:
1. Operating Systems – Internals and Design Principles, William Stallings, 7th Edition, Prentice Hall,
2012
2. Modern Operating Systems, Andrew S. Tanenbaum, Third Edition, Addison Wesley,2007.

You might also like