Each Process Pi, i= 1…….9 is coded as follows repeat P(mutex) {Critical section} V(mutex) foreverThe code for P10 is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment?(A) 1(B) 2(C) 3(D) None of above

Each Process Pi, i= 1…….9 is coded as follows repeat P(mutex) {Cri

1.	Each Process Pi, i= 1…….9 is coded as follows repeat P(mutex) {Critical section} V(mutex) foreverThe code for P10 is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment?(A) 1(B) 2(C) 3(D) None of above
Answer»

Discussion

No Comment Found

Related InterviewSolutions

Consider the following functionFunction F (n, m: integer): integer;begin If (n<=0) or (m<=0) then F:=1 else F:= F(n-1,m) + F(n, m-1); end;Use the recurrence relationto answer the following question.Assume that n, m are positive integers. Write only the answers without any explanation.a. What is the value of F(n,2)?b. What is the value of (n,m)?c. How many recursive calls are made to the function F, including the original call, when evaluating F(n,m).
Let A= (aij) be an n-rowed square matrix and I12 be the matrix obtained by interchanging the first and second rows of the n-rowed Identify matrix. Then AI12 is such that its first(A) row is the same as its second row(B) row is the same as the second row of A(C) column is the same as the second column of A(D) row is all zero
Consider the grammarS→ bSeS→ PQRP→ bPcP→ εQ→ cQdQ→ εR→ dReR→ εwhere S,P,Q,R are non-terminal symbols with S being the start symbol; b,c,d,e are terminal symbols and ‘ε’ is the empty string. This grammar generates strings of the form bi, cj, dk, em for some i, j, k, m ≥ 0.(a). What is the condition on the values of i, j, k, m?(b). Find the smallest string that has two parse trees.
Given√(224)r = (13)rThe value of the radix r is:(A) 10(B) 8(C) 5(D) 6
A micro instruction into be designed to specifya. none or one of the three micro operations of one kind andb. none or upto six micro operations of another kindThe minimum number of bits in the micro-instruction is(A) 9(B) 5(C) 8(D) None of the above
A partial order≤ is defined on the set S= {x, a1, a2,…..an, y} as x < ai for all i and ai≤ y for all i, where n≥1. The number of total orders on the set S which contain the partial order≤ is(A) n!(B) n+2(C) n(D) 1
A D flip-flop is to be connected to an 8085 microprocessor chip as a 1-bit output port with a port address of FF hex. Data bit D3 should be involved in the data transfer from CPU to the flip-flop. The flip-flop should be cleared on power ON.a. Using only one NAND gate (fan in of 10), one NOT gate and one D flip-flop. Draw the required interface logic circuit (only the relevant signals should be shown).b. Write a program to generate a square wave on the output of the flip-flop. ON and OFF periods of the square wave should be 7 bus cycles each.
Consider a logic circuit shown in figure below. The functions f1,f2 and f(in canonical sum of products form in decimal notation) are :f1(w,x,y,z)= ∑ 8,9,10f2(w,x,y,z)= ∑ 7,8,12,13,14,15f(w,x,y,z) = ∑ 8,9The Function f3 isa. ∑9,10b. ∑9c. ∑1,8,9d. ∑8,10,15(A) a(B) b(C) c(D) d
Which one of the following regular expressions over {0,1} denotes the set of all strings not containing 100 as a substring?(A) 0* (1+0)*(B) 0*1010*(C) 0*1*01*(D) 0*(10+1)*
The number of equivalence relations of the set {1,2,3,4} is(A) 15(B) 16(C) 24(D) 4

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment