2023 question paper
Operating System
30 questions
Q1a. Variable partition memory allocation can lead to? (i) external fragmentation (ii) internal fragmentation (iii) both (i) and (ii) (iv) none of these20232m
Module 5: Memory Management
View this question on its own page →Variable partition memory allocation can lead to?
(i) external fragmentation
(ii) internal fragmentation
(iii) both (i) and (ii)
(iv) none of theseQ1b. Suppose that a process is in BLOCKED state waiting for some I/O service. When the service is completed, it goes to the? (i) RUNNING state (ii) READY state (iii) SUSPENDED state (iv) TERMINATED state20232m
Module 2: Processes & Scheduling
View this question on its own page →Suppose that a process is in BLOCKED state waiting for some I/O service. When the service is completed, it goes to the?
(i) RUNNING state
(ii) READY state
(iii) SUSPENDED state
(iv) TERMINATED stateQ1c. SPOOLING stands for? (i) Spontaneous Peripheral Operation Online (ii) Small Peripheral Operation Online (iii) Simultaneous Peripheral Operation Online (iv) None of these20232m
Module 6: I/O & File Management
View this question on its own page →SPOOLING stands for?
(i) Spontaneous Peripheral Operation Online
(ii) Small Peripheral Operation Online
(iii) Simultaneous Peripheral Operation Online
(iv) None of theseQ1d. Scheduling a process from Ready Queue to CPU is done by (i) Short Term Scheduler (ii) Middle Term Scheduler (iii) Long Term Scheduler (iv) Dispatcher20232m
Module 2: Processes & Scheduling
View this question on its own page →Scheduling a process from Ready Queue to CPU is done by
(i) Short Term Scheduler
(ii) Middle Term Scheduler
(iii) Long Term Scheduler
(iv) DispatcherQ1e. Virtual memory is (i) an extremely large main memory (ii) an extremely large secondary memory (iii) an illusion of an extremely large memory (iv) a type of memory used in supercomputer20232m
Module 5: Memory Management
View this question on its own page →Virtual memory is
(i) an extremely large main memory
(ii) an extremely large secondary memory
(iii) an illusion of an extremely large memory
(iv) a type of memory used in supercomputerQ1f. To avoid race condition the maximum number of processes that may simultaneously be inside the critical section is: (i) No Limit (ii) Two (iii) Three (iv) One20232m
Module 3: Inter-process Communication
View this question on its own page →To avoid race condition the maximum number of processes that may simultaneously be inside the critical section is:
(i) No Limit
(ii) Two
(iii) Three
(iv) OneQ1g. With a single resource, deadlock occurs (i) if there are more than two processes competing for that resource (ii) if there are only two processes competing for that resource (iii) if there is a single process competing for that resource (iv) none of these20232m
Module 4: Deadlocks
View this question on its own page →With a single resource, deadlock occurs
(i) if there are more than two processes competing for that resource
(ii) if there are only two processes competing for that resource
(iii) if there is a single process competing for that resource
(iv) none of theseQ1h. If a process has 24 k bytes logical address space and the page size is 4096 bytes then the number of frames of that process is? (i) 12 (ii) 6 (iii) 8 (iv) 1620232m
Module 5: Memory Management
View this question on its own page →If a process has 24 k bytes logical address space and the page size is 4096 bytes then the number of frames of that process is?
(i) 12
(ii) 6
(iii) 8
(iv) 16Q1i. The technique of gradually increasing the priority of a process that wait in a system for a long time is known as? (i) blocking (ii) ageing (iii) starvation (iv) convoy effect20232m
Module 2: Processes & Scheduling
View this question on its own page →The technique of gradually increasing the priority of a process that wait in a system for a long time is known as?
(i) blocking
(ii) ageing
(iii) starvation
(iv) convoy effectQ1j. A computer system has 6 tape drives, with *n* processes competing for them. Each process may need 2 tape drives. The maximum value of *n* for which the system is guaranteed to be deadlock free is (i) 6 (ii) 5 (iii) 4 (iv) 320232m
Module 4: Deadlocks
View this question on its own page →A computer system has 6 tape drives, with n processes competing for them. Each process may need 2 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is
(i) 6
(ii) 5
(iii) 4
(iv) 3Q2a. Write a program using "fork" to demonstrate the parent-child relationship of processes.20237m
Module 2: Processes & Scheduling
View this question on its own page →Write a program using "fork" to demonstrate the parent-child relationship of processes.
Q2b. Consider the following four processes with following details (time given in ms): | Process | Arrival Time | CPU Burst Time | | :--- | :---: | :---: | | P1 | 0 | 12 | | P2 | 0 | 10 | | P3 | 1 | 4 | | P4 | 4 | 10 | | P5 | 2 | 12 | Draw the Gantt chart using RR scheduling with time slice 3ms. Calculate average waiting time and average turn-around time.20237m
Module 2: Processes & Scheduling
View this question on its own page →Consider the following four processes with following details (time given in ms):
Process Arrival Time CPU Burst Time P1 0 12 P2 0 10 P3 1 4 P4 4 10 P5 2 12 Draw the Gantt chart using RR scheduling with time slice 3ms. Calculate average waiting time and average turn-around time.
Q3a. Explain the different states of a process during its life cycle using transition diagram.20235m
Module 2: Processes & Scheduling
View this question on its own page →Explain the different states of a process during its life cycle using transition diagram.
Q3b. Justify the following statement: "Cycle in resource allocation graph does not always imply the occurrence of deadlock".20234m
Module 4: Deadlocks
View this question on its own page →Justify the following statement: "Cycle in resource allocation graph does not always imply the occurrence of deadlock".
Q3c. Explain user and kernel level threads in detail.20235m
Module 2: Processes & Scheduling
View this question on its own page →Explain user and kernel level threads in detail.
Q4a. Compare between compile-time, load-time and execution-time address binding.20234m
Module 5: Memory Management
View this question on its own page →Compare between compile-time, load-time and execution-time address binding.
Q4b. What is the purpose of modify bit in page table.20233m
Module 5: Memory Management
View this question on its own page →What is the purpose of modify bit in page table.
Q4c. Explain paging with translation look-aside buffer (TLB) scheme with suitable diagrams.20237m
Module 5: Memory Management
View this question on its own page →Explain paging with translation look-aside buffer (TLB) scheme with suitable diagrams.
Q5a. What is thrashing. Explain the main cause of thrashing. How can we limit the effects of thrashing.20235m
Module 5: Memory Management
View this question on its own page →What is thrashing. Explain the main cause of thrashing. How can we limit the effects of thrashing.
Q5b. Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1. How many page faults would occur for the FIFO, LRU and Optimal page replacement algorithms, assuming demand paging with four frames? Remember that all frames are initially empty, so first unique pages will cost one fault each.20239m
Module 5: Memory Management
View this question on its own page →Consider the following page reference string:
7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1.
How many page faults would occur for the FIFO, LRU and Optimal page replacement algorithms, assuming demand paging with four frames? Remember that all frames are initially empty, so first unique pages will cost one fault each.Q6a. For a deadlock to occur, each of the necessary conditions must hold. By ensuring that at least one of these conditions cannot hold, we can prevent the occurrence of a deadlock. Give one approach individually to prevent each of these necessary conditions.20237m
Module 4: Deadlocks
View this question on its own page →For a deadlock to occur, each of the necessary conditions must hold. By ensuring that at least one of these conditions cannot hold, we can prevent the occurrence of a deadlock. Give one approach individually to prevent each of these necessary conditions.
Q6b. Consider a system with five processes P0 through P4 and have three resource types A, B, C. Resource type A has ten instances, resource type B has five instances, and resource type C has seven instances. Suppose that the following snapshot represents the current state of the system: | | Allocation | Max | Available | | :--- | :---: | :---: | :---: | | | A B C | A B C | A B C | | P0 | 0 1 0 | 7 5 3 | 3 3 2 | | P1 | 2 0 0 | 3 2 2 | | | P2 | 3 0 2 | 9 0 2 | | | P3 | 2 1 1 | 2 2 2 | | | P4 | 0 0 2 | 4 3 3 | | The system is currently in safe state. Suppose now that P1 requests additional resources as (A=1, B=0, C=2). Is this request can be immediately granted? Justify your answer.20237m
Module 4: Deadlocks
View this question on its own page →Consider a system with five processes P0 through P4 and have three resource types A, B, C. Resource type A has ten instances, resource type B has five instances, and resource type C has seven instances. Suppose that the following snapshot represents the current state of the system:
Allocation Max Available A B C A B C A B C P0 0 1 0 7 5 3 3 3 2 P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3 The system is currently in safe state. Suppose now that P1 requests additional resources as (A=1, B=0, C=2). Is this request can be immediately granted? Justify your answer.
Q7a. State producer-consumer problem. Give a solution to this problem using semaphore. Justify that your solution guarantees mutual exclusion.20236m
Module 3: Inter-process Communication
View this question on its own page →State producer-consumer problem. Give a solution to this problem using semaphore. Justify that your solution guarantees mutual exclusion.
Q7b. Discuss critical section problem. Illustrate the classic software-based solution to this problem known as Peterson's solution.20238m
Module 3: Inter-process Communication
View this question on its own page →Discuss critical section problem. Illustrate the classic software-based solution to this problem known as Peterson's solution.
Q8a. Differentiate between storage media with constant linear velocity (CLV) and constant angular velocity (CAV).20235m
Module 6: I/O & File Management
View this question on its own page →Differentiate between storage media with constant linear velocity (CLV) and constant angular velocity (CAV).
Q8b. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 2150, and the previous request was at cylinder 1805. The queue of pending requests, in FIFO order, is: 2069; 1212; 2296; 2800; 544; 1618; 356; 1523; 4965; 3681. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for FCFS, SCAN and C-SCAN disk-scheduling algorithms? Draw the head movement diagram also.20239m
Module 6: I/O & File Management
View this question on its own page →Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 2150, and the previous request was at cylinder 1805. The queue of pending requests, in FIFO order, is:
2069; 1212; 2296; 2800; 544; 1618; 356; 1523; 4965; 3681.
Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for FCFS, SCAN and C-SCAN disk-scheduling algorithms? Draw the head movement diagram also.Q9a. Write short notes on: Inverted Page Table20237m
Module 5: Memory Management
View this question on its own page →Write short notes on: Inverted Page Table
Q9b. Write short notes on: I-Node20237m
Q9c. Write short notes on: Process Control Block (PCB)20237m
Module 2: Processes & Scheduling
View this question on its own page →Write short notes on: Process Control Block (PCB)
Q9d. Write short notes on: Belady's Anomaly20237m
Module 5: Memory Management
View this question on its own page →Write short notes on: Belady's Anomaly