OPERATING SYSTEMS

Paper Code:

24CCAI201

Credits:

Periods/week:

Max. Marks:

100.00

Objective:

Course Objectives:

The course will enable the students to acquaint with the basic concepts of operating systems and its functionalities.

Course Outcomes:

Course

Learning outcome

(at course level)

Learning and teaching strategies

Assessment Strategies

Course Code

Course

title

24 CCAI 201

OPERATING SYSTEMS (Theory)

CO13. Evaluate different types of operating system on the basis of their key functions.

CO14. Analyse process management and CPU scheduling techniques.

CO15. Assess the conditions that cause deadlocks and deadlock prevention strategies.

CO16. Examine different memory management techniques.

CO17. Evaluate virtual memory and file management strategies for diverse problems.

CO18.Contribute effectively in course-specific interaction

Approach in teaching:

Interactive Lectures, Discussion, PowerPoint Presentations, Informative videos

Learning activities for the students:

Self-learning assignments, Effective questions, presentations.

Assessment tasks will include Class Test on the topics, Semester end examinations, Quiz, Student presentations and assignments.

12.00

Unit I:

Operating System:

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.

12.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-pre-emptive and non-pre-emptive. CPU Scheduling Algorithms (FCFS, SJF, Priority, Round-Robin, Multilevel Queue, Multilevel Feedback Queue).

12.00

Unit III:

Deadlocks:

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

12.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.

12.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:

Suggested Text Books: