Back to the 2024 paper
Similar questions
Operating SystemTo avoid race condition the maximum number of processes that may simultaneously be inside the critical section is: (i) No Limit (ii) Two (iii) Three (iv) One20232mOperating SystemIn 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 wins20242mOperating SystemThe Dining Philosopher Algorithm is a classic example of which problem? (i) CPU scheduling (ii) Memory fragmentation (iii) Process synchronization and deadlock (iv) File allocation20252mOPERATING SYSTEMWhich of the following conditions is required for deadlock to be possible? (i) Mutual exclusion (ii) A process may hold allocated resources while awaiting assignment of other resources (iii) No resource can be forcibly removed from a process holding it (iv) All of the above20192m
PreviousIn 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 orderNextWhich of the following is a valid free-space management technique in file systems? (i) Bit Vector (ii) File Mapping (iii) Page Swapping (iv) Disk Fragmentation
Budget AppAndroid App
Pocketly on Android
Log daily food, travel, and hostel expenses instantly. Set monthly spending limits and see where your money goes without complex spreadsheets.