Semaphores, Mutex Locks and Monitors
Curriculum and historical examination lineage for Semaphores, Mutex Locks and Monitors under Unit 2 (Process Management, Threads and Synchronization) of Operating Systems (21CSC202J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
After the completion of DMA transfer, the processor is notified by _____ [1] A. Acknowledgement signal B. Interrupt signal C. WMFC signal D. Control signal
At a particular time of computation the value of a counting semaphore is 10. Then 15 P operations and 17 V operations were completed on this semaphore. The resulting value of the...
Describe the solution using semaphores to solve dinning philosopher problem. [8]
Discuss how wait( ) and signal( ) semaphore operations should be implemented in multiprocessor environments, using test and set instructions. The solution should exhibit minimal...
__________ is a solution to the problem of low-priority processes being blocked indefinitely. (A) Aging (B) Starvation (C) Deadlocks (D) Wait queue [1]
Examinations where questions for Semaphores, Mutex Locks and Monitors have appeared.
Master Semaphores, Mutex Locks and Monitors in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.