DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

COURSE INFORMATION

Course Code & Course Title :AL3452OPERATING SYSTEMS

Academic Year/Sem : 2023-2024 (EVEN)
Offering Semester : IV
Credits (L T P C) :3024
Course in-charge : Premalatha M

ABOUT THE COURSE & CONTENTS

The operating system (OS) manages all of the software and hardware on the
computer. It performs basic tasks such as file, memory and process management,
handling input and output, and controlling peripheral devices such as disk drives and
printers.
Program Outcomes addressed
PO Program Outcome
Engineering knowledge: Apply the knowledge of mathematics, science,
1 engineering fundamentals, and an engineering specialization to the solution of
complex engineering problems.
Problem analysis: Identify, formulate, research literature, and analyze
2 complex engineering problems reaching substantiated conclusions using first
principles of mathematics, natural sciences, and engineering sciences.
Design/development of solutions: Design solutions for complex engineering
problems and design system components or processes that meet the specified
3
needs with appropriate consideration for the public health and safety, and the
cultural, societal, and environmental considerations.
Conductinvestigationsofcomplexproblems:Useresearch-
4 basedknowledgeandresearchmethodsincludingdesignofexperiments,analysisand
interpretationofdata,andsynthesisoftheinformationtoprovidevalidconclusions.
Moderntoolusage:Create,select,andapplyappropriatetechniques,resources,an
dmodernengineeringandITtoolsincludingpredictionandmodelingtocomplexengin
5
eeringactivitieswith an understandingofthelimitations.

Individualandteamwork: Functioneffectivelyasanindividual,andasamemberor
leaderindiverseteams,andinmultidisciplinarysettings.
9

10 Communication:Communicateeffectively oncomplex
engineeringactivitieswiththeengineering community and with society at large,

1
 such as, being able to comprehend and
writeeffectivereportsanddesigndocumentation,makeeffectivepresentations,andg
iveand receiveclearinstructions.

Projectmanagementandfinance:
Demonstrateknowledgeandunderstandingoftheengineering and management
11 principles and apply these to one’s own work, as a member andleader in
ateam,tomanageprojectsandinmultidisciplinaryenvironments.

Life-longlearning:Recognizetheneedfor,andhavethepreparationandabilityto
engage
12
inindependentandlifelonglearninginthebroadestcontextoftechnologicalchange.

Program Specific Outcomes addressed

PSO Program Specific Outcome

Use data design techniques and data science algorithms to provide solutions to
1
the problems in the field of data science.
Solve problems in the fields of artificial intelligence, big data, and cloud
2
computing using standard AI techniques.

Course Outcomes
At the end of the course students will have the ability to

Class
Session
C
CO Course Outcomes POs s
L
(approx
.)
Analyze various scheduling A
CO1 PO1, PO2, PO3,PO5,
algorithms and process 7+5
PO10, PO12,PSO1 P
synchronization.
Explain deadlock, A
CO2 PO1, PO2, PO3, PO5,
prevention and avoidance 11+13
PSO1 P
algorithms.
Compare and contrast PO1, PO2, PO3, PO5, A
CO3 various memory PO10, PO12, 10+6
P
management schemes. PSO1,PSO2,
Explain the functionality of A
CO4 PO1, PO2, PO3, PO5,
file systems I/O systems, 10+6
PO10, PO12, PSO1 P
and Virtualization
Compare iOS and Android PO1, PO2, PO3, PO5, A
CO5 7
Operating Systems. PO10, PO12 P

Total Hours of instruction 75

2
 Strength to which POs and PSO are addressed by COs

No. of sessions Course Level

devoted Program and POx strength
(Maximum 75 % ofclassroom
Program Specific (3-strong, 2-
sessions) sessions are devoted
Outcome moderate, 1-
weak)*
75 100 PO1 3
75 100 PO2 3
75 100 PO3 3
75 100 PO5 3
51 68 PO10 2
51 68 PO12 2
68 91 PSO1 2

*Above 70% - Strong (3); 51% to 70% - Moderate (2); 5% to 50% - Weak (1); LT
5% - NIL (0)

Course – PO/PSO Mapping

Course 1 2 3 5 10 12 PSO
1
AD3391 3 3 3 3 2 2 2

Competencies

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

Competency CO CL Sessions
(approx.
)
C1 Evolution of Operating System; Operating System
CO1 AP 2
Structures
C2 Operating System Services - User Operating
CO1 AP 3
System Interface
C3 Design and Implementation - Structuring
CO1 AP 2
methods.
C4 Process Scheduling - Operations on Processes -
CO2 AP 3
Inter-process Communication
C5 Process Scheduling - Operations on Processes -
CO2 AP 3
Inter-process Communication
Threads - Multithread Models – Threading issues
C6 Deadlock - Methods for handling deadlocks,
CO2 AP 3
Deadlock prevention, Deadlock avoidance,
Deadlock detection, Recovery from deadlock
C7 Contiguous Memory Allocation – Paging -
CO3 AP 3
Structure of the Page Table
C8 To Segmentation with paging; Virtual Memory -
CO3 AP 3
Demand Paging – Copy on Write
File concept - Access methods - Directory
C9
Structure - Directory organization - File system CO4 AP 3
mounting - File Sharing and Protection
To File Sharing and Protection; File System
C10 CO4 AP 3
Implementation - File System Structure
To Allocation Methods - Free Space Management;
C11 CO4 AP 3
I/O Systems
C12 To History, Benefits and Features, Building Blocks CO5 AP 3
C13 To Types of Virtual Machines and their CO5 AP 3
3
 Implementations, Virtualization and Operating-
System Components
C14 To Mobile OS - iOS and Android. CO5 AP 3

CO Course Outcomes Target

(Class Average
Marks)
CO1 Analyze various scheduling algorithms and process 65
synchronization.
CO2 Explain deadlock, prevention and avoidance algorithms. 65
CO3 Compare and contrast various memory management 65
schemes.
CO4 Explain the functionality of file systems I/O systems, and 65
Virtualization
CO5 Compare iOS and Android Operating Systems. 65

Assessment Pattern

Assessment Instrument Percentage Weightage

Continuous Internal Assessment 40%

Semester End examination 60%

Continuous Internal Assessment (50 marks)

AssessmentPattern Marks Weightag

e
CIA 1
CIA test-1(CIA + Assignment / Technical Seminar) 50(25%)
CIA test-2(CIA + Assignment / Technical Seminar) 50(25%) 50
40% Marks
CIA 2
Model examination 25(25%)
individual Lab experiment evaluation 75(25%)

LECTURE PLAN
TEXT BOOKS
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System
Concepts”, 9th Edition, John Wiley and Sons Inc., 2018.
2. Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 4th Edition, New
Delhi, 2016.

REFERENCES
1.Ramaz Elmasri, A. Gil Carrick, David Levine, “Operating Systems – A Spiral
Approach”, Tata McGraw Hill Edition, 2010.
2.William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition,
Prentice Hall, 2018.
3. Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education,
2016.

4
 Tex Cont
t Page act
Modules Content CO.X RBT
Boo s hour
k s
INTRODUCTI Computer System - Elements
T1 01-25 3 CO1 AP
ON and organization
Objectives and Functions -
Evolution of Operating System,
Operating
Operating System Services -
System
User Operating System -
Overview,
System Calls – System T1 27-85 4 CO1 AP
Operating
Programs - Design and
System
Implementation - Structuring
Structures
methods.

Processes - Process Concept -

Process Scheduling -
PROCESS Operations on Processes -
95-
MANAGEMEN Inter-process Communication; T1 4 CO2 AP
117
T CPU Scheduling - Scheduling
criteria - Scheduling
algorithms:
Multithread Models – Threading
issues; Process Synchronization
- The critical-section problem -
Synchronization hardware – 129-
T1 4 CO2 AP
Threads Semaphores – Mutex - Classical 145
problems of synchronization -
Monitors;

Methods for handling

Deadlock prevention,
Deadlock avoidance, Deadlock 243-
Deadlock T1 3 CO2 AP
detection, Recovery from 264
deadlock.

MEMORY Main Memory - Swapping -

273-
MANAGEMEN Contiguous Memory Allocation T1 5 CO3 AP
309
T
Structure of the Page Table -
Segmentation, Segmentation
Paging, with paging, Demand Paging –
317-
Virtual Copy on Write - Page T1 5 CO3 AP
353
Memory Replacement - Allocation of
Frames –Thrashing.

STORAGE Mass Storage system – Disk

MANAGEMEN Structure - Disk Scheduling and T1 491 4 CO4 AP
T Management
File concept - Access methods -
Directory Structure - Directory
File-System organization - File system 371-
T1 3 CO4 AP
Interface mounting - File Sharing and 395
Protection

5
 File System Structure -
Directory implementation -
Allocation Methods - Free
File System
Space Management; I/O 411-
Implementati T1 3 CO4 AP
Systems – I/O Hardware, 441
on
Application I/O interface, Kernel
I/O subsystem.

Virtual Machines – History,

Benefits and Features, Building
VIRTUAL Blocks, Types of Virtual
MACHINES Machines and their
T2 4 C05 AP
AND MOBILE Implementations, Virtualization
OS and Operating-System
Components

Mobile OS iOS and Android. T2 3 CO5 AP

TOTAL LECTURE HOURS: 45

Contac
Exp.N PRACTICALEXERCISES* t CO.X RB
o hours T
1 Installation of Operating system : Windows/ Linux 3 CO1 AP
Illustrate UNIX commands and Shell Programming

2 Process Management using System Calls : Fork, Exec, Getpid, 2 CO1 AP

Exit, Wait, Close

Write C programs to implement the various CPU Scheduling

3 Algorithms 2 CO2 AP

Illustrate the inter process communication strategy

4 2 CO2 AP
5 Implement mutual exclusion by Semaphores 2 CO2 AP

6 Write a C program to avoid Deadlock using Banker's Algorithm 2 CO2 AP

7 Write a C program to Implement Deadlock Detection Algorithm 3 CO2 AP

8 Write C program to implement Threading 2 CO2 AP

9 Implement the paging Technique using C program 2 CO3 AP

10 Write C programs to implement the following Memory Allocation 2 CO3 AP

Methods
A)First Fit b.Worst Fit c. Best Fit

11 Write C programs to implement the various Page Replacement 2 CO3 AP

Algorithms

6
12 Write C programs to Implement the various File Organization 2 CO4 AP
Techniques

13 Implement the following File Allocation Strategies using C 2 CO4 AP

programs
Sequential b. Indexed c. Linked

14 Write C programs for the implementation of various disk 2 CO4 AP

scheduling algorithms

TOTALHOURS 30

COURSE CO-ORDINATOR HoD IQAC coordinator

PRINCIPAL