Operating Systems Exam 2 Questions with Correct Answers Latest Update 2025/2026

Operating Systems Exam 2 Questions with Correct Answers Latest Update 2025/2026 Assume count is a variable name, which of the following operations is atomic? - Answers D. none of the above Which of the following is true for race condition? - Answers - Race condition occurs where several processes access and manipulate the same data concurrently - When race condition occurs, the outcome of the execution depends on the particular order in which the access takes place Which of the following actions should be performed among cooperating processes? - Answers C) both of the above In _________, the process may be changing common variables, updating a table, writing a file, and so on. - Answers Critical section In _________, the process requests permission to access and modify variables shared with others. - Answers Entry Section Which of the following critical-section problem's requirements ensures only one process is active in its critical section at a time? - Answers mutual exclusion Which of the following critical-section problem's requirements ensures programs will cooperatively determine what process will next enter its critical section? - Answers progress Which of the following critical-section problem's requirements limits the amount of time a program will wait before it can enter its critical section? - Answers Progress Which of the following is true regarding the requirements for the solutions to critical-section problem? - Answers bounded waiting implies progress Which of the following is true for the solutions to critical-section problems? - Answers Bounded waiting implies progress, and progress implies no deadlock Which of the following is NOT true for Peterson's solution? - Answers Peterson's solution works for synchronization among more than two processes Which of the following variables are shared between the processes in Peterson's solution? - Answers both of the above Which of the following indicates that Pi can enter the critical section in Peterson's solution? - Answers flag[j] == false or turn == i Which of the following is a software-based solution to the critical-section problem? - Answers Peterson's solution Which of the following solutions needs hardware support for the critical section problem? - Answers All of the above Which of the following is not true about test_and_set instruction? - Answers Returns the new value of passed parameter Which of the following is not true about compare_and_swap instruction? - Answers It is executed atomicallyN) Returns the original value of passed parameter*D) Set the new value of passed parameter to "TRUE"E) Set the variable "value" the value of the passed parameter "new_value" but only if "value" =="expected" Assume the binary variable lock is initialized to be 0, which of the following can be an implementation of the entry section to solve the critical-section problem? - Answers both of statement 1 and 2 Which of the following regarding mutex lock is NOT true? - Answers mutex lock is a hardware solution to critical-section problem When mutex lock is implemented as a binary semaphore, what should its value be initialized to be? - Answers 0 The counting semaphore is initialized to ___________. - Answers the number of resources available Which of the following is NOT true regarding semaphore implementation? - Answers A process that is suspended, waiting on the semaphore, should be restarted when some other process executes a signal() operation. What is the correct order of operations for protecting a critical section using a binary semaphore? - Answers wait() followed by signal() Which of the following statements is true? - Answers Spinlocks can be used to prevent busy waiting in the implementation of semaphore. Which of the following is NOT true? - Answers Since semaphore and mutex lock are tools for synchronization, process that have used semaphores or mutex locks should not cause deadlocks Which of the following is NOT true regarding conditional variable, e.g. x? - Answers ()means that the process invoking this operation is suspended until another process invokes l() Which of the following may cause a liveness failure? - Answers all of the options Which of the following is true? - Answers Deadlock doesn't imply starvation; Under which of the following contention loads does traditional synchronization become faster than CAS-based synchronization? - Answers high contention Which of the following are efforts to towards developing scalable, efficient tools that address the demands of concurrent programming? - Answers all of the options Race conditions can result in corrupted values of shared data. - Answers Bounded waiting implies progress, and progress implies mutual exclusion. - Answers True The preemptive kernel is more suitable for real-time programming than non-preemptive kernel. - Answers True The preemptive kernel may be more responsive than non-preemptive kernel. - Answers True Peterson's solution works on modern computer architectures - Answers False A mutex lock is released immediately after entering a critical section. - Answers False Semaphores and mutex locks both provide mutual exclusion. - Answers True Spinlocks are not appropriate for single-processor systems. - Answers True Mutex lock variable is binary. - Answers True Semaphore implementation overcomes the busy waiting problem - Answers True