In the following incomplete code for readers-writers problem, two binary semaphores mutex and wrt are used to obtain synchronization. wait (wrt) writing is performed signal (wrt) wait (mutex) readcount = readcount + 1 if readcount = 1 then S1 S2 reading is performed S3 readcount = readcount − 1 if readcount = 0 then S4 signal (mutex) The value of S1, S2, S3, S4, (in that order) are _____________
Wait (wrt), Signal (mutex), Wait (mutex), Signal (wrt)
In the first readers–writers solution, wrt gives writers exclusive access to the shared data and mutex protects the shared counter readcount. Writers simply do wait(wrt), write, signal(wrt). Readers coordinate so that the first reader locks writers out and the last reader lets them back in.
Step 1 — S1: after incrementing readcount under mutex, the first reader (readcount = 1) must block writers, so S1 is wait(wrt).
Step 2 — S2: before reading, the reader releases mutex so other readers can enter concurrently, so S2 is signal(mutex).
Step 3 — S3: after reading, the reader must lock the counter again before decrementing it, so S3 is wait(mutex).
Step 4 — S4: when the last reader leaves (readcount = 0) writers may proceed, so S4 is signal(wrt); the final signal(mutex) then releases the counter.
Any sequence that begins with a signal on mutex would release a semaphore that the reader does not yet hold at that point, and a sequence ending in wait(wrt) would leave writers blocked forever, so the other orders break mutual exclusion or cause starvation of writers.
Wait (wrt), Signal (mutex), Wait (mutex), Signal (wrt) option is correct.
Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :
Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?
A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?
Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?
The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?
A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included. How should selection be made ?
Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?
Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?
Identify an appropriate operation sequence with respect to execution of a machine level language instruction.
The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .
.................... is a client server application that identifies each host on the internet with a unique user-friendly name.
Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.
(i) Kernel
(ii) Interface
(iii) Nucleus
(iv) Compiler
Codes:
Which of the following are referred to as low level language?
(i) Machine language
(ii) Assembly language
(iii) High level language
(iv) Natural language
Codes:
Match the following:
| List I | List II |
| (a) New York Public Library | (i) Shelv AR |
| (b) Miami University Augmented Research Group | (ii) Smart library |
| (c) Oula University Library | (iii) Wolf Walk |
| (d) North Carolina State University | (iv) Find the future |
Codes:
Which part of the QR code represents the encoded data?