2023 question paper
OPERATING SYSTEM
26 questions
Q1a. A computer system has 9 tape drives, with processes competing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is (i) 9 (ii) 7 (iii) 4 (iv) 620232m
Module 4: Deadlocks
View this question on its own page →A computer system has 9 tape drives, with processes competing for them. Each process may need 3 tape drives. The maximum value of n for which the system is guaranteed to be deadlock free is
(i) 9
(ii) 7
(iii) 4
(iv) 6Q1b. Which of the following page replacement algorithms suffers from Belady's anomaly? (i) Optimal replacement (ii) LRU (iii) FIFO (iv) Both (a) and (c)20232m
Module 5: Memory Management
View this question on its own page →Which of the following page replacement algorithms suffers from Belady's anomaly?
(i) Optimal replacement
(ii) LRU
(iii) FIFO
(iv) Both (a) and (c)Q1c. Scheduling a process from ready Queue to CPU is done by (i) Short term scheduler (ii) Midle term scheduler (iii) Long term scheduler (iv) Dispatcher20232m
Module 2: Processes
View this question on its own page →Scheduling a process from ready Queue to CPU is done by
(i) Short term scheduler
(ii) Midle term scheduler
(iii) Long term scheduler
(iv) DispatcherQ1d. The time to move the disk arm to the desired cylinder in hard disk is known as (i) rotational latency (ii) seek time (iii) positional time (iv) disk time20232m
Module 6: File Management
View this question on its own page →The time to move the disk arm to the desired cylinder in hard disk is known as
(i) rotational latency
(ii) seek time
(iii) positional time
(iv) disk timeQ1e. Compaction is used to solve the problem of (i) external fragmentation (ii) internal fragmentation (iii) both (a) and (c) (iv) None of these20232m
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 (a) and (c)
(iv) None of theseQ1f. ______ is a technique of improving the priority of process waiting in queue for CPU allocation. (i) starvation (ii) Ageing (iii) Revocation (iv) Relocation20232m
Module 2: Processes
View this question on its own page →______ is a technique of improving the priority of process waiting in queue for CPU allocation.
(i) starvation
(ii) Ageing
(iii) Revocation
(iv) RelocationQ1g. The CPU utilization when the system is ______ (i) timesharing (ii) thrashing (iii) multiprocessing (iv) None of the above20232m
Module 5: Memory Management
View this question on its own page →The CPU utilization when the system is ______
(i) timesharing
(ii) thrashing
(iii) multiprocessing
(iv) None of the aboveQ1h. When a process waits indefinitely for some resources which are being used by other processes, it is called (i) Starvation (ii) Demand Paging (iii) Segmentation (iv) None of the above20232m
Module 4: Deadlocks
View this question on its own page →When a process waits indefinitely for some resources which are being used by other processes, it is called
(i) Starvation
(ii) Demand Paging
(iii) Segmentation
(iv) None of the aboveQ1i. Fork is used to (i) dispatch a task (ii) create a new job (iii) create a new process (iv) increase the priority of a task20232m
Module 2: Processes
View this question on its own page →Fork is used to
(i) dispatch a task
(ii) create a new job
(iii) create a new process
(iv) increase the priority of a taskQ2a. Explain the concept of a process. With the help of a state transition diagram, discuss the various process states.20237m
Module 2: Processes
View this question on its own page →Explain the concept of a process. With the help of a state transition diagram, discuss the various process states.
Q2b. Describe the differences among short term, medium-term, and long-term scheduling.20237m
Module 2: Processes
View this question on its own page →Describe the differences among short term, medium-term, and long-term scheduling.
Q3a. What are the various allocation policies in variable partition multiprogramming? Explain the differences between internal and external fragmentations.20237m
Module 5: Memory Management
View this question on its own page →What are the various allocation policies in variable partition multiprogramming? Explain the differences between internal and external fragmentations.
Q3b. What do you understand by address binding? Explain the various address binding schemes.20237m
Module 5: Memory Management
View this question on its own page →What do you understand by address binding? Explain the various address binding schemes.
Q4a. What are the differences between user-level threads and kernel-level threads? Under what circumstances is one type better than the other?20235m
Module 2: Processes
View this question on its own page →What are the differences between user-level threads and kernel-level threads? Under what circumstances is one type better than the other?
Q4b. What resources are used when a thread is created? How do they differ from those used when a process is created?20235m
Module 2: Processes
View this question on its own page →What resources are used when a thread is created? How do they differ from those used when a process is created?
Q4c. Describe the actions taken by a kernel to context switch between kernel-level threads.20234m
Module 2: Processes
View this question on its own page →Describe the actions taken by a kernel to context switch between kernel-level threads.
Q5a. What do you understand by deadlock? Discuss the methods to avoid deadlock.20237m
Module 4: Deadlocks
View this question on its own page →What do you understand by deadlock? Discuss the methods to avoid deadlock.
Q5b. State and explain the necessary and sufficient conditions for a deadlock.20237m
Module 4: Deadlocks
View this question on its own page →State and explain the necessary and sufficient conditions for a deadlock.
Q7a. What do you mean by critical section problem. Discuss a solution for critical section problem.20237m
Module 3: Inter-process Communication
View this question on its own page →What do you mean by critical section problem. Discuss a solution for critical section problem.
Q7b. Consider the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults would occur for the following replacement algorithms? Assuming 3 frames are available. Also assume that initially none of pages in main memory. (i) Optimal replacement (ii) FIFO replacement20237m
Module 5: Memory Management
View this question on its own page →Consider the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. How many page faults would occur for the following replacement algorithms? Assuming 3 frames are available. Also assume that initially none of pages in main memory.
(i) Optimal replacement
(ii) FIFO replacementQ8a. Suppose a disk drive has cylinders, numbered 0 to 299. The current head position of the disk is at 90. The queue of pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average cylinder movements for Shortest-Seek Time First (SSTF) algorithm. Mention the disadvantages of SSTF.20237m
Module 6: File Management
View this question on its own page →Suppose a disk drive has cylinders, numbered 0 to 299. The current head position of the disk is at 90. The queue of pending requests, in FIFO order is 36, 79, 15, 120, 199, 270, 89, 170. Calculate the average cylinder movements for Shortest-Seek Time First (SSTF) algorithm. Mention the disadvantages of SSTF.
Q8b. Compare and contrast between linked and indexed disk allocation strategies.20237m
Module 6: File Management
View this question on its own page →Compare and contrast between linked and indexed disk allocation strategies.
Q9a. Write short note on: I-node20237m
Q9b. Write short note on: Segmentation20237m
Q9c. Write short note on: Thrashing20237m
Q9d. Write short note on: Process Control Block20237m