Scribd
Upload
2 views2 pages

OS CSC403 Syllabus Course Plan

The document outlines the course details for 'Operating Systems' (CSC 403) offered by the Department of Computer Science and Engineering, including prerequisites, course outcomes, and assessment methods. It covers various topics such as process management, multi-threading, synchronization, deadlocks, memory management, and file management. Additionally, it lists recommended textbooks and online resources for further learning.

Uploaded by

MY TALENT
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
2 views2 pages

OS CSC403 Syllabus Course Plan

The document outlines the course details for 'Operating Systems' (CSC 403) offered by the Department of Computer Science and Engineering, including prerequisites, course outcomes, and assessment methods. It covers various topics such as process management, multi-threading, synchronization, deadlocks, memory management, and file management. Additionally, it lists recommended textbooks and online resources for further learning.

Uploaded by

MY TALENT
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/ 2

Department of Computer Science and Engineering

Course Title of the Program Core Total Number of contact hours Credit
Code course (PCR) / Lecture Tutorial Practical Total
Electives (L) (T) (P) Hours
(PEL)
CSC Operating PCR 3 1 0 4 4
403 Systems
Pre-requisites Course Assessment methods (Continuous (CT), Mid-Term (MT) end
assessment (EA))
Introduction to [CA: 15%, MT: 25%, ET: 60%]
Computing
(CSC01), Data
Structures and
Algorithms (CSC303)
Course • CO1: Understanding functional architecture of an operating system
Outcomes • CO2: Understanding process control algorithms, deadlocks and multi-
threading
• CO3: Develop application programs using UNIX system calls.
• CO4: Design and solve control & data access synchronization problems
• CO5: Understanding virtual memory organization and management in OS
• CO6: Understand standard FAT & UNIX file system
Topics Introductory Concepts: Introduction to Operating System as a whole, memory,
Covered CPU(registers and ALU), Evolution of Operating System-types of OS(advantages and
drawbacks), Performance measurement metrics (5L)

Process Data Structures and State transitions: Process management, Basic


Definitions, Process table, PCB(process control block), PTE(process table entry), Process
states, Transition diagram, context of process-user level, kernel-level and process
Level (4 L)

Process Control: Process creation, Parent and Child processes, System calls--fork(),
exit(), wait(), kill(), Signal handling, Process scheduling strategies-FCFS, SPN, SRT,
Round Robin, HRRN, Fair share scheduling (6 L)

Multi-threading: Threads in OS, thread vs process, ULT & KLT, Applications of


threads, Use of POSIX threads library (4 L)

Process synchronization - Race condition, Critical section, Process Sync Solution using
Algorithmic approach (Lamport bakery Algorithm), Creating shared memory using
POSIX library, Basic IPC mechanisms (3 L)

Semaphore- Binary and Counting semaphore, P() and V() operations, Solving Classical
problem using semaphores- Sleeping barber, Producer-consumer, Reader-writer, Dining
philosophers’s, Posix library for semaphores (7 L)

Monitors - Solving Classical problems using monitors (4 L)

Deadlocks - Necessary and sufficient conditions for deadlocks, approaches to deal


with deadlocks, Deadlock Prevention,Avoidance(Banker’s algorithm) and Detection (3L)

Memory organization & management - Virtual memory organization, Pure Paging,


Pure Segmentation, Combined Paging-Segmentation, Inverted PMT, Page fault handling
algorithms, Working set theory (7 L)

File management- Directory structure, Storage of files on disks, contiguous and non-
contiguous file allocation strategies, Internal and external fragmentation, FAT & Inode
Structure, Free Space management, Disk scheduling strategies (6 L)
I/O management concepts (2 L)

Text Books, Text Books:


and/or 1. “Operating System Concepts”, Silberschatz and Galvin
reference 2. “Operating Systems: Internals and Design Principles” by William Stalling
material 3. “Operating Systems: A Concept-Based Approach” by D M Dhamdhere

Reference Books:

1. “Operating System: A Design-oriented Approach” by Charles Crowley


2. “Operating Systems: A Modern Perspective” by Gary J Nutt
3. “Design of the Unix Operating Systems” by Maurice Bach
4. “MODERN OPERATING SYSTEMS” by Andrew S Tanenbaum
5. “Beginning Linux Programming”, Mathew & Stones

Online Lecture Videos and Resource Materials:

Prof. P K Biswas, ECE, IIT Kharagpur;


https://www.youtube.com/watch?v=MaA0vFKtew&list=PLLDC70psjvq5hIT0kfr1sirNuees0NIbG

Prof. SantanuChattopadhyay, EEC, IIT Kharagpur


https://nptel.ac.in/courses/106/105/106105214/

Prof. Chester Rebeiro, CSE, IIT Madras;


https://nptel.ac.in/courses/106/106/106106144/(2016)

Prof. SouravBansal, CSE, IIT Delhi


https://nptel.ac.in/courses/106/102/106102132/(2018)

Prof V Kamakoti, CSE, IIT Madras https://nptel.ac.in/courses/106/106/106106157/(2017)

Prof. P C Bhatt, CSE, IIScBangalore;


https://nptel.ac.in/courses/106/108/106108101/(2009) (pdf only)

You might also like