CY-404 – Operating Systems

Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal
New Scheme Based On AICTE Flexible Curricula
CSE-Cyber Security | IV-Semester

Syllabus Content & Previous Year Questions

UNIT 1


Introduction to Operating Systems: Function, Evolution, Desirable Characteristics and features of an O/S, Operating Systems Services: Types of Services, Different ways of providing these Services – Utility Programs, System Calls.



Previous Years questions appears in RGPV exam.

Q.1) Discuss the evolution of Operating Systems and their impact on computing. (June-2025)


Q.2) Explain the services provided by an Operating System to users and applications.. (June-2025)


Q.3) How does the OS ensure security and protection? Explain with mechanisms used. (June-2025)


Q.4) Discuss in detail the services of an operating system. (Dec-2024)


Q.5) Explain some utility programs supported in the operating system. (Dec-2024)


Q.6) With a neat sketch explain the structure of an operating system. (Dec-2024)


Q.7) Discuss in detail the characteristics and features of the Operating system. (June-2024)


Q.8) Explain different types of Linux System Calls. (June-2024)


Q.9) List and explain the various features of operating system. (Nov-2023)


Q.10) Describe the evolution of operating system in detail. (Nov-2023)


Q.11) Discuss the various services provided by operating system. (Nov-2023)


Q.12) Discuss the functions of operating system. (June-2023)


Q.13) List and explain the types of system calls. (June-2023)


Q.14) Discuss the characteristics of operating system. (June-2023)


Q.15) Write short notes on any two of the following:
a) Utility programs (June-2023)



UNIT 2


Process Management: Concept of a process, Process State Diagram, Process based kernel, Dual mode of process execution, CPU scheduling algorithms, deterministic modeling, and System calls for Process Management, Concept of Threads: User level & Kernel level Threads. Process Management in UNIX & Windows
Inter Process Communication: Real and Virtual Concurrency, Mutual Exclusion, Synchronization, Critical Section Problem, Solution to Critical Section Problem : Semaphores and their Operations and their implementation.Deadlocks: Deadlock Problems, Characterization, Prevention, Avoidance, Recovery. IPC in UNIX & Windows



Previous Years questions appears in RGPV exam.

Q.1) What is a Thread? Compare user-level and kernel-level threads with advantages and disadvantages. (June-2025)


Q.2) Define a Deadlock. Explain the necessary conditions and methods of deadlock prevention. (June-2025)


Q.3) Describe in detail the SJF and Priority CPU scheduling algorithms with examples. (June-2025)


Q.4) Write short notes on any two
a) System calls for process management (June-2025)


Q.5) Describe the concept of a process-based kernel and its advantages. (Dec-2024)


Q.6) Discuss in detail the differences between user level and kernel level threads. (Dec-2024)


Q.7) Explain briefly the working of any two deadlock prevention techniques. (Dec-2024)


Q.8) Write short notes on any two of the following:
a) System calls for Process Management (Dec-2024)


Q.9) Explain the dual mode of process execution and why it's necessary. (June-2024)


Q.10) Consider 3 processes $P_{1}$ $P_{2}$ $P_{3}$ which require 7, 3 and 6 time units with arrival times 0, 1, 2. Draw the Gant chart and calculate the average waiting time and completion time for each process using the Shortest Job First algorithm. (June-2024)


Q.11) How does semaphores help to solve the critical section problem. Explain their operations. (June-2024)


Q.12) Write short notes on any two of the following.
a) Real and Virtual Concurrency (June-2024)


Q.13) Write and explain the Banker's algorithm for dead lock avoidance. (Nov-2023)


Q.14) Consider the following set of process, with the length of the CPU burst given in milliseconds.

Process Burst Time Priority
$P_{1}$ 10 3
$P_{2}$ 1 1
$P_{3}$ 2 3
$P_{4}$ 1 4
$P_{5}$ 5 2

The processes are assumed to have arrived in the order $P_{1},$ $P_{2},$ $P_{3}$, $P_{4},$ $P_{5}$ all at time 0. Calculate the turnaround time of each process by applying priority scheduling algorithm. (Nov-2023)


Q.15) Explain the Peterson solution for critical section problem. (Nov-2023)


Q.16) Discuss in brief any of the following:
a) User level and kernel level threads (Nov-2023)


Q.17) Write and explain the process states with a neat sketch. (June-2023)


Q.18) Define semaphore. How does the semaphore work. Illustrate with an example. (June-2023)


Q.19) List the conditions that must be present for deadlock to occur and for each condition give brief example or reason that illustrate the disadvantage in preventing the condition. (June-2023)


Q.20) Write short notes on any two of the following:
b) Virtual concurrency (June-2023)



UNIT 3


Memory Management: Different Memory Management Techniques – Partitioning, Swapping, Segmentation, Paging, Paged Segmentation, Comparison of these techniques, Techniques for supporting the execution of large programs: Overlay, Dynamic Linking and Loading, Virtual Memory – Concept, Implementation by Demand Paging etc. Memory management in UNIX & Windows



Previous Years questions appears in RGPV exam.

Q.1) Describe page replacement algorithms: FIFO and LRU with examples. (June-2025)


Q.2) Discuss memory management in UNIX and Windows operating systems. (June-2025)


Q.3) What is the concept of Overlay? How it is useful in executing large programs? (June-2025)


Q.4) Write short notes on any two
b) Segmentation (June-2025)


Q.5) Consider the following reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1, find the number of page faults that occur using 3 frames for FIFO and LRU algorithms. (Dec-2024)


Q.6) Define Virtual memory. Explain in detail the advantages of using virtual memory technique. (Dec-2024)


Q.7) Write short notes on any two of the following:
b) Dynamic linking and loading (Dec-2024)


Q.8) Consider the following reference string 1, 2, 3, 4, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6, find the number of page faults that occur using 4 frames for FIFO and LRU algorithms. (June-2024)


Q.9) Explain in detail about segmentation with an example. (June-2024)


Q.10) Write short notes on any two of the following.
b) Dynamic linking and loading (June-2024)


Q.11) Discuss the advantage of segmentation over paging. (Nov-2023)


Q.12) Explain in brief the need of demand paging. (Nov-2023)


Q.13) Define Belady's anomaly. Why does Belady's anomaly happen explain with an example? (Nov-2023)


Q.14) Discuss in brief any of the following:
b) Virtual memory (Nov-2023)


Q.15) Differentiate between internal and external fragmentation. (June-2023)


Q.16) Explain the procedure that ensure protection using paging. (June-2023)


Q.17) Write short notes on memory management in UNIX. (June-2023)


Q.18) Write short notes on any two of the following:
c) Paged segmentation (June-2023)



UNIT 4


File Systems Management: File Concept, User’s and System Programmer’s view of File System, Disk Organization, Tape Organization, Different Modules of a File System, Disk Space Allocation Methods – Contiguous, Linked, Indexed. Directory Structures, File Protection, System Calls for File Management, Disk Scheduling Algorithms. File Systems in UNIX & Windows.



Previous Years questions appears in RGPV exam.

Q.1) Describe the file system structure. Explain the roles of different file system modules. (June-2025)


Q.2) Write detailed notes on disk scheduling algorithms: SSTE. SCAN and C-SCAN. (June-2025)


Q.3) Compare the file systems in UNIX and Windows in terms of structure and performance. (June-2025)


Q.4) Write short notes on any two
c) System Calls for File Management (June-2025)


Q.5) Discuss in detail contiguous and linked file allocation methods. (Dec-2024)


Q.6) Discuss in the disk performance parameters with examples. (Dec-2024)


Q.7) Explain FCFS and SSTF disk scheduling algorithms with examples. (Dec-2024)


Q.8) Write short notes on any two of the following:
c) File system in Unix (Dec-2024)


Q.9) Discuss in detail the advantages and disadvantages of contiguous allocation over disk space allocation strategy. (June-2024)


Q.10) List and explain the various File protection methods. (June-2024)


Q.11) Explain the following commands: Iseek, stat and ioctl with examples. (June-2024)


Q.12) Write short notes on any two of the following.
c) File system in Windows (June-2024)


Q.13) Suppose the head of a moving head disk with 200 tracks, numbered 0 to 199, is currently serving a request at track 143 and has just finished a request at track 125. If the queue of requests is kept in FIFO order: 86, 147, 91, 177, 94, 150, 102, 175, and 130. What is the total head movement to satisfy these requests for the FCFS disk scheduling algorithms? (Nov-2023)


Q.14) Explain the following with relevant diagrams:
a) Two level directory structure
b) Acyclic-graph directory structure (Nov-2023)


Q.15) Discuss in brief any of the following:
c) Tape organization (Nov-2023)


Q.16) Suppose that a disk drive has 200 cylinders, numbered 0 to 199. The work queue is: 23, 89, 132, 42, 187. Determine the total distance for the following disk scheduling algorithms:
i) Scan
ii) Look (June-2023)


Q.17) Discuss in brief the following diskspace allocation methods.
a) Linked
b) Indexed (June-2023)


Q.18) Write short notes on any two of the following:
d) File Systems in UNIX (June-2023)



UNIT 5


Input / Output Management : Principles and Programming, Input/Output Problems, Different I/O operations: Program Controlled, Interrupt Driven, Concurrent I/O, Asynchronous Operations, Logical structure of I/O function, I/O Buffering,Kernel I/o Subsystem.Introduction to Network, Distributed and Multiprocessor Operating Systems. I/O management in UNIX & Windows



Previous Years questions appears in RGPV exam.

Q.1) Discuss the structure and functions of the Kernel $1/O$ subsystem. (June-2025)


Q.2) What is Asynchronous I/O? How does it differ from synchronous I/O? (June-2025)


Q.3) Write short notes on any two
d) I/O management in UNIX and Windows (June-2025)


Q.4) Differentiate between distributed and multiprocessor operating systems. (Dec-2024)


Q.5) Describe the logical structure of I/O function with an example. (Dec-2024)


Q.6) Write short notes on any two of the following:
d) Kernel I/O subsystem (Dec-2024)


Q.7) Explain the key characteristics of a network operating system and how they differ from traditional operating system. (June-2024)


Q.8) Discuss in detail about asynchronous operations in I/O management. (June-2024)


Q.9) Write short notes on any two of the following.
d) Interrupt driven (June-2024)


Q.10) Discuss in brief the logical structure of I/O function. (Nov-2023)


Q.11) Explain the interrupt driven I/O techniques. (Nov-2023)


Q.12) Discuss in brief any of the following:
d) I/O Buffering (Nov-2023)


Q.13) Explain in detail about asynchronous operations in I/O management. (June-2023)


Q.14) List out the differences between distributed and multiprocessor operating systems. (June-2023)