OPERATING SYSTEMS

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

The course will enable the students to

  1. This module aims at making students learn about basic concepts of operating systems.
  2. Describe & discuss various operating system workings like process management, memory management, concepts of concurrency control and disk management.

Course Outcomes (COs):

 

Learning Outcome (at course level)

Learning and teaching strategies

Assessment Strategies

The students will:

CO 47.Categorize the key functions of an operating system and assess the evolution of operating systems from primitive batch systems to sophisticated multi-user systems.

CO 48.Examine the concept of process states and review different schdeuling algorithms for a given scenario.

CO 49.Analyze different memory management techniques and compare virtual memory and main memory

CO 50.Categorize the conditions that cause deadloacks and assess deadlock prevention strategies related to each condition of deadlock

CO 51.Assess the principal 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: 

What is an Operating System, Simple Batch Systems, Multiprogrammed Batched Systems, Time-Sharing Systems, Personal-Computer Systems, Parallel Systems, Distributed Systems, and Real-Time Systems.

9.00
Unit II: 

Operating-System Structures: System Components, Operating System Services, System Calls, System Structure, Virtual Machines.
Process Management: Process Concept, Process Scheduling, Operation on Processes.

CPU Scheduling: Basic Concepts, Scheduling Criteria.

 

9.00
Unit III: 

CPU Scheduling Algorithms (FCFS, SJF, Priority, Round-Robin, Multilevel Queue, Multilevel Feedback Queue) Multiple-Processor Scheduling. Process Synchronization: Background, The Critical-Section Problem, Introduction to Semaphores. Deadlocks: System Model, Deadlock Characterization.

 

9.00
Unit IV: 

Deadlocks: Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock. Memory Management: Background, Logical versus Physical Address space, Swapping, Contiguous allocation (fragmentation), Paging, Segmentation.

 

9.00
Unit V: 

Virtual Memory: Background, Demand Paging, Page Replacement, Page-replacement Algorithms (FIFO, Optimal, LRU, Counting). File Management: File Concepts (Operations & Attributes), Access Methods, Directory Structure, File System Structure, Allocation Methods (Contiguous Allocation, Linked Allocation, Indexed Allocation).

 

ESSENTIAL READINGS: 

1. A. Silbersachatz and P.Galvin, “Operating System Concepts”, Addison-Wesley, 5th Ed., 2001.

 

REFERENCES: 
  1. Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000.
  2. Madnick E., Donovan J., “Operating Systems”, Tata McGraw Hill, 2001.
  3. Achyut S. Godbole, “Operating Systems”, Tata Mc-Graw Hill Publishing Company Limited 2000.
  4. Gary Nutt, “Operating System a Modern Perspective (Second Edition)”, Pearson Education 2000.

 

Academic Year: 
2021-22
  • Printer-friendly version