2025 question paper
Operating System
28 questions
Q1a. Which type of Operating System allows multiple users to access the system simultaneously? (i) Single-user OS (ii) Batch OS (iii) Multi-user OS (iv) Embedded OS20252m
Module 1: Introduction to Operating Systems
View this question on its own page →Which type of Operating System allows multiple users to access the system simultaneously?
(i) Single-user OS
(ii) Batch OS
(iii) Multi-user OS
(iv) Embedded OSQ1b. Which scheduler selects processes from the ready queue and allocates the CPU? (i) Long-term scheduler (ii) Medium-term scheduler (iii) Short-term scheduler (iv) Batch scheduler20252m
Module 2: Processes & Scheduling
View this question on its own page →Which scheduler selects processes from the ready queue and allocates the CPU?
(i) Long-term scheduler
(ii) Medium-term scheduler
(iii) Short-term scheduler
(iv) Batch schedulerQ1c. What is the motive of using a Virtual Machine for an operating system? (i) Increase CPU throughput (ii) Run multiple operating systems on the same hardware (iii) Create databases (iv) Allow multiple threads to execute concurrently within a process20252m
Module 1: Introduction to Operating Systems
View this question on its own page →What is the motive of using a Virtual Machine for an operating system?
(i) Increase CPU throughput
(ii) Run multiple operating systems on the same hardware
(iii) Create databases
(iv) Allow multiple threads to execute concurrently within a processQ1d. Which type of thread is managed directly by the operating system kernel? (i) User-level thread (ii) Kernel-level thread (iii) Single thread (iv) Background thread20252m
Module 2: Processes & Scheduling
View this question on its own page →Which type of thread is managed directly by the operating system kernel?
(i) User-level thread
(ii) Kernel-level thread
(iii) Single thread
(iv) Background threadQ1e. The Dining Philosopher Algorithm is a classic example of which problem? (i) CPU scheduling (ii) Memory fragmentation (iii) Process synchronization and deadlock (iv) File allocation20252m
Module 3: Inter-process Communication
View this question on its own page →The Dining Philosopher Algorithm is a classic example of which problem?
(i) CPU scheduling
(ii) Memory fragmentation
(iii) Process synchronization and deadlock
(iv) File allocationQ1f. Which technique allows the operating system to examine the resource allocation state dynamically to ensure no deadlock occurs? (i) Deadlock detection (ii) Deadlock recovery (iii) Deadlock avoidance (iv) Deadlock ignoring20252m
Module 4: Deadlocks
View this question on its own page →Which technique allows the operating system to examine the resource allocation state dynamically to ensure no deadlock occurs?
(i) Deadlock detection
(ii) Deadlock recovery
(iii) Deadlock avoidance
(iv) Deadlock ignoringQ1g. Which free-space management technique uses a bitmap to indicate free and occupied blocks? (i) Bit Vector (ii) Indexing (iii) Grouping (iv) Linked List20252m
Module 6: I/O & File Management
View this question on its own page →Which free-space management technique uses a bitmap to indicate free and occupied blocks?
(i) Bit Vector
(ii) Indexing
(iii) Grouping
(iv) Linked ListQ1h. Internal fragmentation occurs when (i) Processes are swapped out (ii) Pages are missing (iii) Memory is completely utilized (iv) Unused space exists within an allocated memory partition20252m
Module 5: Memory Management
View this question on its own page →Internal fragmentation occurs when
(i) Processes are swapped out
(ii) Pages are missing
(iii) Memory is completely utilized
(iv) Unused space exists within an allocated memory partitionQ1i. Which page replacement algorithm replaces the page that will not be used for the longest period in the future? (i) Optimal (ii) Second Chance (iii) FIFO (iv) NRU20252m
Module 5: Memory Management
View this question on its own page →Which page replacement algorithm replaces the page that will not be used for the longest period in the future?
(i) Optimal
(ii) Second Chance
(iii) FIFO
(iv) NRUQ1j. Which disk scheduling algorithm services requests in the order they arrive? (i) SCAN (ii) SSTF (iii) FCFS (iv) C-SCAN20252m
Module 6: I/O & File Management
View this question on its own page →Which disk scheduling algorithm services requests in the order they arrive?
(i) SCAN
(ii) SSTF
(iii) FCFS
(iv) C-SCANQ2a. Explain system calls and their importance in Operating Systems. Discuss various categories of system calls.20257m
Module 1: Introduction to Operating Systems
View this question on its own page →Explain system calls and their importance in Operating Systems. Discuss various categories of system calls.
Q2b. Illustrate the concept of Virtual Machines.20257m
Module 1: Introduction to Operating Systems
View this question on its own page →Illustrate the concept of Virtual Machines.
Q3a. What is a Process Control Block? Explain its structure and significance in process management.20257m
Module 2: Processes & Scheduling
View this question on its own page →What is a Process Control Block? Explain its structure and significance in process management.
Q3b. Define threads and explain their various states. Compare user-level threads with kernel-level threads.20257m
Module 2: Processes & Scheduling
View this question on its own page →Define threads and explain their various states. Compare user-level threads with kernel-level threads.
Q4a. Discuss multiprocessor scheduling and real-time scheduling techniques.20257m
Module 2: Processes & Scheduling
View this question on its own page →Discuss multiprocessor scheduling and real-time scheduling techniques.
Q4b. Consider a system with five processes P0 through P4 and four resources type A, B, C and D. Using the Banker's algorithm answer that the system is in a safe state? | Process | Allocation (A B C D) | Max (A B C D) | Available (A B C D) | | :--- | :---: | :---: | :---: | | P0 | 0 0 1 2 | 0 0 1 2 | 1 5 2 0 | | P1 | 1 0 0 0 | 1 7 5 0 | | | P2 | 1 3 5 4 | 2 3 5 6 | | | P3 | 0 6 3 2 | 0 6 5 2 | | | P4 | 0 0 1 4 | 0 6 5 6 | |20257m
Module 4: Deadlocks
View this question on its own page →Consider a system with five processes P0 through P4 and four resources type A, B, C and D. Using the Banker's algorithm answer that the system is in a safe state?
Process Allocation (A B C D) Max (A B C D) Available (A B C D) P0 0 0 1 2 0 0 1 2 1 5 2 0 P1 1 0 0 0 1 7 5 0 P2 1 3 5 4 2 3 5 6 P3 0 6 3 2 0 6 5 2 P4 0 0 1 4 0 6 5 6 Q5a. Explain the structure of a file system. Discuss the role of directories, metadata, and file control blocks in file management.20257m
Module 6: I/O & File Management
View this question on its own page →Explain the structure of a file system. Discuss the role of directories, metadata, and file control blocks in file management.
Q5b. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending request, in FIFO order is: 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, applying Shortest-seek-time-first (SSTF) algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.20257m
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 143, and the previous request was at cylinder 125. The queue of pending request, in FIFO order is:
86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130Starting from the current head position, applying Shortest-seek-time-first (SSTF) algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.
Q6a. Describe the objectives of process scheduling. Explain the roles of long-term, medium-term, and short-term schedulers.20257m
Module 2: Processes & Scheduling
View this question on its own page →Describe the objectives of process scheduling. Explain the roles of long-term, medium-term, and short-term schedulers.
Q6b. Consider the main memory with the capacity of 4 page frames. Assume that the pages of a process are referenced in the order as given below: 1, 3, 4, 4, 3, 2, 1, 7, 5, 6, 4, 2, 1, 2 Which of FIFO or LRU would be better in this case as a page replacement policy? Why?20257m
Module 5: Memory Management
View this question on its own page →Consider the main memory with the capacity of 4 page frames. Assume that the pages of a process are referenced in the order as given below:
1, 3, 4, 4, 3, 2, 1, 7, 5, 6, 4, 2, 1, 2Which of FIFO or LRU would be better in this case as a page replacement policy? Why?
Q7a. Explain the Producer-Consumer problem and discuss how semaphores can be used to solve it.20257m
Module 3: Inter-process Communication
View this question on its own page →Explain the Producer-Consumer problem and discuss how semaphores can be used to solve it.
Q7b. Consider the following set of processes with the length of the CPU burst given in milliseconds: | Process | Burst Time | Priority | | :---: | :---: | :---: | | A | 10 | 3 | | B | 1 | 1 | | C | 2 | 3 | | D | 1 | 4 | | E | 5 | 2 | The processes are assumed to have arrived in order A, B, C, D, E all at time 0. Draw the Gantt charts that illustrate the execution of SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.20257m
Module 2: Processes & Scheduling
View this question on its own page →Consider the following set of processes with the length of the CPU burst given in milliseconds:
Process Burst Time Priority A 10 3 B 1 1 C 2 3 D 1 4 E 5 2 The processes are assumed to have arrived in order A, B, C, D, E all at time 0. Draw the Gantt charts that illustrate the execution of SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.
Q8a. Discuss deadlock recovery techniques. Explain process termination and resource preemption methods used for recovery from deadlock.20257m
Module 4: Deadlocks
View this question on its own page →Discuss deadlock recovery techniques. Explain process termination and resource preemption methods used for recovery from deadlock.
Q8b. Write an algorithm for Readers-Writers Problem solution using Semaphores.20257m
Module 3: Inter-process Communication
View this question on its own page →Write an algorithm for Readers-Writers Problem solution using Semaphores.
Q9a. Write a short note on: Process State transitions20257m
Module 2: Processes & Scheduling
View this question on its own page →Write a short note on:
Process State transitions
Q9b. Write a short note on: Paging and segmentation20257m
Module 5: Memory Management
View this question on its own page →Write a short note on:
Paging and segmentation
Q9c. Write a short note on: Contiguous Memory allocation20257m
Module 5: Memory Management
View this question on its own page →Write a short note on:
Contiguous Memory allocation
Q9d. Write a short note on: Boot-block and Bad blocks20257m
Module 6: I/O & File Management
View this question on its own page →Write a short note on:
Boot-block and Bad blocks