Scribd
Upload
4 views

operating system syllabus

Uploaded by

preethadavid11
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

operating system syllabus

Uploaded by

preethadavid11
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

TEXTBOOKS:

1. David Cielen, Arno D. B. Meysman, and Mohamed Ali, “Introducing Data Science”, Manning
Publications, 2016. (first two chapters for Unit I).
2. Robert S. Witte and John S. Witte, “Statistics”, Eleventh Edition, Wiley Publications, 2017.
3. Jake VanderPlas, “Python Data Science Handbook”, O’Reilly, 2016.

REFERENCES:
1. Allen B. Downey, “Think Stats: Exploratory Data Analysis in Python”, Green Tea Press, 2014.

COURSE OUTCOMES:
On successful completion of this course, the student should be able to:
1. Explain end-to-end data analytics pipeline
2. Use appropriate tools to describe and visualize data
3. Perform various statistical analysis to make statistical inferences
4. Build, validate and communicate data analytical models for complex engineering problems

COs POs PSOs


1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2 1
CO2 3 2 2 3
CO3 3 2 2 3 3 3
CO4 3 3 3 1 1 3 3 3 3

COURSE CODE COURSE TITLE L T P


C
UIT2503 PRINCIPLES OF OPERATING SYSTEMS 3 0 0 3
OBJECTIVES:
The objective of this course is to enable the students to
● Understand the basic concepts and functions of operating systems.
● Learn about processes, threads, and scheduling algorithms.
● Understand the principles of concurrency and deadlocks.
● Learn various memory management schemes.
● Understand I/O systems basics and various file systems.

UNIT I INTRODUCTION TO OPERATING SYSTEMS 9


Introduction: Defining Operating Systems - Operating System objectives and functions - The evolution of
Operating Systems - Operating System operations, Operating System structures: Operating System Services
- System calls - System programs - Operating System structure - Developments leading to modern Operating
Systems - Virtual machines- OS design considerations for multiprocessor and multicore - Operating System
generation - System boot.

UNIT II PROCESSES AND THREADS 9


Processes: Process concept - Process scheduling - Operations on processes – Inter-process communication,
Threads: Multi core programming - Multithreading models - Threading issues, CPU Scheduling: Basic
concepts - Scheduling criteria - Scheduling algorithms - Thread scheduling.

UNIT III CONCURRENCY 9


Process Synchronization: Background - The Critical Section problem - Peterson’s solution -
Synchronization hardware - Mutex Locks - Semaphores - Classic problems of synchronization, Deadlocks:
System model - Deadlock characterization - Methods for handling deadlocks: Deadlock prevention,
Deadlock avoidance, Deadlock detection, Recovery from deadlock.
UNIT IV MEMORY MANAGEMENT 9
Main Memory: Background – Swapping - Contiguous Memory Allocation – Segmentation – Paging -
Structure of the Page Table – Virtual Memory: Background - Demand Paging - Copy-on-Write - Page
Replacement - Allocation of Frames – Thrashing.

UNIT V STORAGE MANAGEMENT 9


Mass-Storage Structure: Disk Structure - Disk Scheduling - Disk Management - Swap-Space Management
- I/O Systems Basics - File-System Interface: File concept - Access methods - Directory and Disk Structure
- File-System Implementation: File-System Structure - File-System implementation - Directory
implementation - Allocation methods - Free-Space management - Case studies: FAT, NTFS File Systems.

THEORY: 45 HOURS
TEXTBOOK:
1. Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne, “Operating System Concepts”, Tenth
Edition, John Wiley and Sons Inc., 2018.

REFERENCES:
1. William Stallings, “Operating Systems – Internals and Design Principles”, Ninth Edition, Pearson,
2018.
2. Andrew S. Tanenbaum, Albert S. Woodhull, “Operating Systems Design and Implementation”,
Third Edition, Prentice Hall, 2006.
3. Brian L. Stuart, “Principles of Operating Systems: Design & Applications”, First Edition, Thomson
Learning, 2009.
4. Gary Nutt, “Operating Systems”, Third Edition, Pearson Education, 2004.
5. Harvey M. Deitel, Paul J. Deitel, and David R. Choffnes, “Operating Systems”, Third Edition,
Pearson Education, 2004.
6. Achyut S. Godbole, Atul Kahate, “Operating Systems”, Third Edition, McGraw Hill Education,
2017.

COURSE OUTCOMES:
On successful completion of this course, the students will be able to
1. Explain operating system services and operations.
2. Implement various scheduling algorithms.
3. Apply the principles of concurrency.
4. Compare and contrast various memory management schemes.
5. Analyze the various disk scheduling algorithms
6. Design and implement prototype file systems.

COs POs PSOs


1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1
CO2 3 2 1 1 1
CO3 3 2 1 1 1
CO4 3 2 1 1 1
CO5 3 2 1 1 1
CO6 3 2 1 1 1

You might also like