CS-405 RGPV B.Tech
Operating Systems (OS)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
5 papers, latest Jun 2026
- CS-405 paper, Jun 2026
- CS-405 paper, Jun 2025
- CS-405 paper, Jun 2024
- CS-405 paper, Nov 2023
- CS-405 paper, Jun 2023
Syllabus, notes and important questions for CS-405
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 Introduction to Operating Systems 7 topics
- Function of an operating system
- Evolution of operating systems
- Different types of operating systems
- Desirable characteristics and features of an operating system
- Operating system services – types of services
- Utility programs as service providers
- System calls as service interfaces
Unit 2 File Systems 10 topics
- Concept of a file and its abstraction
- User’s and system programmer’s view of the file system
- Disk organization and storage hierarchy
- Tape organization
- Modules of a file system
- Disk space allocation methods – contiguous, linked, indexed
- Directory structures
- File protection mechanisms
- System calls for file management
- Disk scheduling algorithms
Unit 3 CPU Scheduling and Memory Management 13 topics
- Process concept and life‑cycle
- Scheduling concepts and criteria
- Types of schedulers (long‑term, short‑term, medium‑term)
- Process state diagram
- CPU scheduling algorithms (FCFS, SJF, Priority, Round‑Robin, Multilevel, etc.)
- Evaluation of scheduling algorithms
- System calls for process management
- Multiple‑processor scheduling techniques
- Thread concepts and models
- Memory management techniques – partitioning, swapping, segmentation, paging, paged segmentation
- Comparison of memory management techniques
- Support for large programs – overlay, dynamic linking and loading
- Virtual memory concepts and demand paging implementation
Unit 4 Input/Output and Concurrent Processes 15 topics
- Principles of input/output systems
- Programming I/O operations
- I/O problems and solutions
- Asynchronous I/O operations
- Speed‑gap and format conversion issues
- I/O interfaces and device controllers
- Program‑controlled I/O
- Interrupt‑driven I/O
- Concurrent I/O techniques
- Real and virtual concurrency
- Mutual exclusion and synchronization mechanisms
- Inter‑process communication methods
- Critical‑section problem and solutions
- Semaphores – binary and counting, WAIT and SIGNAL operations
- Deadlock concepts, characterization, prevention, avoidance, and recovery
Unit 5 Network, Distributed and Multiprocessor Operating Systems 4 topics
- Introduction to network operating systems
- Distributed operating system concepts
- Multiprocessor operating system architectures
- Case studies: Unix/Linux, Windows, and other contemporary operating systems
Exam insights
Counted from 5 past CS-405 papers.
Marks asked per paper, by unit
-
Unit 1 Introduction to Operating Systems 16 marks
-
Unit 2 File Systems 18 marks
-
Unit 3 CPU Scheduling and Memory Management 36 marks
-
Unit 4 Input / Output and Concurrent Processes 27 marks
-
Unit 5 Network, Distributed and Multiprocessor Operating Systems & Case Studies 13 marks
Average marks of the questions from each unit in one paper. You answer only some of them, so the total is more than the paper’s maximum.
Asked again and again
-
Explain what a process is (including difference from program and overview of process management) and explain the process life cycle / process states with the process state transition diagram.
Asked 3 times: 2026, 2025, 2023
-
Explain overlays, dynamic loading and dynamic linking for execution of large programs in memory management.
Asked 3 times: 2026, 2024
-
Explain binary and counting semaphores with examples and their use for process synchronization.
Asked 2 times: 2026, 2024