Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
19 views4 pages

OS Syllabus

The document outlines a course on Operating Systems divided into four modules covering topics such as process management, memory management, synchronization, and file systems, totaling 36 hours of instruction. It includes specific chapters from a textbook as references for each module. Upon completion, students will gain knowledge in threads, process synchronization, CPU scheduling, memory concepts, and file system protection.

Uploaded by

bshrey.professionals26
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
19 views4 pages

OS Syllabus

The document outlines a course on Operating Systems divided into four modules covering topics such as process management, memory management, synchronization, and file systems, totaling 36 hours of instruction. It includes specific chapters from a textbook as references for each module. Upon completion, students will gain knowledge in threads, process synchronization, CPU scheduling, memory concepts, and file system protection.

Uploaded by

bshrey.professionals26
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/ 4

Module -1 Teaching

Hours
INTRODUCTION: 10 Hours

What Operating Systems Do, Operating System Structure, Operating System


Operations, Process Management, Memory Management, Storage Management.

OPERATING SYSTEM STRUCTURE:

Operating System Services, User and Operating System Interface, System Calls,
Types of System Calls, System Programs, Operating System Structure, System
Boot.

PROCESS CONCEPT:

Overview, Process Scheduling, Operations on Processes, Interprocess


Communication.

THREADS:

Overview, Multithreaded Models, Thread Libraries.

Text Book 1: Chapter: 1: 1.1,1.4-1.8, Chapter: 2: 2.1– 2.5, 2.6,2.7.1-2.7.3, 2.10,


Chapter: 3: 3.1-3.4, Chapter: 4: 4.1-4.4
Module -2

10 Hours

PROCESS SCHEDULING:

Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread


Scheduling

SYNCHRONIZATION:

Background, The Critical Section Problem, Peterson’s Solution,


Synchronization Hardware, Mutex Locks, Semaphores.
DEADLOCKS:
System Model, Deadlock, Characterization, Methods for handling deadlocks,
Deadlock prevention, Deadlock Avoidance.

Text Book 1: Chapter 5: 5.1-5.4, Chapter: 6: 6.1-6.6, Chapter: 7: 7.1 -7.5

Module – 3

MEMORY MANAGEMENT: 10 Hours

Logical Versus Physical Address Space, Swapping, Contiguous Memory


Allocation, Segmentation, Paging, Structure of the Page Table.

Background, Demand Paging, Copy-On-Write, Page Replacement, Allocation of


Frames, Thrashing. Mass-Storage Structure, Disk Scheduling, Swap-Space
Management

Text Book 1: Chapter 8: 8.1.3,8.2-8.6, Chapter 9: 9.1-9.6, Chapter 12: 12.2


12.4,12.6
Module - 4

IMPLEMENTING FILE-SYSTEM: 6 Hours

File Concept, Access Methods, Directory and Disk Structure, File System
Mounting

SYSTEM PROTECTION:
Goals of Protection, Principles of Protection, Domain of Protection, Access
Matrix Implementation of Access Matrix.

Text Book 1: Chapter 10: 10.1- 10.4, Chapter 14 :14.1- 14.5


Course outcomes:

After studying this course, students will be able to:


1. Know the concepts of threads and process.
2. Implement different types of process synchronization problems
3. Implement different CPU scheduling and deadlock algorithms
4. Understand main memory, virtual memory concepts
5. Understand file systems and protection related to a general operating system
Text Books:
1. A. Silberschatz, P. B. Galvin and G. Gagne, Operating System Concepts, (9e), Wiley and
Sons (Asia) Pte Ltd, 2016.

You might also like