228
views
0 answers
0 votes
https://gateoverflow.in/1405/gate2005-83aIn above question can some one explain how Follow ofE -→ E+E & E → E * E calculatedI am attaching image for reference.
2.3k
views
1 answers
0 votes
is For All V is distributive on AND operator? 1is ‘’there exist’’ is distributive over OR operator? 2I have example in which this is true , but is true in ...
397
views
0 answers
0 votes
if a boolean function having cyclic prime implicant k-map then does function always has two prime implicant?i have seen https://gateoverflow.in/173362/self-doubtbut is it...
275
views
1 answers
0 votes
Consider the following problems regarding decidability.I. Given a Turing Machine M, whether L(M) is context free.II. Given a Non-deterministic PDA P, whether there exists...
312
views
0 answers
0 votes
Please someone help me to clear doubt in CLR and LALRConsider the following grammar: S — Bb I cAb I d B -→ ablc ...
656
views
0 answers
0 votes
The number of ways in which we can place 3 white pawns and 3 black pawns on a 3 . 3 Chessboard is equal to
909
views
1 answers
0 votes
Can 2PL have Read Write conflict?Consider following schedule with two transactionT1 T2L_S(A) Read(A) L_X(A) -is T2 allowe...
470
views
0 answers
1 votes
A graph G is called self complementary iff G is isomorphic to its complement. Let X be a self complementary graph. Which of the following is a viable possibility with reg...
523
views
2 answers
0 votes
What is the number of seven digit integers possible with sum of the digits equal to 11 and formed by using the digits 1, 2 and 3 only?
343
views
0 answers
0 votes
I have gone through link https://stackoverflow.com/questions/40859477/is-a-strict-schedule-always-serializableBut i don’t think example given there is correct.I don’t...
154
views
0 answers
0 votes
Do we consider Shared lock for deciding whether transaction in given schedule following 2PL or not?or in simple words can transaction which follows 2PL use Shared lock af...
827
views
1 answers
1 votes
S : r1(A), r2(A), r3(A), r4(A), w1(B), w2(B), w3(B), w4(B) The number of serial schedules equal to schedule(S) but not conflict equal to schedule(S)answer given is 5.What...
224
views
0 answers
0 votes
Doubling the associativity doubles the number of tags in the cache. Is this statement true or false . I have seen answer at https://gateoverflow.in/227782/cache-memory?sh...
894
views
0 answers
1 votes
Host A transmits 12-bit Hamming code whose hexadecimal value is OxE5F arrives to Host B who is at the receiver end. The medium through the code has been transmitted is no...
432
views
1 answers
1 votes
Consider a procedure find ( ) which take array of n integers as input and produce pair of elements of array whose difference is not greater than the difference of any oth...
280
views
0 answers
0 votes
how to prove $(x^{*}y)^{*}x^{*}y = x^{*}(yx^{*})^{*}y$I have already checked https://gateoverflow.in/290653/me_test_series?show=290690It contains extra y.x*y(yx*)*yand I ...
359
views
0 answers
0 votes
Consider a 5 stage pipeline with IF , ID, EX, WB and MA having latencies (in ms) 3,8,5,6,4. What is average CPI of non pipeline CPU when speed up achieved by to pipeline ...
735
views
0 answers
0 votes
A particular parallel program computation requires 100 seconds when executed on a single processor. If 40 percent of this computation is “ inherently sequential ”, th...
150
views
0 answers
0 votes
I don’t understand question itself , I understood that because L = {<M>| M is TM that halts on all input , it is decidable , i don’t understood anything else}
260
views
0 answers
1 votes
I think answer is 0 , given answer is 3