[go: up one dir, main page]

0% found this document useful (0 votes)
29 views3 pages

AIML Lab

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
29 views3 pages

AIML Lab

Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MCE/ECE/2024-25/II/CP-L/EC3251

COURSE PLAN

Department ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Course Code/ Name AL3452/OPERATING SYSTEMS

Academic Year/ Semester 2024-2025 / IV

Class/ Section II Year B.E. – AIDS / ‘A’ Section

Faculty Name/ Dept. R.Madhumitha, Professor/ Dept. of CSE (AIML)

COURSE OBJECTIVES:

• To understand the basics and functions of operating systems.


• To understand Processes and Threads
• To analyze Scheduling algorithms and process synchronization.
• To understand the concept of Deadlocks.
• To analyze various memory management schemes.
• To be familiar with I/O management and File systems.
• To be familiar with the basics of virtual machines and Mobile OS like iOS and Android.

Week Proposed
Experiment to be covered Actual Date
No. Date

1 Installation of Operating system : Windows/ Linux

Illustrate UNIX commands and Shell Programming


2

Process Management using System Calls : Fork, Exec, Getpid, Exit,


3 Wait, Close

Write C programs to implement the various CPU Scheduling


4 Algorithms

5 Illustrate the inter process communication strategy

Implement mutual exclusion by Semaphores


6
MCE/ECE/2024-25/II/CP-L/EC3251

Write a C program to avoid Deadlock using Banker's Algorithm


7

8 Write a C program to Implement Deadlock Detection Algorithm

Write C program to implement Threading


9

Implement the paging Technique using C program


10

COURSE OUTCOMES
On successful completion of this course, the student will be able to BT Level

Analyze various scheduling algorithms and process synchronization.


CO1 K3

Explain deadlock, prevention and avoidance algorithms.


CO2 K5

CO3 Compare and contrast various memory management schemes. K4

Explain the functionality of file systems I/O systems, and Virtualization


CO4 K4

CO5 Compare iOS and Android Operating Systems. K5

Blooms Taxonomy (BT) Levels: K1 – Remember, K2-Understand, K3-Apply, K4-Analyze, K5-Evaluate, K6- Create
TEXT BOOKS

T1 Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th
Edition, John Wiley and Sons Inc., 2018.

Andrew S Tanenbaum, "Modern Operating Systems", Pearson, 4th Edition, New Delhi, 2016.
T2

REFERENCES

R1 Ramaz Elmasri, A. Gil Carrick, David Levine, “Operating Systems – A Spiral Approach”, Tata
McGraw Hill Edition, 2010.

R2 William Stallings, "Operating Systems: Internals and Design Principles", 7th Edition, Prentice Hall,
MCE/ECE/2024-25/II/CP-L/EC3251

2018.

Achyut S.Godbole, Atul Kahate, “Operating Systems”, McGraw Hill Education, 2016.
R3

COs, POs AND PSOs MAPPING


Mappin PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO1 PSO1 PSO2 PSO3
g 2
CO1 2 3 3 2 3 3 - 1 - - - 1 3 3 -
CO2 2 3 3 2 3 3 - 1 - - - 1 3 3 -
CO3 2 3 3 2 3 3 - 1 - - - 1 3 3 -
CO4 2 3 3 2 3 3 - 1 - - - 1 3 3 -
CO5 2 3 3 2 3 3 - 1 - - - 1 3 3 -
Correlation level: 1 – low, 2 – Medium, 3 – High

Signature of the Faculty Head of the Department

You might also like