Testbook Logo
Exams SuperCoaching Test Series Skill Academy
More

Question

Download Solution PDF

To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?

1) Writers are given exclusive access to shared objects

2) Readers are given exclusive access to shared objects

3) Both readers and writers are given exclusive access to shared objects.

Choose the correct answer from the code given below:

This question was previously asked in
UGC NET Computer Science (Paper 2) Dec 2018 Paper
Attempt Online
View all UGC NET Papers >
  1. 1 only
  2. Both 2 and 3
  3. 2 only
  4. 3 only

Answer (Detailed Solution Below)

Option 1 : 1 only
Free Tests
View all Free tests >
Free
UGC NET Paper 1: Held on 21st August 2024 Shift 1
13 K Users
50 Questions 100 Marks 60 Mins
Start Now

Detailed Solution

Download Solution PDF

In Readers-Writers problem, more than one Reader is allowed to read simultaneously but if a Writer is writing then no other writer or any reader can have simultaneous access to that shared object. So, Writers are given exclusive access to shared objects.

Hence option 1 is correct

Download Solution PDF
Latest UGC NET Updates

Last updated on Jun 22, 2025

-> The UGC Net Admit Card has been released on its official website today.

-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.

-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.

-> The exam is conducted bi-annually - in June and December cycles.

-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions. 

-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.

More Critical Section Questions

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 released II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources Which 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 objects 2) Readers are given exclusive access to shared objects 3) 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. P1 P2 P3 : : 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 __________.

More Concurrency and Synchronization Questions

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 I List 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
Crack GATE CSE with
India's Super Teachers
Explore Supercoaching For FREE
Suggested Exams
Exam-Logo
GATE CS

GATE CS Important Links

More Operating Systems Questions

Q1.Which of the following is a benefit of scheduling emails?
Q2.Which of the following Page Replacement Algorithm suffers from the Belady’s anomaly ?
Q3.Consider a system with three frames in memory and following memory references in the working set 2 1 2 3 5 4 1 3 4 2 1 How many page fault will be there if we use second chance page replacement algorithm ?
Q4.Which one of the following cannot be scheduled by the kernel ?
Q5.Consider a system with page size p and average process size m and size of each page table entry is e. What is the amount of space required by page table ? 
Q6.Calculate the average response time for these processes with a nonpreemptive priority Scheduling algorithm? Priority of the process are as follows and consider that all the processes came at zero (0) time. (Note low numbers represent high priority). Process Arrival Time Burst Time P1 5 3 P2 3 1 P3 2 5 P4 3 4 P5 1 2
Q7.When we apply Shortest Job First (SJF) scheduling Policy/algorithm, Process (P2) faces partial starvation and waits for the longer time to execute. Which one of the following algorithms addresses this problem?
Q8.What is the average waiting time for these processes with non-preemptive Shortest Job First (SJF) scheduling Algorithm?
Q9.What is the average turnaround time for these Processes with First Come First Serve (FCFS) scheduling Algorithm?
Q10.Find the average weighted turnaround time for these process using Highest Response Ratio Next (HRN) Algorithm?
Important Links for GATE Exam
Super Coaching
Branch wise Page
Test Series
Previous Year Papers
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
[email protected]
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Our Apps
Follow us on
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Get Free Access Now
Hot Links： teen patti all teen patti noble teen patti win teen patti classic