2024 question paper
Operating System
26 questions
Q1a. Which of the following is an advantage of using threads? (i) Increased hardware costs (ii) Lower throughput (iii) Efficient utilization of CPU resources (iv) Increased memory consumption20242m
Module 2: Processes & Scheduling
View this question on its own page →Which of the following is an advantage of using threads?
(i) Increased hardware costs
(ii) Lower throughput
(iii) Efficient utilization of CPU resources
(iv) Increased memory consumptionQ1b. Under direct communication, each process that wants to communicate must explicitly name the recipient or sender of the communication. This mechanism is known as ______ (i) Naming (ii) Message Passing (iii) Mailboxes (iv) Chatting20242m
Module 3: Inter-process Communication
View this question on its own page →Under direct communication, each process that wants to communicate must explicitly name the recipient or sender of the communication. This mechanism is known as ______
(i) Naming
(ii) Message Passing
(iii) Mailboxes
(iv) ChattingQ1c. A variety of disk-organization techniques, collectively called RAIDs, are commonly used to address the performance and reliability issues. RAIDs stand for? (i) Reduced array of independent disks (ii) Redundant array of individual disks (iii) Reduced array of individual disks (iv) Redundant array of independent disks20242m
Module 6: I/O & File Management
View this question on its own page →A variety of disk-organization techniques, collectively called RAIDs, are commonly used to address the performance and reliability issues. RAIDs stand for?
(i) Reduced array of independent disks
(ii) Redundant array of individual disks
(iii) Reduced array of individual disks
(iv) Redundant array of independent disksQ1d. What does a virtual machine do? (i) Manages only hardware devices (ii) Replaces the operating system (iii) Acts as a real machine but is implemented in software (iv) Removes the need for file systems20242m
Module 1: Introduction to Operating Systems
View this question on its own page →What does a virtual machine do?
(i) Manages only hardware devices
(ii) Replaces the operating system
(iii) Acts as a real machine but is implemented in software
(iv) Removes the need for file systemsQ1e. Which of the following mechanisms is NOT typically used to achieve mutual exclusion? (i) Strict alternation (ii) Event counters (iii) Message passing (iv) Virtual memory20242m
Module 3: Inter-process Communication
View this question on its own page →Which of the following mechanisms is NOT typically used to achieve mutual exclusion?
(i) Strict alternation
(ii) Event counters
(iii) Message passing
(iv) Virtual memoryQ1f. Which of the following is a potential result of bad blocks on a disk? (i) Faster access time (ii) Increased storage capacity (iii) Data loss or corruption (iv) Improved disk scheduling20242m
Module 6: I/O & File Management
View this question on its own page →Which of the following is a potential result of bad blocks on a disk?
(i) Faster access time
(ii) Increased storage capacity
(iii) Data loss or corruption
(iv) Improved disk schedulingQ1g. In demand paging, pages are: (i) Loaded only when they are required during execution (ii) Loaded all at once before execution begins (iii) Never removed from main memory (iv) Loaded in random order20242m
Module 5: Memory Management
View this question on its own page →In demand paging, pages are:
(i) Loaded only when they are required during execution
(ii) Loaded all at once before execution begins
(iii) Never removed from main memory
(iv) Loaded in random orderQ1h. What is the main problem that the "Critical Section" concept aims to solve in concurrent programming? (i) Memory overflow (ii) Infinite loop termination (iii) Race condition between processes (iv) Lack of CPU resources20242m
Module 3: Inter-process Communication
View this question on its own page →What is the main problem that the "Critical Section" concept aims to solve in concurrent programming?
(i) Memory overflow
(ii) Infinite loop termination
(iii) Race condition between processes
(iv) Lack of CPU resourcesQ1i. Which of the following is a valid free-space management technique in file systems? (i) Bit Vector (ii) File Mapping (iii) Page Swapping (iv) Disk Fragmentation20242m
Module 6: I/O & File Management
View this question on its own page →Which of the following is a valid free-space management technique in file systems?
(i) Bit Vector
(ii) File Mapping
(iii) Page Swapping
(iv) Disk FragmentationQ1j. In Peterson's solution for two processes, which condition ensures mutual exclusion? (i) Both processes wait infinitely (ii) Only one process enters the critical section at a time (iii) Both processes enter the critical section together (iv) The process with a higher ID always wins20242m
Module 3: Inter-process Communication
View this question on its own page →In Peterson's solution for two processes, which condition ensures mutual exclusion?
(i) Both processes wait infinitely
(ii) Only one process enters the critical section at a time
(iii) Both processes enter the critical section together
(iv) The process with a higher ID always winsQ2a. What do you understand by the term Process in Operating System? Contrast the types of Interprocess Communication models.20247m
Module 2: Processes & Scheduling
View this question on its own page →What do you understand by the term Process in Operating System? Contrast the types of Interprocess Communication models.
Q2b. What are the two differences between user-level thread and kernel level thread? Under what circumstance is one type better than the other?20247m
Module 2: Processes & Scheduling
View this question on its own page →What are the two differences between user-level thread and kernel level thread? Under what circumstance is one type better than the other?
Q3a. Describe the fundamental role of "Process Scheduling" in a multiprogramming operating system. Identify and explain at least three scheduling criteria.20247m
Module 2: Processes & Scheduling
View this question on its own page →Describe the fundamental role of "Process Scheduling" in a multiprogramming operating system. Identify and explain at least three scheduling criteria.
Q3b. 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 FCFS and SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.20247m
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 FCFS and SJF scheduling algorithm. Show which algorithm results in the minimum average waiting time.Q4a. 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.
Q4b. 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.
Q5a. Explain the core principle behind Deadlock Avoidance. Draw a Resource-allocation graph with a cycle but no deadlock.20247m
Module 4: Deadlocks
View this question on its own page →Explain the core principle behind Deadlock Avoidance. Draw a Resource-allocation graph with a cycle but no deadlock.
Q5b. 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? | | Allocation | Max | Available | | :--- | :--- | :--- | :--- | | | A B C D | A B C D | 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 | |20247m
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?
Allocation Max Available A B C D A B C D 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 Q6a. What is Semaphore? Explain with algorithm the Dining-Philosophers Solution using Monitors.20247m
Module 3: Inter-process Communication
View this question on its own page →What is Semaphore? Explain with algorithm the Dining-Philosophers Solution using Monitors.
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.
Q7a. What is Thrashing? When does it occur? How can one avoid it?20247m
Module 5: Memory Management
View this question on its own page →What is Thrashing? When does it occur? How can one avoid it?
Q7b. Consider the main memory with the capacity of 4 page frames. Assume that the page of 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?20247m
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 page of 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?Q8a. Explain the Address Translation mechanism in Paging. Why is the page size normally some power of two?20247m
Module 5: Memory Management
View this question on its own page →Explain the Address Translation mechanism in Paging. Why is the page size normally some power of two?
Q8b. Given five memory partition of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB(in order), how would the first-fit and best-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory?20247m
Module 5: Memory Management
View this question on its own page →Given five memory partition of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB(in order), how would the first-fit and best-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory?
Q9a. Compare and contrast between linked and indexed disk allocation strategies.20247m
Module 6: I/O & File Management
View this question on its own page →Compare and contrast between linked and indexed disk allocation strategies.
Q9b. 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 algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.20247m
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, 130
Starting from the current head position, applying Shortest-seek-time-first algorithm find what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests.