Question 20
For a scenario with 7 philosophers in the dining philosopher’s problem, what is the minimum number of forks necessary to ensure deadlock prevention?
Question 20: For a scenario with 7 philosophers in the dining philoso…
Show answer
Correct answer: 8
Question 20 of 20 in the IIT Madras BS Operating Systems (Operating Systems) End Term paper sat on 1 Sept 2024, in the May 2024 term (IIT M DEGREE FN EXAM QDB1 01 Sep 2024). It carries 2 marks.
More questions from this paper
- Consider the code segment (for xv6) given below. What are the base address and the end address of the RX register?
- If the memory map of the DMA controller starts from the offset 0x30001000 and has an address range of 256 bytes in a 32…
- Consider the following program snippet: When largeBuffer[8] = smallBuffer[0] occurs, the situation is known as _.
- In a cryptographic implementation where memory access patterns depend on the value of a secret key, which type of attac…
- Figure question
- When a process invokes the exec system call, the Process Identifier (PID) remains unchanged.
- State True/false Bob can execute the Program 1.
- Consider a system with 128 MB of physical memory and a 32-bit virtual address space. Given a page size of 8 KB, what wi…
- In the Xv6 OS, What is the correct sequence of tasks as listed below that takes place as part of timer interrupt?\ (i) …
- Consider a system with three processes (P1, P2, and P3) and three resources (R1, R2 and R3). The following Resource All…
- Consider that the below commands are executed in a shell with root ("/") as the current directory. What is the absolute…
- Consider the following functions that are used in the implementation of the Bakery algorithm: The function lock is call…
- Consider the below plots representing the order in which the requests are serviced by different disk scheduling algorit…
- Select all the true statements about hard links.
- Assume Process A is currently running, Process B and Process D are waiting for an I/O operation, and Process C was runn…
- Consider the set of 5 processes whose arrival time and burst time are given below. If the CPU scheduling policy used is…
- Consider a system with four processes, P1, P2, P3, and P4, arriving at different times and needing the following CPU bu…
- Consider a system with four processes, P1, P2, P3, and P4, arriving at different times and needing the following CPU bu…
- Figure question