[Solved] The solution to critical section problem must ensure followi (2024)

Question

View all UPPCL Assistant Engineer Papers >

1. Only Mutual Exclusion and Progress
2. Only Mutual Exclusion and Bounded Waiting
3. Mutual Exclusion, Progress, and Bounded Waiting
4. Only Progress and Bounded Waiting

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Q1. If three threads are trying to share a single object at the same time which condition will arise in the scenario?

Q2. To avoid the race condition, the number of processes that may be simultaneously inside their critical section is

Q3. The solution to critical section problem must ensure following conditions:

Q4. Consider the following policies for preventing deadlock in a system with mutually exclusive resources.I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are releasedII. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbersIII. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbersIV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resourcesWhich of the above policies can be used for preventing deadlock?

Q5. Mutual exclusion problem occurs

Q6. The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently.P1 ( ) { P2 ( ) {C = B – 1;D = 2 * B;B = 2 * C;B = D – 1;}}The number of distinct values that B can possibly take after the execution is __________.

Q7. Suppose P, Q and R are co-operating processes satisfying Mutual Exclusion condition. Then if the process Q is executing in its critical section then

Q8. To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?1) Writers are given exclusive access to shared objects2) Readers are given exclusive access to shared objects3) Both readers and writers are given exclusive access to shared objects.Choose the correct answer from the code given below:

Q9. Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100.P1P2P3::D = D + 20::::D = D - 50::::D = D + 10::The processes are executed on a uniprocessor system running a time-shared operating system. If the minimum and maximum possible values of D after the three processes have completed execution are X and Y respectively, then the value of Y - X is __________.

Q1. Which of the following statements are CORRECT?(A) A process always check state of currently executing process to enter critical schema.(B) Spin locks uses busy waiting.(C) Periodically testing a variable until some value appear is known as busy waiting.(D) Critical region is a part of program, where shared memory is kept.(E) Printer daemon, continuously checks to see if there are any file to be printed.Choose the correct answer from the options given below:

Q2. At a particular time of computation, the value of a counting semaphore is 7. Then 20 p operations and 'x' V operations were completed on this semaphore. If the final value of semaphore is 5. x will be

Q3. In design protocol of critical section problem, each process must ask permission to enter critical section in __________ code; it then executes in the critical section; once it finishes executes in the critical section it enters the__________code. The process then enters the__________code.

Q4. Match List I with List II:List IList II(A)Least frequently used(I)Memory is distributed among processors(B)Critical Section(II)Page replacement policy in cache memory(C)Loosely coupled multiprocessor system(III)Program section that once begin must complete execution before another processor access the same shared resource(D)Distributed operating system organization(IV)O/S routines are distributed among available processors.Choose the correct answer from the options given below:

Q5. A counting semaphore was initialized to 8. Then 12 P (wait) operations and 7 V (signal) operations were completed on this semaphore. The resulting value of semaphore is -

Q6. If three threads are trying to share a single object at the same time which condition will arise in the scenario?

Q7. Which of the following statements is true?

Q8. Which of the following is the solution of the priority inversion problem?

Q9. Inter-process communication

Q10. To avoid the race condition, the number of processes that may be simultaneously inside their critical section is