Operating System (OS) – Probable 70-Mark Question Paper

Q.1 Answer any FIVE of the following: (10 Marks)

1. Define Real-Time Operating System and list four applications.

2. Explain any four services provided by an OS.

3. Draw and explain the Process State Diagram.

4. Differentiate between Paging and Segmentation (any two points).

5. Define Virtual Memory with an example.

6. Write the syntax for the following commands:

o i) kill

o ii) sleep

Q.2 Answer any THREE of the following: (12 Marks)

1. Explain the Round Robin Scheduling Algorithm with an example.

2. Describe Deadlock and list the necessary conditions for it.

3. Define Inter-process Communication (IPC) and explain the Shared Memory Model with a
diagram.

4. Explain the CPU Burst and I/O Burst Cycle with a diagram.

Q.3 Answer any THREE of the following: (12 Marks)

1. What is the purpose of a System Call? Explain any two types with examples.

2. Describe the Contiguous File Allocation Method with its advantages and disadvantages.

3. Explain Deadlock Prevention Techniques (any two techniques).

4. Define Scheduling Criteria and explain any four of them.

Q.4 Answer any THREE of the following: (12 Marks)

1. Explain the First-Come-First-Serve (FCFS) and Shortest Job First (SJF) scheduling algorithms
with a Gantt chart and calculate the average waiting time.

2. Describe the difference between Multi-programming OS and Multi-tasking OS (any four

points).

3. Explain LRU Page Replacement Algorithm for the reference string:

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1.
(Assume frame size = 3).
 4. What is File Management? List any four file operations.

Q.5 Answer any TWO of the following: (12 Marks)

1. List the Types of Schedulers and explain each type in detail.

2. Describe the Partitioning Methods:

o i) Fixed Partitioning

o ii) Variable Partitioning

3. Explain the Difference Between Multi-threading Models:

o i) Many-to-One

o ii) One-to-One

o iii) Many-to-Many

Q.6 Answer any TWO of the following: (12 Marks)

1. What are the Free Space Management Techniques? Explain the Bit Vector Method in detail.

2. Explain the Contiguous vs. Linked File Allocation Methods with diagrams.

3. Discuss the Multithreading Models with suitable examples.

Q.1 Answer any FIVE of the following: (10 Marks)

1. Define Real-Time Operating System (RTOS) and list four applications:

o A real-time operating system processes data as it comes in, typically within a strict
time constraint.

o Applications:

1. Flight control systems

2. Industrial automation

3. Medical devices (e.g., pacemakers)

4. Military systems

2. Explain any four services provided by an OS:

o User Interface: Allows communication with the OS via CLI, GUI, or batch interface.

o Program Execution: Provides an environment to execute user programs.

o I/O Operations: Manages devices like printers, keyboards, and disk drives.

o File System Management: Handles file creation, deletion, and storage.

3. Draw and explain the Process State Diagram:

o States:

1. New: Process is created.

2. Ready: Process is in memory, waiting for CPU.

3. Running: Process is executing on the CPU.

4. Waiting: Process is waiting for an I/O resource.

5. Terminated: Process has completed execution.

(Diagram: Include the state transitions)

4. Differentiate between Paging and Segmentation:

o Paging: Divides memory into fixed-size blocks (pages).

o Segmentation: Divides memory into variable-size segments based on logical

divisions.

5. Define Virtual Memory:

o Virtual memory allows programs to use more memory than physically available by
using disk storage as an extension of RAM.

6. Syntax for Commands:

o kill: kill [PID]

o sleep: sleep NUMBER[SUFFIX]

Q.2 Answer any THREE of the following: (12 Marks)

1. Round Robin Scheduling Algorithm:

o Time quantum: A fixed time for each process.

o Processes execute in a cyclic order. If a process doesn't finish, it's preempted and
moved to the end of the queue.
(Example: Reference the example from the model paper, using a time quantum of
4ms)

2. Deadlock Definition and Necessary Conditions:

o Deadlock: A situation where a set of processes are blocked because each process is
waiting for a resource held by another.

o Conditions:

1. Mutual Exclusion

2. Hold and Wait

3. No Preemption

4. Circular Wait

3. Inter-process Communication (IPC) – Shared Memory Model:

o Shared memory enables processes to communicate by accessing a common memory

area.
(Diagram: Include a shared memory segment with processes accessing it)

4. CPU Burst and I/O Burst Cycle:

o CPU Burst: Time spent by a process in execution.

o I/O Burst: Time spent waiting for I/O operations.

(Diagram: Show CPU and I/O bursts in a cycle)

Q.3 Answer any THREE of the following: (12 Marks)

1. Purpose of System Call and Examples:

o System calls provide an interface for user programs to request OS services.

o Examples:

1. create process: Creates a new process.

2. read: Reads data from a file.

2. Contiguous File Allocation Method:

o Files are stored in contiguous memory blocks.

 o Advantages: Fast access, supports sequential and direct access.

o Disadvantages: External fragmentation, difficulty in resizing files.

3. Deadlock Prevention Techniques:

o Mutual Exclusion: Use sharable resources.

o Hold and Wait: Request all resources at once.

4. Scheduling Criteria:

o CPU Utilization: Keep the CPU busy as much as possible.

o Throughput: Number of processes completed per unit time.

o Turnaround Time: Total time from submission to completion.

o Waiting Time: Time spent in the ready queue.

Q.4 Answer any THREE of the following: (12 Marks)

1. SJF and FCFS Scheduling Algorithms:

(Example: Reference from the model paper with Gantt charts)

2. Multi-programming OS vs. Multi-tasking OS:

o Multi-programming: Maximizes CPU utilization by running multiple programs.

o Multi-tasking: Provides user interaction with multiple tasks simultaneously.

3. LRU Page Replacement Algorithm:

(Example: Reference the provided string in the model paper)

4. File Operations:

o Creating a File

o Reading a File

o Writing to a File

o Deleting a File

Q.5 Answer any TWO of the following: (12 Marks)

1. Types of Schedulers:

o Long-term Scheduler: Selects processes for execution.

o Short-term Scheduler: Allocates CPU to ready processes.

o Medium-term Scheduler: Swaps processes in and out of memory.

2. Partitioning Methods:

o Fixed Partitioning: Divides memory into fixed-size blocks.

 o Variable Partitioning: Allocates memory dynamically as required by processes.

3. Multi-threading Models:

o Many-to-One: Maps multiple user threads to one kernel thread.

o One-to-One: Maps each user thread to a kernel thread.

o Many-to-Many: Maps many user threads to fewer or equal kernel threads.

Q.6 Answer any TWO of the following: (12 Marks)

1. Free Space Management – Bit Vector Method:

o Tracks free and allocated blocks using a bit array (1 = free, 0 = allocated).

2. File Allocation Methods:

o Contiguous: Sequentially stores file blocks.

o Linked: Uses pointers to link blocks.

3. Multithreading Models:
(Discuss advantages and disadvantages of each model as above)