Course Course Course L T P C

18CSC266J OPERATING SYSTEMS C Professional Core

Code Name Category 3 0 2 4

Pre-requisite Co-requisite Progressive

Nil Nil Nil
Courses Courses Courses
Course Offering Department Computer Science and Engineering Data Book / Codes/Standards Nil

Course Learning Rationale

The purpose of learning this course is to: Learning Program Outcomes (PO)
(CLR):
CLR-1 : Understand the structure, function and services of Operating systems 1 2 3 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
CLR-2 : Learn about the process and threads
CLR-3 : Learn the UNIX OS file system and its services

Environment & Sustainability

CLR-4 : Understand the importance and principles of schedulers in operating system

Analysis, Design, Research

Level of Thinking (Bloom)

Expected Proficiency (%)

Expected Attainment (%)

Individual & Team Work

CLR-5 : Learn the concurrency problem and its solutions

Engineering Knowledge

Design & Development

Project Mgt. & Finance

CLR-6 : Understand the different memory management schemes

Modern Tool Usage

Life Long Learning

Society & Culture
Problem Analysis
CLR -7

Communication
Learn the Input, Output and file management paradigms used by operating system
:

PSO – 3
PSO - 1

PSO - 2
Ethics
Course Outcomes (CO): At the end of this course, learners will be able to:

CO-1 : Create process and threads using system commands 3 60 70 1 3 - 3 - - - - - - - - - - -

CO-2 : Execute UNIX OS file commands 3 60 70 3 3 - 3 - - - - - - - - - - -
CO-3 : Implement pre-emptive and Non pre-emptive schedulers 3 60 70 2 3 - 3 - - - - - - - - - - -
CO-4 : Implement mutual exclusion using semaphores to avoid concurrency problems 3 60 70 2 3 - 3 - - - - - - - - - - -
CO-5 : Implement algorithms of various memory management schemes 3 60 70 3 3 - 3 - - - - - - - - - - -
CO-6 : Implement algorithms used for disk scheduling 3 60 70 2 3 - 3 - - - - - - - - - - -

Duration 15 15 15 15
15
(hour)
Concept of Operating Systems (OS), Foundation and Scheduling objectives Concurrent processes, precedence Basic concept of memory management I/O devices and Device controllers
SLO-1 graphs,Critical Section, Race Conditions
S-1 Generations of OS
Types of OS, OS Services Types of Schedulers Mutual Exclusion,Hardware Solution Logical and Physical address maps Direct Memory Access and Principles of
SLO-2
I/O
Interrupt handling Schedulingcriteria: CPU utilization, Semaphores, Strict Alternation Memoryallocation: Contiguous Memory Concept of File, Access methods
SLO-1
Throughput, Turnaround Time allocation
S-2
System Calls and its types Waiting Time, Response Time Peterson’s Solution Fixed and variable partition File types and File operations
SLO-2
Pre-emptive and non-pre-emptive The Producer/ Consumer Problem, Internal and External fragmentation Directory structure
SLO-1 Basic architectural concepts of an OS
scheduling Event Counters
S-3
FCFS Monitors, Message Passing Compaction File System structure
SLO-2 Concept of Virtual Machine
SLO-1 Lab 1: Study of system calls , services Lab4 :Implementation of FCFS Lab 7 :Implementation of producer Lab10: Implementation of memory Lab 13: Simulation of file organization
S and its commands scheduling consumer problem partitioning, fragmentation and techniques using single directory and
4-5 SLO-2 compaction hierarchical structure.
 Resource Manager view SJF Classical IPC Problems: Reader’s & Basics of Virtual Memory Allocation methods (contiguous, linked,
SLO-1
Writer Problem, indexed)
S-6
Process view and hierarchical view of RR Dinning Philosopher Problem,Barber’s Hardware and control structures Free-space management (bit vector,
SLO-2
an OS shop problem linked list, grouping)
Process: Definition, Process Multiprocessor scheduling Necessary and sufficient conditions for Localityof reference Directory implementation(linear list,
SLO-1
Relationship Deadlock hash table)
S-7 Different states of a Process Real Time scheduling DeadlockPrevention, and Deadlock Page allocation Efficiency and performance
SLO-2 Avoidance

Process Statetransitions RM Banker’s algorithm Partitioning Disk structure

SLO-1
S-8
Process Control Block (PCB) EDF Deadlock detection and Recovery Paging and Page fault Disk scheduling – FCFS
SLO-2
SLO-1 Lab 2: Implementation of new process Lab 5: Implementation of SJF and RR Lab 8: Implementation of Banker’s Lab 11: Lab 14:Implementation of Disk
S creation and its communications Scheduling algorithm for Deadlock avoidance scheduling algorithm - FCFS
Implementation of paging and
9-10 SLO-2
calculation of page fault
Context switching Case study: UNIX OS file system Concurrent Programming:Critical Working Set, Segmentation, SSTF
SLO-1 region Demandpaging
S-11
Shell conditional critical region PageReplacement algorithms: Optimal SCAN
SLO-2 Threads: Definition
Various states of threads Filters Monitors First in First Out (FIFO) C-SCAN
SLO-1
S-12
Benefits of threads Shell programming Concurrent languages Second Chance (SC) Disk reliability
SLO-2
Programming with the standard I/O Communicating sequential process Notrecently used (NRU) Disk formatting
SLO-1 Types of threads
(CSP)
S-13
UNIX system calls Deadlocks - prevention, avoidance, Least Recently used (LRU) Boot-block and Bad blocks
SLO-2 Concept ofmultithreads
detection and recovery
SLO-1 Lab 3: Implement of thread creation Lab 6: Implementation of Unix Lab9: Applications of concurrent Lab 12:Implementation of page Lab 15 :Implementation of Disk
S and deletion Commands programming scheduling algorithm – SSTF and
replacement algorithms – FIFO and
14- SCAN
SLO-2 LRU
15

1. Operating System Concepts Essentials.AbrahamSilberschatz, Peter Baer Galvin and

4. Operating Systems: A Modern Perspective. Gary J. Nutt.
Learning Greg Gagne.
5. Design of the UNIX Operating Systems. Maurice J. Bach.
Resources 2. Operating Systems: Internals and Design Principles. William Stallings.
6. Understanding the Linux Kernel, Daniel Pierre Bovet, Marco Cesati
3. Operating System: A Design-oriented Approach. Charles Patrick Crowley.

Learning Assessment

Continuous Learning Assessment (50% weightage)

Bloom’s
Final Examination (50% weightage)
Level of Thinking
CLA – 1 (10%) CLA – 2 (15%) CLA – 3 (15%) CLA – 4 (10%)
 Theory (5%) Practice (5%) Theory (7.5%) Practice (7.5%) Theory (7.5%) Practice (7.5%) Theory (5%) Practice (5%) Theory (25%) Practice (25%)

Level 1 Remember 20% 15%

Level 2 Understand 20% 25% 25% 25% 10%

Level 3
Apply 45% 30% 40% 35% 40% 40% 40% 20% 35% 30%

Level 4
Analyze 15% 40% 20% 35% 20% 30% 20% 50% 20% 35%

Level 5
Evaluate 30% 30% 30% 30% 10% 35%

Level 6
Create 15% 15% 15% 10%

Total 100 % 100 % 100 % 100 % 100 % 100 % 100% 100% 100% 100%

# CLA – 4 can be from any combination of these: Assignments, Seminars, Tech Talks, Mini-Projects, Case-Studies, Self-Study, MOOCs, Certifications, Conf. Paper etc.,

Course Designers
Experts from Industry Experts from Higher Technical Institutions Internal Experts
1. Ms.A.Jackulin Mahariba, SRMIST,
1. Experts from TCS
Kattankulathur