Scribd
Upload
21 views

23CSI33 Operating Systems Syllabus

The document outlines the course structure for Operating Systems (Course Code: 22CSI33), detailing prerequisites, objectives, teaching methods, and a comprehensive syllabus divided into five modules covering key concepts such as process management, memory management, and file systems. It includes practical experiments and expected course outcomes that emphasize understanding, application, analysis, and demonstration of operating system functionalities. Additionally, it lists textbooks, reference materials, and e-resources for further learning.

Uploaded by

Bhoomika suresh
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
21 views

23CSI33 Operating Systems Syllabus

The document outlines the course structure for Operating Systems (Course Code: 22CSI33), detailing prerequisites, objectives, teaching methods, and a comprehensive syllabus divided into five modules covering key concepts such as process management, memory management, and file systems. It includes practical experiments and expected course outcomes that emphasize understanding, application, analysis, and demonstration of operating system functionalities. Additionally, it lists textbooks, reference materials, and e-resources for further learning.

Uploaded by

Bhoomika suresh
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

OPERATING SYSTEMS

Course Code L:T:P:S Credits Exam Marks Exam Duration Course Type
22CSI33 3:0:2:0 4 CIE:50 SEE:50 3 Hours PCC/BSC
PREREQUISITES:
Good knowledge of C, Computer Organization and Architecture, x86 Assembly level programming.
Course Objectives :
The Student will be able to:
 Understand the structure and functionalities of operating system.
 Gain the Knowledge of using appropriate algorithms for solving the given problem.
 Acquire the knowledge of various techniques used in operating system design and implementation.
 Learn various types of operating system based on different attributes.
 Experiment with operating system to use the different functionalities effectively.

Teaching-Learning Process (General Instructions)


Teachers can use the following strategies to accelerate the attainment of the various course outcomes.
1. Lecturer methods (L) need not to be only traditional lecture method, but alternative effective
teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop design
thinking skills such as the ability to design, evaluate, generalize, and analyze information rather than
simply recall it.
5. Role-play for process scheduling.
6. Demonstrate the installation of any one Linux OS on VMware/Virtual Box

Syllabus
Module I
Introduction to operating systems, System structures: What operating systems do; Computer System
organization; Computer System architecture; Operating System structure; Operating System operations;
Process management; Memory management; Storage management; Protection and Security; Distributed
system; Special-purpose systems; Computing environments.

Operating System Services: User - Operating System interface; System calls; Types of system calls;
System programs; Operating system design and implementation; Operating System structure; Virtual
machines; Operating System generation; System boot.

Textbook 1: Chapter – 1 (1.1-1.12), 2 (2.2-2.11) 8 Hours


Module II

Process Management: Process concept; Process scheduling; Operations on processes; Inter process
communication.
Multi-threaded Programming: Overview; Multithreading models; Thread Libraries; Threading issues.
Process Scheduling: Basic concepts; Scheduling Criteria; Scheduling Algorithms; Thread
scheduling; Multiple-processor scheduling,
Textbook 1: Chapter – 3 (3.1-3.4), 4 (4.1-4.4), 5 (5.1 -5.5) 8
Hours
Module III
Deadlocks: System model; Deadlock characterization; Methods for handling deadlocks; Deadlock
prevention; Deadlock avoidance; Deadlock detection and recovery from deadlock.

Textbook 1: Chapter – 6 (6.1-6.6) 8


Hours
Module IV
Memory Management: Memory management strategies: Background; Swapping; Contiguous memory
allocation; Paging; Structure of page table; Segmentation.

Virtual Memory Management: Background; Demand paging; Copy-on-write; Page replacement;


Allocation of frames; Thrashing.

Textbook 1: Chapter -8 (8.1-8.6), 9 (9.1-9.6) 8 Hours


Module V
File System, Implementation of File System: File system: File concept; Access methods; Directory and
Disk structure; File system mounting; File sharing; Implementing File system: File system structure;
File system implementation; Directory implementation; Allocation methods; Free space management.

Secondary Storage Structure, Protection: Mass storage structures; Disk structure; Disk attachment;
Disk scheduling; Disk management; Protection: Goals of protection, Principles of protection, Domain of
protection, Access matrix.

Textbook 1: Chapter – 10 (10.1-10.5) ,11 (11.1-11.5),12 (12.1-12.5), 14 (14.1-14.4) 8 Hours

PRACTICAL COMPONENT OF IPCC

Sl. Experiments
NO.
1 Simulate the following CPU scheduling algorithms to find turnaround time and waiting time
a) FCFS b) SJF
2 Simulate the following CPU scheduling algorithms to find turnaround time and waiting time
a) Round Robin b) Priority.
3 Develop a C program to simulate producer-consumer problem using semaphores.
4 Develop a C program to simulate Bankers Algorithm for Dead Lock Avoidance.
5 Develop a C program to simulate the following contiguous memory allocation Techniques:

a) Worst fit b) Best fit c) First fit.


6 Develop a C program to simulate FIFO page replacement algorithms
7 Develop a C program to simulate LRU page replacement algorithms
Simulate following File Organization Techniques
8 Simulate a Single level directory File Organization Techniques
9 Develop a C program to simulate the Linked file allocation strategies.
10 Develop a C program to simulate SCAN disk scheduling algorithm.
Course outcomes:
The Student will be able to:
CO 1. Explain the structure and functionalities of operating system.
CO 2. Apply appropriate algorithms for the given problem.
CO 3. Analyze the various techniques used in operating system design and implementation.
CO 4. Compare various types of operating system based on different attributes.
CO 5. Demonstrate the functionalities of operating system using suitable programming language.
Text Books:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne, Operating System Principles 8th edition,
Wiley-India, 2015
Reference Books:
1. Ann McHoes Ida M Fylnn, Understanding Operating System, Cengage Learning, 6th Edition
2. D.M Dhamdhere, Operating Systems: A Concept Based Approach 3rd Ed, McGraw- Hill, 2013.
3. P.C.P. Bhatt, An Introduction to Operating Systems: Concepts and Practice 4th Edition, PHI(EEE),
2014.
4. William Stallings Operating Systems: Internals and Design Principles, 6th Edition, Pearson.

E-Resources:
1. https://youtu.be/mXw9ruZaxzQ
2. https://youtu.be/vBURTt97EkA
3. https://www.tutorialspoint.com/operating_system/index.htm.
4. https://www.studytonight.com/operating-system/.
CO-PO-PSO Mapping

PO’S PO1 PO PO PO PO PO PO PO8 PO PO1 PO11 PO12 PSO1 PSO2 PSO3


2 3 4 5 6 7 9 0
CO1 - - - - - - - - - - - - 3 - -
CO2 3 - - - - - - - - - - - 3 - -
CO3 - 3 - - - - - - - - - - 3 - -
CO4 - - 2 - - - - - - - - - 3 - -
CO5 - - 2 - 2 - - - - - - - 3 - -
CO 3 3 2 2 - - 3 - -

You might also like