Scribd
Upload
32 views

AOS Syllabus

The document outlines a course on advanced operating systems. It covers five units on topics like process management, memory management, file systems, security and distributed systems. It lists course objectives, outcomes and mapping to program outcomes. The course aims to teach state-of-the-art operating systems and engage students in related research.

Uploaded by

gy7q9nfgcr
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views

AOS Syllabus

The document outlines a course on advanced operating systems. It covers five units on topics like process management, memory management, file systems, security and distributed systems. It lists course objectives, outcomes and mapping to program outcomes. The course aims to teach state-of-the-art operating systems and engage students in related research.

Uploaded by

gy7q9nfgcr
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

M.Tech.

in Computer Science & Engineering Semester II

MCO 003B Advanced Operating Systems 3-0-0

Course Objective:

 To introduce the state of the art in operating systems and distributed systems,
 Learn how to design modern operating systems.
 To understand how to engage in systems research in general and operating systems
research in particular.
 To investigate novel ideas in operating systems through a semester-long research
project.

Operating System: Definition, Operating System as Resource Manager.


Types of Operating Systems: Simple Batch Processing, Multi-programmed
Batch Processing, Time Sharing, Personal Computer systems, Parallel,
UNIT 1: Distributed and Real Time Operating Systems. Operating System
Components, Services, Calls, System Programs, Operating System
Structure, Virtual Machines, System Design and Implementation.

Process Management: Concepts, Scheduling, Operations, Co-operating


processes, Inter-process Communication. Threads: Thread usage, threads in
User Space, threads in Kernel, Hybrid Implementation, Scheduler
Activation, Pop-up threads, Multithreading.
UNIT 2:
CPU Scheduling: Basic Concepts, Scheduling Criteria, Algorithms,
Multiple-processor Scheduling, Real Time Scheduling, Algorithm
Evaluation.
Process Synchronization: Critical Section Problem, Synchronization
Hardware, Semaphores, Classical Problem of synchronization, Critical
Regions, Monitors. Deadlock: Characteristics, Necessary Conditions,
Prevention, Avoidance, Detection and Recovery.
UNIT 3:
Memory Management: Logical and Physical Address Space, Swapping.
Contiguous Allocation: Singlepartitioned, Multi-partitioned. Non-contiguous
Allocation: Paging, Segmentation, and Segmentation with Paging. Virtual
Memory: Demand Paging, Page Replacement Algorithms, Allocation of
Frames, Thrashing, Demand Segmentation.
File and Directory System: File Concepts, Access Methods, Directory
Structure, Protection, File system Structure, Allocation Methods, Free Space
Management, Directory Implementation, Recovery. Secondary Storage
Management: Disk Structure, Dedicated, Shared, Virtual, Sequential
Access and Random Access Devices, Disk Scheduling, Disk Management,
UNIT 4: Swap-space Management, Disk Reliability, Stable Storage Management.

Protection and Security: Threats, Intruders, Accidental Data Loss,


Cryptography, User authentication, Attacks from inside the system, Attacks
from outside the system, Protection Mechanism, Trusted Systems, Domain
of Protection, Access Matrix, Programs Threats, System Threats.
Distributed systems, topology network types, design strategies. Network
operating structure, distributed operating system, remote services, and
design issues. Distributed file system: naming and transparency, remote file
access, Stateful v/s Stateless Service, File Replication.
UNIT 5:
Distributed co-ordinations: Event Ordering, Mutual Exclusion, Atomicity,
Concurrency Control, Deadlock Handling, Election Algorithms, and
Reaching Agreement. Case studies of Unix and MS-DOS operating system.

Suggested Books
1. Silberschatz and Galvin, "Operating System Concepts", Addison-Wesley publishing,
Co.,1999.
2. A. S. Tanenbaum, “Modern Operating Systems”, Pearson Education.
3. H.M. Dietel, “An Introduction to Operating System”, Pearson Education.
4. D. M. Dhamdhere, “Operating Systems – A Concept Based Approach”, Tata McGraw-Hill
5 M. Singhal, N. G. Shivaratri, “Advanced Concepts in Operating Systems”, Tata McGraw
-Hill.
6. William Stallings, “Operating Systems”, Pearson Education

Course Outcomes:

At the end of the course, the student should be able to:

CO1. Understand the state of the art in operating systems and distributed systems, and how
to design modern operating systems.
CO2. Understand how to engage in systems research in general and operating systems
research in particular.
CO3. Investigate novel ideas in operating systems through a semester-long research project.
CO4. Understand the internal structure of the file system and security in the operating
system.
CO5. Evaluate methodological issues underlying the effective application of Distributed
systems.
MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF PROGRAM
OUTCOMES AND PROGRAM SPECIFIC OUTCOMES:
Course Program Outcome Program
Outcome Specific
Outcome

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 H H M L H M
CO2 H H M M H M H H H
CO3 H H H H H M H H H H
CO4 H M M M H M M
CO5 M M M M M M L
H = Highly Related; M = Medium L = Low

You might also like