PUT Solution

Operating System (BCA-3003)

Section A
1A. Define Process Control Block (PCB).
A Process Control Block (PCB) is a data structure used by the operating system to store
information about a process. It contains all the information the OS needs to manage the
execution of a process. Each process has its own PCB, and it includes details such as:
 Process ID (PID)
 Process state (e.g., running, waiting, etc.)
 Program counter (address of the next instruction)
 CPU registers (e.g., accumulator, index registers, etc.)
 Memory management information (e.g., base and limit registers, page tables)
 I/O status information (e.g., devices allocated to the process)
 CPU scheduling information (priority, pointers to queues)
1B. Define Process Scheduling with the help of a diagram.
Process Scheduling is the method by which the operating system decides which process
should run at a given time. It is essential to allocate CPU time effectively among processes in
a multitasking system. The operating system uses scheduling algorithms to decide which
process should be given the CPU next.
 Process Scheduling Diagram:
Ready Queue --> Scheduler --> Running Process --> Blocked Queue --> Ready Queue
(on event completion)
Explanation:
 Ready Queue: Processes waiting for the CPU are placed here.
 Running Process: The process currently executing on the CPU.
 Blocked Queue: Processes waiting for I/O or some event.
 The scheduler selects a process from the ready queue based on the scheduling
algorithm and allocates CPU time.
1C. Define the scheduling criteria.
The scheduling criteria are the factors that determine the effectiveness of the scheduling
algorithm. These include:
1. CPU Utilization: The percentage of time the CPU is actively working.
2. Throughput: The number of processes completed per unit time.
3. Turnaround Time: The total time taken from submission to completion of a process.
4. Waiting Time: The total time a process spends in the ready queue.
5. Response Time: The time from when a process is submitted until the first output is
produced.
6. Fairness: The degree to which the CPU is allocated fairly among all processes.
1D. List any two page-replacement algorithms.
Two common page-replacement algorithms are:
1. FIFO (First-In-First-Out): Pages are replaced in the order they entered memory.
2. LRU (Least Recently Used): The page that has not been used for the longest time is
replaced.
1E. Define Operation on Process.
Operations on a process refer to the actions that the operating system can perform to manage
and control processes. These operations include:
1. Process Creation: The creation of a new process.
2. Process Scheduling: Deciding which process should be given the CPU.
3. Process Termination: A process ends when its execution is complete or it is terminated
by the OS.
4. Process Suspension: A process may be suspended temporarily for various reasons like
I/O.
1F. Explain Segmentation with the help of an example.
Segmentation is a memory management technique that divides a program into different
segments, each of which is a logical unit (e.g., code, data, stack). These segments are of
variable length, and each segment has its own base and limit.
 Example: A program may have:
1. Code Segment: The instructions of the program.
2. Data Segment: Variables and data used by the program.
3. Stack Segment: Stores function calls, local variables, etc.
Each segment can grow or shrink independently, providing flexibility in memory allocation.
1G. Explain Demand Paging with its advantages and disadvantages.
Demand Paging is a memory management scheme where pages of a process are only loaded
into memory when they are needed, i.e., on-demand. This reduces the memory requirements
since not all pages are loaded at once.
 Advantages:
1. Efficient Memory Usage: Only pages that are required are loaded, saving
memory space.
2. Reduced I/O: Less data is read from disk if the required pages are already in
memory.
 Disadvantages:
1. Page Fault Overhead: If a page is not in memory, a page fault occurs, which
takes time to load the page from disk.
2. Increased Complexity: Managing pages requires more complex algorithms for
page replacement.

Section B
2. Explain Resource Allocation Graph with example.
A Resource Allocation Graph (RAG) is a directed graph used to represent the allocation of
resources in a system. It helps in detecting deadlocks. The graph consists of:
1. Processes represented by circles.
2. Resources represented by rectangles.
3. Edges:
o Request Edge: From a process to a resource (request for a resource).
o Assignment Edge: From a resource to a process (resource assigned to process).
Example: Consider two processes P1 and P2, and two resources R1 and R2.
 P1 requests R1: an edge is drawn from P1 to R1.
 R1 is allocated to P1: an edge is drawn from R1 to P1.
The Resource Allocation Graph helps in detecting cycles, which indicate potential deadlocks.
3. Explain Deadlock with necessary conditions.
A Deadlock is a situation where two or more processes are unable to proceed because each is
waiting for resources held by the other(s). The necessary conditions for a deadlock are:
1. Mutual Exclusion: At least one resource is held in a non-shareable mode.
2. Hold and Wait: A process holding a resource is waiting for additional resources.
3. No Preemption: Resources cannot be forcibly taken away from processes.
4. Circular Wait: A set of processes is waiting for resources in a circular chain.
4. Explain about the methods for handling Deadlocks.
Methods for handling deadlocks include:
1. Deadlock Prevention: Modify the system to ensure that at least one of the necessary
conditions for deadlock cannot hold. For example, eliminating circular wait by
assigning a partial order to resources.
2. Deadlock Avoidance: The system makes decisions to avoid entering an unsafe state,
e.g., using the Banker's Algorithm.
3. Deadlock Detection and Recovery: Allow the system to enter a deadlock state but
periodically check for deadlock and recover by terminating or rolling back processes.
5. Define File and explain file attributes.
A File is a collection of data stored on a storage device like a hard disk or SSD. It can contain
programs, data, or both.
File Attributes:
1. File Name: The name by which the file is identified.
2. File Type: Specifies the file's format (e.g., text, binary).
3. File Size: The amount of disk space occupied by the file.
4. File Permissions: Determines who can read, write, or execute the file.
5. File Location: The physical location of the file on the storage medium.
 6. Creation Date: The date the file was created.
7. Modification Date: The last date the file was modified.

Section C
6. Write Short Note on following:
1. Simple Batch Systems:
In Simple Batch Systems, jobs with similar requirements are grouped together and executed
sequentially without interaction with the user. They do not support interactive computing.
The job is submitted to the system, processed in a batch, and output is generated after
completion.
2. Parallel Systems:
In Parallel Systems, multiple processors work together to solve a problem more efficiently.
Tasks are divided into smaller sub-tasks that can be processed simultaneously, providing high
performance and faster computation.
7. Explain techniques for device management in operating system.
Device management involves controlling and coordinating hardware devices in a system.
Techniques include:
1. Device Drivers: Software that manages communication between the OS and hardware
devices.
2. Buffering: Storing data in memory (buffer) temporarily to handle differences in speed
between devices.
3. Spooling: Storing data for output devices in a buffer and printing in the order they
were received.
4. Device Scheduling: Allocating devices based on priority or need.
8. 1. FIFO:-
Reference Memory State (Frames) Page Fault / Hit Description
4 [4] Page Fault 4 is loaded
7 [4, 7] Page Fault 7 is loaded
5 [4, 7, 5] Page Fault 5 is loaded
7 [4, 7, 5] Hit 7 is already in memory
6 [7, 5, 6] Page Fault 4 is replaced by 6
7 [7, 5, 6] Hit 7 is already in memory
10 [5, 6, 10] Page Fault 7 is replaced by 10
4 [6, 10, 4] Page Fault 5 is replaced by 4
8 [10, 4, 8] Page Fault 6 is replaced by 8
5 [4, 8, 5] Page Fault 10 is replaced by 5
8 [4, 8, 5] Hit 8 is already in memory
6 [8, 5, 6] Page Fault 4 is replaced by 6
8 [5, 6, 8] Hit 8 is already in memory
11 [6, 8, 11] Page Fault 5 is replaced by 11
4 [8, 11, 4] Page Fault 6 is replaced by 4
9 [11, 4, 9] Page Fault 8 is replaced by 9
5 [4, 9, 5] Page Fault 11 is replaced by 5
9 [4, 9, 5] Hit 9 is already in memory
6 [9, 5, 6] Page Fault 4 is replaced by 6
 9 [5, 6, 9] Hit 9 is already in memory
12 [6, 9, 12] Page Fault 5 is replaced by 12
4 [9, 12, 4] Page Fault 6 is replaced by 4
7 [12, 4, 7] Page Fault 9 is replaced by 7
5 [4, 7, 5] Page Fault 12 is replaced by 5
7 [4, 7, 5] Hit 7 is already in memory

Results for FIFO:

Total Page Faults: 18
Total Hits: 7
Hit Ratio: 725×100=28%\frac{7}{25} \times 100 = 28\%257×100=28%

2.
Reference Memory State (Frames) Page Fault / Hit Description
4 [4] Page Fault 4 is loaded
7 [4, 7] Page Fault 7 is loaded
5 [4, 7, 5] Page Fault 5 is loaded
7 [4, 7, 5] Hit 7 is already in memory
6 [4, 7, 5, 6] Page Fault 6 is loaded
7 [4, 7, 5, 6] Hit 7 is already in memory
10 [4, 7, 6, 10] Page Fault 5 is replaced by 10
4 [7, 6, 10, 4] Hit 4 is already in memory
8 [7, 6, 10, 8] Page Fault 5 is replaced by 8
5 [7, 6, 10, 8] Page Fault 7 is replaced by 5
8 [7, 6, 10, 8] Hit 8 is already in memory
6 [7, 10, 8, 6] Hit 6 is already in memory
8 [7, 10, 8, 6] Hit 8 is already in memory
11 [10, 8, 6, 11] Page Fault 7 is replaced by 11
4 [8, 6, 11, 4] Page Fault 10 is replaced by 4
9 [8, 6, 11, 9] Page Fault 4 is replaced by 9
5 [6, 11, 9, 5] Page Fault 8 is replaced by 5
9 [6, 11, 5, 9] Hit 9 is already in memory
6 [11, 5, 9, 6] Hit 6 is already in memory
9 [11, 5, 6, 9] Hit 9 is already in memory
12 [5, 6, 9, 12] Page Fault 11 is replaced by 12
4 [6, 9, 12, 4] Hit 4 is already in memory
7 [6, 9, 12, 7] Page Fault 5 is replaced by 7
5 [6, 9, 7, 5] Page Fault 12 is replaced by 5
7 [6, 9, 5, 7] Hit 7 is already in memory

Results for LRU:

Total Page Faults: 18
Total Hits: 7
Hit Ratio: 725×100=28%\frac{7}{25} \times 100 = 28\%257×100=28%
4. OPR:-
No. of hit-15
Hit ratio- 15/25=3/5
Page fault- 25-15=13