1
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\t... 2 answers 2 Which of the following statements is/are$\text{TRUE}$with respect to deadlocks? Circular wait is a necessary condition for the formation of deadlock. In a system where ... 2 answers 3 Which one of the following statements is$\text{FALSE}?$The$\text{TLB}$performs an associative search in parallel on all its valid entries using page number of incomin... 1 answer 4 Consider four processes$\text{P, Q, R,}$and$\text{S}$scheduled on a$\text{CPU}$as per round robin algorithm with a time quantum of$4\text{ units.}$The processes a... 1 answer 5 Consider two files systems$\text{A}$and$\text{B}$, that use contiguous allocation and linked allocation, respectively. A file of size$100$blocks is already stored in... 3 answers 6 Consider a demand paging system with four page frames (initially empty) and$\text{LRU}$page replacement policy. For the following page reference string$$7, 2, 7, 3, 2,... 2 answers 7 Which of the following statement(s) is/are correct in the context of$\text{CPU}$scheduling? Turnaround time includes waiting time The goal is to only maximize$\text{CP...
​​​​​​Consider the following multi-threaded code segment (in a mix of C and pseudo-code), invoked by two processes $P_1$ and $P_2$, and each of the processes ...
Consider a three-level page table to translate a $39-$bit virtual address to a physical address as shown below: The page size is $\text{4 KB} \;(1\text{KB}=2^{10}$ bytes$... 3 answers 11 In the context of operating systems, which of the following statements is/are correct with respect to paging? Paging helps solve the issue of external fragmentation Page ... 3 answers 12 Which of the following standard$C$library functions will always invoke a system call when executed from a single-threaded process in a$\text{UNIX/Linux}$operating sys... 1 answer 13 Consider a linear list based directory implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file meta... 6 answers 14 Three processes arrive at time zero with$\text{CPU}$bursts of$16,\;20$and$10$milliseconds. If the scheduler has prior knowledge about the length of the$\text{CPU}$... 3 answers 15 Consider the following pseudocode, where$\textsf{S}$is a semaphore initialized to$5$in line$\#2$and$\textsf{counter}$is a shared variable initialized to$0$in li... 4 answers 16 Consider allocation of memory to a new process. Assume that none of the existing holes in the memory will exactly fit the process’s memory requirement. Hence, a new hol... 6 answers 17 Consider the following statements about process state transitions for a system using preemptive scheduling. A running process can move to ready state. A ready process can... 3 answers 18 Each of a set of$n$processes executes the following code using two semaphores$a$and$b$initialized to$1$and$0$, respectively. Assume that$\text{count}$is a shar... 1 answer 19 Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time.$(P, 15...
Consider the following set of processes, assumed to have arrived at time $0$. Consider the CPU scheduling algorithms Shortest Job First (SJF) and Round Robin (RR). For RR...