Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal
New Scheme Based On AICTE Flexible Curricula
CSE-Computer Science Engineering | IV-Semester
Module 1: Introduction to Operating Systems
Function, Evolution, Different Types, 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) Explain the different types of services in Operating system and its features. (Nov-2022)
Q.2) Define the Utility programs with example. Explain system call. (Nov-2022)
Q.3) Define an operating system. What are the goals of an operating system? Explain. (June-2023)
Q.4) What is meant by system call? How it can be used. How does an application program use these call during execution? (June-2023)
Q.5) In a multiprogramming and time sharing environment several users share system simultaneously. This situation can result in various security problems.
i) What are two such problems?
ii) Can we ensure the same degree of security in a time shared machine as we have in a dedicated machine? Explain your answer? (June-2024)
Q.6) Explain the evolution of operating system in detail. (June-2025)
Q.7) List the functions of OS. How operating system perform management task in a system? (June-2025)
Q.8) Write short notes on: Time Sharing (June-2023)
Q.9) Write short notes on: System Calls (June-2024, Dec-2024, June-2025)
Module 2: File Systems
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.
Previous Years questions appears in RGPV exam.
Q.1) Disk request come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6 and 38 at a time when the disk drive is reading from cylinder 20. The seek time is 6 ms/cylinder. The total seek time if the disk arm scheduling algorithm is First-Come-First-Served (FCFS), and SCAN. (Nov-2022)
Q.2) How many types of disk allocation methods describe Indexed method with merits and demerits. (Nov-2022)
Q.3) 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.4) List the advantages and disadvantages of Magnetic Tape memory. (June-2023)
Q.5) Explain in detail about various ways of free space management. (June-2023)
Q.6) What is a file? Briefly explain different directory structures. What kind of directory structure is used in UNIX? (June-2023)
Q.7) Why do some systems keep track of the type of file, while others leave it to the user or simply do not implement multiple file types? Which system is better? (June-2024)
Q.8) Consider a file system on a disk that has both logical and physical block sizes of 512 bytes. Assume that the information about each file is already in memory. For each of three allocation strategy (continuous, linked and indexed), how is the logical to physical address mapping accomplished in this system? (for indexed allocation assume that a file is always less than 512 blocks long). (June-2024, June-2025)
Q.9) Define the term "Directory". Explain any two schemes of logical directory structures. (Dec-2024)
Q.10) What is a File? Write different file attributes and operations? (June-2025)
Q.11) Give an example of an application in which data in a file should be accessed in following order.
i) Sequentially
ii) Randomly (June-2025)
Q.12) Suppose that a disk drive has 5000 cylinders numbered 0 to 4999. The drive is currently serving a request at cylinder 143 and the previous request was at cylinder 125. The queue of pending request in FIFO order is -
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 750, 750, 750, 750, 750, 130.
Starting from current head position, what is the total distance that the disk arm moves to satisfy all pending request for each of following.
i) SSTF
ii) SCAN
iii) LOOK (June-2025)
Q.13) Write short notes on the following: Contiguous and Linked Disk Allocation Method (Dec-2024)
Module 3: CPU Scheduling & Memory Management
CPU Scheduling: Process Concept, Scheduling Concepts, Types of Schedulers, Process State Diagram, Scheduling Algorithms, Algorithms Evaluation, System calls for Process Management; Multiple Processor Scheduling; Concept of Threads.
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.
Previous Years questions appears in RGPV exam.
Q.1) What is Process ? Explain the process states diagram. (Nov-2022)
Q.2) Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds) , and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.
| Process | Arrival time | CPU Burst time | Priority |
|---|---|---|---|
| P1 | 0 | 11 | 2 |
| P2 | 5 | 28 | 0 |
| P3 | 12 | 2 | 3 |
| P4 | 2 | 10 | 1 |
| P5 | 9 | 16 | 4 |
Solve the problem using preemptive priority scheduling algorithm. Draw the Gantt chart for it. and calculate Average waiting time, Turn around time. (Nov-2022)
Q.3) What are the different criteria for evaluating the CPU scheduling algorithm? (Nov-2022)
Q.4) Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes. (Nov-2022)
Q.5) Describe fixed and variable partitioned contiguous memory allocation scheme along with their merits and demerits. (Nov-2022)
Q.6) Describe the differences among short term, medium term and long term scheduling. (June-2023)
Q.7) Define Process States. Draw the diagram of PCB. (June-2023)
Q.8) What is the difference between threads and process. (June-2023)
Q.9) Explain paging and segmentation. How are they helpful in removing fragmentation? (June-2023)
Q.10) What are the five major activities of an operating system in regards to process management? (June-2024)
Q.11) What resources are used when a thread is created? How do they differ from those when a process is created? (June-2024)
Q.12) Consider the following segment table:
| Segment | Base | Length |
|---|---|---|
| 0 | 219 | 600 |
| 1 | 2300 | 14 |
| 2 | 90 | 100 |
| 3 | 1327 | 580 |
| 4 | 1952 | 96 |
What are the physical addresses for the following logical address?
i) 0430
ii) 110
iii) 2500
iv) 3400 (June-2024, June-2025)
Q.13) Can a system detect that some of its processes are starving? If your answer "Yes" explain how it can? If your answer no, explain how the system can deal with the starvation problem. (June-2024)
Q.14) What are the benefits of mapping objects into virtual memory? Explain in detail. (June-2024)
Q.15) What is Overlay? How to dynamic linking and loading perform in memory management? (June-2024)
Q.16) Explain the need for the Process Control Block (PCB) fields. (Dec-2024)
Q.17) Given the following table:
| Burst Time | Priority | Arrival Time | |
|---|---|---|---|
| A: | 6 | 4 | 0 |
| B: | 10 | 1 | 2 |
| C: | 2 | 2 | 1 |
| D: | 3 | 3 | 3 |
Answer the following questions:
i) Give the scheduling sequence of these processes according to FCFS, Round Robin (Time Quantum=3), pre-emptive SJF. (a larger no. implies a higher priority).
ii) Compute the turnaround time for each process for each of scheduling algorithms in part (i).
iii) Compute the waiting time for each process for each of scheduling algorithms in part (i). (Dec-2024)
Q.18) How multilevel feedback queue scheduling differs from multilevel queue scheduling. (Dec-2024)
Q.19) The following is the sequence of page requests: 1, 2, 3, 5, 4, 1, 2, 5, 3, 2, 4, 3. Assume that there are three frames. Now, how many page faults will occur if an Optimal Page Replacement algorithm is used to replace pages? (Dec-2024)
Q.20) When do page-faults occur? Describe the action taken by the O.S when page-fault occurs. (Dec-2024)
Q.21) How process is differing from program? Describe process transition diagram in detail. (June-2025)
Q.22) What are the five major activities of an operating system in regards to memory management? (June-2025)
Q.23) Consider a variant of the RR algorithm where the entries in the ready queue are pointers to the PCB
i) What would be the effect of putting two pointers to the same process in the ready queue.
ii) What would be the major advantages and drawback of this scheme. (June-2025)
Q.24) How many page faults occur for an optimal page replacement strategy for the following reference string for four page frames.
1 2 3 4 5 3 4 1 6 7 8 7 8 9 7 8 9 5 4 5 4 2 (June-2025)
Q.25) Write short notes on following: Paged Segmentation. (Nov-2022)
Q.26) Write short notes on following: Paging (June-2024)
Q.27) Write short notes on the following: (Any two)
a) Thrashing
b) LRU algorithm
c) Process Control Block
e) Optimal Page Replacement algorithm
f) Interrupts
Multilevel Feedback Queue Scheduling (Dec-2024)
Q.28) Write short notes on following: Demand paging (June-2025)
Module 4: Input / Output & Concurrent Processes
Input / Output: Principles and Programming, Input/Output Problems, Asynchronous Operations, Speed gap Format conversion, I/O Interfaces, Programme Controlled I/O, Interrupt Driven I/O, Concurrent I/O.
Concurrent Processes: Real and Virtual Concurrency, Mutual Exclusion, Synchronization, Inter-Process Communication, Critical Section Problem, Solution to Critical Section Problem: Semaphores – Binary and Counting Semaphores, WAIT & SIGNAL Operations and their implementation. Deadlocks: Deadlock Problems, Characterization, Prevention, Avoidance, Recovery.
Previous Years questions appears in RGPV exam.
Q.1) Consider the resource allocation graph in the figure
Find if the system is in a deadlock state otherwise find a safe sequence. (Nov-2022)
Q.2) Difference between Deadlock and Starvation. Explain the necessary Condition for Deadlock. (Nov-2022)
Q.3) Explain the types of Semaphores in process synchronization. (Nov-2022)
Q.4) Explain the deadlock recovery in brief. (Nov-2022)
Q.5) Explain the I/O buffering and Interrupt driven operation in short. (Nov-2022)
Q.6) What do you mean by deadlock prevention? A computer has six tape drive with a processes competing for them. Each process need two tape drives for which values of n the system is deadlock free. (June-2023)
Q.7) Explain mutual exclusion with suitable example. (June-2023)
Q.8) Discuss Reader-Writers solution using Monitors. (June-2023)
Q.9) What is the meaning of the term busy waiting? What another kind of waiting are there in an operating system? Can busy waiting be avoided altogether? Explain your answer. (June-2024, June-2025)
Q.10) Why Semaphore is important in OS? Explain Binary and counting semaphores with suitable example. (June-2024, June-2025)
Q.11) What is Resource Allocation Graph? Explain the occurrence and avoidance of deadlock graphically among 3 processes and 3 resources. (Dec-2024)
Q.12) Suppose a process P wants to wait for two messages, one from mailbox A and one from mailbox B. What sequence of send and receive should it execute. (June-2025)
Q.13) Why might a system use interrupt driven I/O to manage a single serial port but polling I/O to manage a front end processor, such as a terminal concentrator. (June-2025)
Q.14) Explain concurrency controls? What are the differences between real and virtual concurrency? (June-2025)
Q.15) Explain the concept of buffering and spooling. (June-2025)
Q.16) Define a semaphore for dining philosopher's problem. (June-2025)
Q.17) Write short notes on: Concurrent Programming (June-2023)
Q.18) Write short notes on following: Synchronization (June-2024)
Q.19) Write short notes on following: Deadlock prevention and avoidance (June-2025)
Module 5: Network, Distributed and Multiprocessor Operating Systems
Introduction to Network, Distributed and Multiprocessor Operating Systems. Case Studies: Unix/Linux, WINDOWS and other Contemporary Operating Systems.
Previous Years questions appears in RGPV exam.
Q.1) Explain file system used in Linux and Windows. (June-2023)
Q.2) What are the advantages and disadvantages of making the computer network transparent to the user? (June-2024, June-2025)
Q.3) To build robust distributed systems, you must know what kinds of failures can occur. List three possible types of failures in a distributed system. (June-2024, June-2025)
Q.4) What are the benefits of a DFS when compared to a file system in a centralized system? (June-2024)
Q.5) What aspects of a distributed system would you select for a system running on a totally reliable network. (June-2025)
Q.6) Describe a method for process migration across different architecture running.
i) The same operating system
ii) Different operating system (June-2025)
Q.7) Discuss the design issues of distributed operating system. (June-2025)
Q.8) Write short notes on following: Distributed operating system. (Nov-2022)
Q.9) Write short notes on following: Multiprocessor operating system. (Nov-2022)
Q.10) Write short notes on following: Network Operating system. (Nov-2022)
Q.11) Write short notes on: Virus (June-2023)
Q.12) Write short notes on: Remote Procedure Call (RPC) (June-2023)
Q.13) Write short notes on following: Kernel architecture in Unix (June-2025)
