2024 question paper
OPERATING SYSTEM
23 questions
Q1a. A process is moved to the ready state when its time quantum expires. (i) Blocked (ii) New (iii) Running (iv) Suspended20242m
Module 2: Processes
View this question on its own page →A process is moved to the ready state when its time quantum expires.
(i) Blocked
(ii) New
(iii) Running
(iv) SuspendedQ1b. Which of the following is also called job scheduler? (i) DMA controller (ii) Short-term scheduler (iii) CPU scheduler (iv) Long-term scheduler20242m
Module 2: Processes
View this question on its own page →Which of the following is also called job scheduler?
(i) DMA controller
(ii) Short-term scheduler
(iii) CPU scheduler
(iv) Long-term schedulerQ1c. Compaction is used to solve the problem of (i) External fragmentation (ii) Internal fragmentation (iii) both (i) and (ii) (iv) None of these20242m
Module 5: Memory Management
View this question on its own page →Compaction is used to solve the problem of
(i) External fragmentation
(ii) Internal fragmentation
(iii) both (i) and (ii)
(iv) None of theseQ1d. Which process can be affected by other processes executing in the system? (i) Independent process (ii) Co-operative process (iii) Dependent Process (iv) child process20242m
Module 2: Processes
View this question on its own page →Which process can be affected by other processes executing in the system?
(i) Independent process
(ii) Co-operative process
(iii) Dependent Process
(iv) child processQ1e. What is the drawback of banker's algorithm? (i) in advance processes rarely know how much resource they will need (ii) the number of processes changes as time progresses (iii) resource once available can disappear (iv) all of the mentioned20242m
Module 4: Deadlocks
View this question on its own page →What is the drawback of banker's algorithm?
(i) in advance processes rarely know how much resource they will need
(ii) the number of processes changes as time progresses
(iii) resource once available can disappear
(iv) all of the mentionedQ1f. An I/O port typically consists of four registers-status, control, ______ and ______ registers. (i) system in, system out (ii) flow in, flow out (iii) data in, data out (iv) input, output20242m
Module 6: File Management
View this question on its own page →An I/O port typically consists of four registers-status, control, ______ and ______ registers.
(i) system in, system out
(ii) flow in, flow out
(iii) data in, data out
(iv) input, outputQ1g. The address loaded into the memory address register of the memory is referred to as (i) Physical address (ii) IP address (iii) Port address (iv) Logical address20242m
Module 5: Memory Management
View this question on its own page →The address loaded into the memory address register of the memory is referred to as
(i) Physical address
(ii) IP address
(iii) Port address
(iv) Logical addressQ1h. Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67. Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is? (i) 600 (ii) 630 (iii) 620 (iv) 64020242m
Module 6: File Management
View this question on its own page →Consider a disk queue with requests for I/O to blocks on cylinders. 98 183 37 122 14 124 65 67. Considering FCFS (first cum first served) scheduling, the total number of head movements is, if the disk head is initially at 53 is?
(i) 600
(ii) 630
(iii) 620
(iv) 640Q1i. The Trap mode bit changes from 0 to 1 when mode switches to ______ mode. (i) Kernel, User (ii) User, User (iii) Kernel, Kernel (iv) User, Kernel20242m
Module 1: Introduction
View this question on its own page →The Trap mode bit changes from 0 to 1 when mode switches to ______ mode.
(i) Kernel, User
(ii) User, User
(iii) Kernel, Kernel
(iv) User, KernelQ1j. Waiting Time is calculated as (i) Turnaround Time - Burst Time (ii) Turnaround Time - Arrival Time (iii) Completion Time - Arrival Time (iv) Completion Time - Burst Time20242m
Module 2: Processes
View this question on its own page →Waiting Time is calculated as
(i) Turnaround Time - Burst Time
(ii) Turnaround Time - Arrival Time
(iii) Completion Time - Arrival Time
(iv) Completion Time - Burst TimeQ2a. Define Thread? List some of the benefits of multithreading. Demonstrate the three methods to implement Threads.20247m
Module 2: Processes
View this question on its own page →Define Thread? List some of the benefits of multithreading. Demonstrate the three methods to implement Threads.
Q2b. Assume the following workload in a system: | Process | Arrival Time | Burst Time | | :--- | :--- | :--- | | P0 | 1 | 3 | | P1 | 0 | 6 | | P2 | 3 | 2 | | P3 | 4 | 7 | | P4 | 2 | 8 | | P5 | 6 | 5 | Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum=3 : (i) Average Turn Around Time (ii) Average Waiting Time20247m
Module 2: Processes
View this question on its own page →Assume the following workload in a system:
Process Arrival Time Burst Time P0 1 3 P1 0 6 P2 3 2 P3 4 7 P4 2 8 P5 6 5 Illustrating the execution of these job using Round Robin Scheduling algorithm calculate when given Time Quantum=3 :
(i) Average Turn Around Time
(ii) Average Waiting TimeQ3a. Differentiate between: (i) User level Thread and Kernel level Thread. (ii) Preemptive scheduling and Non-preemptive scheduling (iii) Contiguous and Indexed allocation method20249m
Module 2: Processes
View this question on its own page →Differentiate between:
(i) User level Thread and Kernel level Thread.
(ii) Preemptive scheduling and Non-preemptive scheduling
(iii) Contiguous and Indexed allocation methodQ3b. How is a process different from a program? With an example explain why Process synchronization is necessary in multiprocessing operating system?20245m
Module 3: Inter-process Communication
View this question on its own page →How is a process different from a program? With an example explain why Process synchronization is necessary in multiprocessing operating system?
Q4a. Describe the techniques for recovery from deadlock? Explain briefly resource allocation graph with examples.20247m
Module 4: Deadlocks
View this question on its own page →Describe the techniques for recovery from deadlock? Explain briefly resource allocation graph with examples.
Q4b. Consider a disk queue with requests for I/O to blocks on cylinders: 98, 183, 37, 122, 14, 124, 65, 67. Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?20247m
Module 6: File Management
View this question on its own page →Consider a disk queue with requests for I/O to blocks on cylinders: 98, 183, 37, 122, 14, 124, 65, 67. Considering SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk head is initially at 53 is?
Q5a. What is the difference between fixed partition and variable partition also explains the need of compaction.20247m
Module 5: Memory Management
View this question on its own page →What is the difference between fixed partition and variable partition also explains the need of compaction.
Q5b. What is virtual memory? How is it implemented? Explain TLB in virtual memory with neat diagram.20247m
Module 5: Memory Management
View this question on its own page →What is virtual memory? How is it implemented? Explain TLB in virtual memory with neat diagram.
Q6a. What is Reader-Writer problem? Explain how Semaphore is used to resolve the problem of process synchronization.20247m
Module 3: Inter-process Communication
View this question on its own page →What is Reader-Writer problem? Explain how Semaphore is used to resolve the problem of process synchronization.
Q6b. What is Belady's Anomaly? Why LRU and Optimal Page Replacement algorithm doesn't suffer from this problem.20247m
Module 5: Memory Management
View this question on its own page →What is Belady's Anomaly? Why LRU and Optimal Page Replacement algorithm doesn't suffer from this problem.
Q7. Compare and contrast Deadlock Prevention and Deadlock Avoidance. Can a system be in a state that is neither deadlock nor safe? If so, give an example. If not, prove that all states are either deadlock or safe.202414m
Module 4: Deadlocks
View this question on its own page →Compare and contrast Deadlock Prevention and Deadlock Avoidance. Can a system be in a state that is neither deadlock nor safe? If so, give an example. If not, prove that all states are either deadlock or safe.
Q8. Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Compare the page faults occur for the following replacement algorithms using 3 frames? Assume, initially all the frames are empty. (i) LRU replacement (ii) FIFO Replacement202414m
Module 5: Memory Management
View this question on its own page →Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
Compare the page faults occur for the following replacement algorithms using 3 frames? Assume, initially all the frames are empty.
(i) LRU replacement
(ii) FIFO ReplacementQ9. Write short notes on any two of the following:- (a) Dispatcher and Scheduler (b) Starvation and Aging (c) Paging and Segmentation (d) Semaphore and Mutex202414m
Module 1-6: Mixed Concepts
View this question on its own page →Write short notes on any two of the following:-
(a) Dispatcher and Scheduler
(b) Starvation and Aging
(c) Paging and Segmentation
(d) Semaphore and Mutex