OPERATING SYSTEMS

Paper Code: 
CCAI 201
Credits: 
03
Periods/week: 
03
Max. Marks: 
100.00
Objective: 

This course aims to make students acquainted with the basic concepts of operating systems and its functionalities.

 

Learning Outcome

Learning and Teaching Strategies

Assessment Strategies-

 

The Students will:

CO11. Categorize the key functions of an operating system.

CO12. Review the different scheduling algorithms for a given scenario.

CO13. Analyse different memory management techniques..

CO14. Categorize the conditions that cause deadlocks and assess deadlock prevention strategies.

CO15. Assess the techniques for file organization, access and allocation.

Approach in teaching:

Interactive Lectures, Discussion, Tutorials, Reading assignments, Demonstration,

 

Learning activities for the students: Self-learning              assignments, Effective questions, Simulation, Seminar presentation, Giving tasks.

Class   test, Semester end        examinations,

Quiz, Solving problems in tutorials, Assignments, Presentation

 

 

9.00
Unit I: 

Introduction to an Operating System,Types Operating System Operating System-Simple Batch Systems, Multi programmed Batched Systems, Time- Sharing Systems, Personal-Computer Systems, Parallel Systems, Distributed Systems, and Real- Time Systems.

 

9.00
Unit II: 

Process Management-Process Model, creation, termination, states and transitions, context switching, process implementation, process control block. Process Scheduling: basic concepts, classification, CPU and I/O Bound, CPU Scheduler-Short, medium and long term, Scheduling Criteria, Operation on Processes. Scheduling-preemptive and non-preemptive. CPU Scheduling Algorithms (FCFS, SJF, Priority, Round-Robin, Multilevel Queue, Multilevel Feedback Queue).

 

9.00
Unit III: 

Deadlocks: System Model, Deadlock Characterization. Deadlocks: Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock.

 

9.00
Unit IV: 

Memory Management: concepts, functions, logical versus physical address space, address binding, degree of multiprogramming, swapping, static & dynamic loading, static & dynamic linking, memory allocation schemes-first fit, next fit, best fit, worst fit. Contiguous allocation & Non-contiguous Allocation-fragmentation.

 

9.00
Unit V: 

Virtual Memory: concept, virtual address space, Demand Paging, Page Replacement, Page-Replacement Algorithms- FIFO, Optimal Page, LRU. File Management: File Concepts, Operations & Attributes, Access Methods-Sequential, Direct, Index Sequential methods, Directory System, -path name, directory operations, Directory structures-single level, Two Level, Tree Structured, Graph Structure Directory-Acyclic Graph Directories & General Graph Directories.

 

 

ESSENTIAL READINGS: 
  • Silbersachatz & P. Galvin, “Operating System Concepts”, Addison-Wesley, 10th Edition, 2018

 

REFERENCES: 

Suggested Reference Books

  • A. Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2011
  • E. Madnick , J. Donovan, “Operating Systems”, Tata McGraw Hill, 13th Edition, 2016.

E-Resources including links

 

 

Academic Year: 
2023-24
  • Printer-friendly version