CS25C11 Operating Systems – Semester III – CSE / AI&DS / CSE(DS) / CSE(IoT) / CSE(Cyber) / CSE(AI&ML) / CSD – R-2025

Subject Code & Name: CS25C11 – Operating Systems

Regulation: R-2025

Semester: III (Third Semester)

Branch: B.E. Computer Science and Engineering (CSE) / B.Tech. Artificial Intelligence and Data Science (AI&DS) / B.E. Computer Science and Engineering (Data Science) (CSE(DS)) / B.E. Computer Science and Engineering (Internet of Things) (CSE(IoT)) / B.E. Computer Science and Engineering (Cyber Security) (CSE(Cyber)) / B.E. Computer Science and Engineering (Artificial Intelligence and Machine Learning) (CSE(AI&ML)) / B.E. Computer Science and Design (CSD)

Credits / L-T-P: 4 Credits | L-T-P: 3-0-2

Course Objectives

• This course presents core principles of modern operating systems and analyses components such as process management, CPU scheduling, synchronization, memory, file systems, and I/O.

Full Unit-wise Syllabus

Unit I – Basics Of Operating Systems

History and Evolution of Operating Systems – Types of Operating Systems – Operating Systems structures – Functions of Operating Systems – challenges of Operating Systems – Unix & Linux Operating Systems.

Practical: Installation of a Linux OS; Linux commands and shell scripting

Unit II – System Calls and Process Management

System Calls – Process Concepts and Lifecycle, Process Control Block (PCB) – Context Switching – Threading Models, Process vs Thread – Process Creation and Termination – Case study.

Practical: Process Creation using fork(), exec(), wait(); Multi-threading using POSIX threads

Unit III – CPU Scheduling

Scheduling Criteria and Objectives – Scheduling Algorithms – Preemptive and non-preemptive scheduling.

Practical: Implementation and generation of Gantt chart: FCFS and SJF; Round Robin, Priority and Multilevel Queue

Unit IV – Synchronization and Deadlocks

Concurrency Issues and Critical Section Problem – Synchronization Tools: Mutex, Semaphores – Deadlock: Necessary Conditions, Prevention, Avoidance, Detection, and Recovery.

Practical: Producer-Consumer and Readers-Writers problem; Dead Lock

Unit V – Memory Management

Memory Allocation: Contiguous, Paging, Segmentation – Virtual Memory, Demand Paging, Page Replacement Algorithms (FIFO, LRU, Optimal).

Practical: Page replacement algorithms; Dynamic memory allocation and deallocation

Unit VI – File Systems and I/O Management

File System Concepts – Directory and File Access Control – I/O Management – Disk Scheduling Buffering, Caching – Case study.

Practical: File operations and file buffering; Disk scheduling algorithms

Course Outcomes (COs)

• CO1: Describe the operating systems concepts in managing computer hardware and software resources.
• CO2: Analyze operating system components and file systems.
• CO3: Evaluate operating system algorithms in different computing environments.
• CO4: Design operating system solutions for managing system resources in real-world scenarios.
• CO5: Develop the ability to adapt to emerging trends, tools, and technologies.

Assessment Pattern (Quick Note)

• Weightage: Continuous Assessment 50% | End Semester Examinations 50%
• Internal methodology: Activities 10% (Assignments 30, Quiz 10, Project based learning 25, Flipped Classroom 10, Review of GATE questions 25), Internal Theory Examinations 30%, Internal Laboratory Examination 10%

Source: Official Anna University – B.E. Computer Science and Engineering R-2025 Syllabus
Last Updated: September 2026