Operating Systems

Paper Code:

25CBCA201

Credits:

Periods/week:

Max. Marks:

100.00

Objective:

Course Objectives:

The course will enable the students to

1. Grasp the basic concepts of operating systems.

2. Describe & discuss various operating system workings like process management, memorymanagement, concepts of concurrency control and disk management.

Course Outcomes:

Course

Learning Outcome (at course level)

Learning and

teaching

strategies

Assessment

Strategies

Course

Code

Course

Title

25CBCA

201

Operating Systems (Theory)

CO55. Categorize the key functionsof an operating systemand assess the evolution of operating systems fromprimitive batch systems to sophisticated multi-usersystems.

CO56. Examine the concept of process states and review different scheduling algorithms for a given scenario.

CO57. Assess the significance of process synchronization and evaluate deadlocks formation and handling deadlock Mechanism.

CO58. Analyse different memory management techniques and compare virtual memory and main memory.

CO59. Assess the principal techniques for file organization, access and allocation.

CO60. Contribute effectively in course- specific interaction.

Approach in teaching:

Interactive Lectures, Discussion, Reading assignments, Demonstration,

Learning activities for the students: Self- learning learning assignments, Presentations,Group Discussions.

Class test, Semesterend examinations, Quiz, Assignments, Presentation

9.00

Unit I:

Operating System: concepts, Simple Batch Systems, Multi programmed Batched Systems, Time- Sharing Systems, Personal-Computer Systems, Parallel Systems, Distributed Systems, and Real- Time Systems. Operating-System Structures: System Components, Operating System Services, System Calls, System Structure, Virtual Machines.

9.00

Unit II:

Process Management: Process Concept, Process Scheduling, Operation on Processes. CPU Scheduling: Basic Concepts, Scheduling Criteria. CPU Scheduling Algorithms (FCFS, SJF, Priority, Round-Robin, Multilevel Queue, Multilevel aFeedback Queue)

9.00

Unit III:

Multiple-Processor Scheduling. Process Synchronization: Background, The Critical- Section Problem, Introduction to Semaphores. 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: Background, Logical versus Physical Address space, Swapping, Contiguous allocation (fragmentation), Paging, Segmentation. Virtual Memory: Background, Demand Paging, Page Replacement, Page-replacement Algorithms (FIFO, Optimal, LRU, Counting).

9.00

Unit V:

File Management: File Concepts (Operations & Attributes), Access Methods, Directory Structure, File System Structure, Allocation Methods (Contiguous Allocation, Linked Allocation, Indexed Allocation).

ESSENTIAL READINGS:

ESSENTIAL READINGS

1. Avi Silberschatz, Greg Gagne, and Peter Baer Galvin, “Operating System Concepts”, Addison-Wiley, 6th Edition, 2014

2. Rohit Khurana,” Operating System”, Vikas Publication House Pvt. Ltd., 2013.

REFERENCES:

SUGGESTED READINGS

1. A. Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000

2. Madnick E., Donovan J., “Operating Systems”, Tata McGraw Hill, 2001.

3. Richard Fox,” Linux with Operating System Concepts”, CRC Press, 2021

e -RESOURCES:

1. Website: www.linux.org.

2. https://www.geeksforgeeks.org/last-minute-notes-operating-systems/