Important RGPV Question

CS-405 Operating Systems

IV Sem, CSE
UNIT 1- Introduction to Operating Systems
Q.1) Define an operating system. What are the goals of an
operating system? Explain.

RGPV June 2023

Q.2) What is meant by system call? How it can be used. How

does an application program use these call during execution?

RGPV June 2023

Q.3) What is meant by a System call? How it can be used? How

does an application program use these calls during execution?

RGPV June 2020

Q.4) What are System call? Explain briefly about various types of
system call provided by an operating system.

RGPV Nov 2019

Q.5) What are the various services provided by Operating

system?

RGPV Nov 2019

Q.6) What is an operating system? Write down its desirable

characteristics?

RGPV May 2019

Q.7) Discuss different types of operating system with examples of

each?

RGPV May 2019

Q.8) Discuss the advantages and disadvantages of the buffer
cache?

RGPV May 2019

UNIT 2- File Systems:

Q.1) Explain file system used in Linux and Windows.

RGPV June 2023

Q.2) What is a file? Briefly explain different directory structures.

What kind of directory structure is used in UNIX?

RGPV June 2023

Q.3) Describe various space allocation strategies with their

merits/demerits.

RGPV June 2020

Q.4) What is File? What are the different File attributes and
operations?

RGPV Nov 2019

Q.5) Explain various Disk scheduling algorithms with illustration?

RGPV May 2019

Q.6) Explain the following in brief.

i) Contiguous and linked list allocation for implementing file

system.

ii) File attributes and File operations.

RGPV May 2019

Q.7) Write short note on File system in Linux.

RGPV May 2019

UNIT 3- CPU Scheduling And Memory Management

Q.1) Describe the differences among short term, medium term
and long term scheduling.

RGPV June 2023

Q.2) Define Process States. Draw the diagram of PCB.

RGPV June 2023

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

RGPV June 2023

Q.4) List the advantages and disadvantages of Magnetic Tape

memory.

RGPV June 2023

Q.5) Explain in detail about various ways of free space

management.

RGPV June 2023

Q.6) What is the difference between threads and process.

RGPV June 2023

Q.7) Explain paging and segmentation. How are they helpful in

removing fragmentation?

RGPV June 2023

Q.8) Define Process States. Draw the diagram of PCB.

RGPV June 2020

Q.9) Compare Paging and Segmentation with example.

RGPV June 2020

Q.10) Consider the main memory with capacity of 3 frames.
Assume that pages of a process are referenced in the order as
given below:

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3

Which one is better FIFO or LRU and why?

RGPV June 2020

Q.11) What is Virtual Memory? Explain the concept of demand

paging.

RGPV June 2020

Q.12) Explain how logical memory address are translated into

physical memory address in segmented memory management
system with example.

Q.13) Consider the following set of processes.

Develop a Gantt-chart and calculate the average waiting time

using:

i) FCFS

ii) SJF

iii) Round Robin (q = 1)

RGPV June 2020

Q.14) – On a simple paging system with

2^24 bytes of physical memory, 256 pages of logical address

space and a page size

2^10 bytes, How many bits are in logical address.

RGPV Nov 2019

Q.15) Define process and thread. What is process control Block?

Explain its various entries with their usefulness?

RGPV May 2019

Q.16) Explain concept of a process with its components?

RGPV May 2019

Q.17) What is scheduling? Explain short, medium and long term

scheduler?

RGPV May 2019

Q.18) What do you mean by virtual memory and write down its
advantages?

RGPV May 2019

Q.19) Write short notes;

a) Programmed controlled I/O

b) Demand paging

RGPV May 2019

UNIT 4- Input / Output And Concurrent Processes :

Q.1) 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.

RGPV June 2023

Q.2) Explain mutual exclusion with suitable example.

RGPV June 2023

Q.3) Discuss Reader-Writers solution using Monitors.

RGPV June 2023

Q.4) Briefly explain the following.

i) Mutual exclusion

ii) Critical section problem

RGPV June 2020, May 2019

Q.5) Consider following Snapshot of a system:

Answer the following questions using Bankers Algorithm

i) Is the system in Safe state

ii) What is the content of the Matrix need?

RGPV June 2020

Q.6) What do you mean by Semaphore? Explain its uses and its
implementation.

RGPV June 2020

Q.7) What is Binary and Counting semaphores?

RGPV Nov 2019

Q.8) Describe necessary conditions for a deadlocks situation to

arise.

RGPV Nov 2019

Q.9) Define a deadlock? Write down the conditions responsible

for deadlock? How can we recover from deadlock?

RGPV May 2019

Q.10) Write a semaphore solution for dining philosopher’s
problem?

RGPV May 2019

Q.11) Write short note on Programmed controlled I/O.

RGPV May 2019

UNIT 5- Introduction to Network, Distributed and

Multiprocessor Operating Systems. Case Studies:
Q.1) Write down the features of a Multiprocessor operating
system?

RGPV May 2019

EXTRA QUESTIONS-
Q.1) Write short notes:

a) Concurrent Programming

b) Virus

c) Remote Procedure Call (RPC)

d) Time Sharing.

RGPV June 2023

Q.2) Write a short notes

i) Time sharing

ii) Network

iii) Batch processing

RGPV June 2020

Q.3) What is meant by Thrashing? Explain various causes of

thrashing.

RGPV June 2020

Q.4) Explain the concept of dirty bit for improving the
performance during page fault.

RGPV June 2020

Q.5) Write short notes.

a) Remote Procedure Call (RPC)

b) Worms and Virus

c) Define levels of RAIO

RGPV June 2020

Q.6) What do you mean by PCB? Where is it used? What are its
contents? Explain.

RGPV Nov 2019

Q.7) Consider the following page reference string

निम्नलिखित पृष्ठ सदर्भ स्ट्रिंग पर विचार करें।

1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5. How many
page faults would occur for the following replacement algorithm,
assuming four frame:

a) FIFO

b) LRU

RGPV Nov 2019

Q.8) Explain the following term.

a) Real and virtual concurrency

b) Critical section

c) Mutual exclusion

d) I/O Interfaces

RGPV Nov 2019

Q.9) Write a short notes

a) Multi processor operating system

b) Distributed operating system

c) Threads

d) File protection

RGPV Nov 2019

Q1. What do you mean by Virtual Memory? Write

down its advantages?.

Q2. Compare Paging and Segmentation?

Q3. What is Process Scheduling, CPU Scheduling,

Disk Scheduling? Explain Short, Medium and Long
term Scheduler?.

Q4. Explain concept of a process with its

components. Ans.
Q5. Explain the following in brief Contiguous and
Linked list allocation for implementing file
system?

Q6. Explain various Disk scheduling algorithms

with Illustrations

Q7. Define process and thread. What is PCB?

Explain its various entries with their usefulness?

Q8. Discuss advantages and disadvantages of the

Buffer cache?
Q9. Explain different types of OS with examples
of each.

. Q10. What is an Operating System? Write down

its desirable characteristics?

Q11. Wrtie short notes a)Multi processor

operating system b)Distributes operating system
c)Threads d)File protection

.
Q12. Define a deadlock? Write down the
conditions responsible for deadlock? How can we
recover from deadlock?

Q13. What are the various services provided by

Operating system?

Q14. What do you mean by PCB? Where is it

used? What are its contents? Explain.

Q15. What is Binary and Counting semaphores?

. Q16. What is File? What are the different File

attribute and operations
Q17. What are System call? Explain briefly about
various types of system call provided by an
Operating System?

Q18. Describe necessary conditions for deadlocks

situation to arise.
Q20. What are points to be consider in file
system design? Explain linked list allocation in
detail?
Q21. Write a Semaphore solution for dining
Philosopher’s problem?

Q22. Briefly explain the following: (11:30 to

12:00) 1)Mutual exclusion 2)Critical section

Q23. Consider the following page reference

string: 1,2,3,4,5,3,4,1,2,7,8,7,8,9,7,8,9,5,4,5. How
many page faults would occur for the following
replacement algorithm, assuming four frames:
a)FIFO b)LRU.
Unit 1: Introduction to Operating Systems

1. Explain the functions of an Operating System (OS).

2. Discuss the evolution of Operating Systems.
3. Describe the desirable characteristics and features of an OS.
4. What are the different types of services provided by an OS?
5. Explain various ways of providing OS services through utility programs and system calls.
6. What is the difference between user-level services and system-level services in an OS?

Unit 2: Process Management

1. Define a process and explain the Process State Diagram.

2. What is a process-based kernel? Discuss its significance.
3. Explain the dual mode of process execution.
4. Describe various CPU scheduling algorithms with examples.
5. What is deterministic modeling in CPU scheduling?
6. List and explain system calls for process management.
7. Differentiate between user-level and kernel-level threads.
8. Explain process management in UNIX and Windows operating systems.
9. Discuss inter-process communication (IPC) and its mechanisms.
10. What is the Critical Section Problem and how can it be solved using semaphores?
11. Explain the concepts of deadlock, its characterization, prevention, avoidance, and recovery
mechanisms.
12. Describe IPC mechanisms in UNIX and Windows.
Unit 3: Memory Management

1. Explain different memory management techniques: Partitioning, Swapping, Segmentation,

Paging, and Paged Segmentation.
2. Compare different memory management techniques.
3. Describe the techniques for supporting the execution of large programs, such as overlay,
dynamic linking, and loading.
4. What is virtual memory? Explain its implementation using demand paging.
5. Discuss memory management in UNIX and Windows operating systems.

Unit 4: File Systems Management

1. Explain the concept of a file and the user’s/system programmer’s view of a file system.
2. Describe the organization of disks and tapes.
3. Explain the different modules of a file system.
4. Discuss disk space allocation methods: Contiguous, Linked, and Indexed.
5. Explain different directory structures and file protection mechanisms.
6. What are the system calls for file management?
7. Discuss disk scheduling algorithms.
8. Explain file systems in UNIX and Windows.

Unit 5: Input/Output Management

1. What are the principles of I/O management and programming?

2. Discuss common input/output problems and their solutions.
3. Explain different I/O operations: Program Controlled, Interrupt Driven, Concurrent I/O, and
Asynchronous Operations.
4. Describe the logical structure of I/O functions.
5. What is I/O buffering? Explain its significance.
6. Describe the kernel I/O subsystem.
7. Provide an introduction to network, distributed, and multiprocessor operating systems.