Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by mehul vaidya
0
votes
0
answers
1
Doubt Related to Gate2005-83a
https://gateoverflow.in/1405/gate2005-83a In above question can some one explain how Follow of E -→ E+E & E--→ E * E calculated I am attaching image for reference.
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.
218
views
asked
Mar 21, 2019
0
votes
1
answer
2
For All & There Exist property
is For All V is distributive on AND operator? ----1 is ‘’there exist’’ is distributive over OR operator? ----2 I have example in which this is true , but is true in general? so logically checking without using any property above four statements are correct. But is 1 and 2 always correct?
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 ...
2.3k
views
asked
Feb 14, 2019
0
votes
0
answers
3
Doubt
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-doubt but is it always two?
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...
387
views
asked
Feb 8, 2019
0
votes
1
answer
4
Madeeasy
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 a Deterministic Turing Machine M such that both P and M accept the same language. III. Given a ... sure if turing machine will halt or not? or because whatever language accepted by TM is not CFG? as CFG is subset of TM.
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...
268
views
asked
Feb 1, 2019
0
votes
0
answers
5
Madeeasy
Please someone help me to clear doubt in CLR and LALR Consider the following grammar: S -> Bb I cAb I d B -→ ablc A -> e Which of the following is correct about the above grammar? Answer given is It is LALR(1) and CLR(1) solution is as follow. my ... have reduce as well shift move in same row but different column. I am seeing this type of example first time that's why i am in doubt
Please someone help me to clear doubt in CLR and LALRConsider the following grammar: S — Bb I cAb I d B -→ ablc ...
294
views
asked
Feb 1, 2019
0
votes
0
answers
6
The number of ways in which we can place 3 white pawns and 3 black pawns on a 3 . 3 Chessboard is equal to
The number of ways in which we can place 3 white pawns and 3 black pawns on a 3 . 3 Chessboard is equal to
638
views
asked
Jan 29, 2019
0
votes
1
answer
7
Can 2PL have Read Write conflict?
Can 2PL have Read Write conflict? Consider following schedule with two transaction T1 T2 L_S(A) Read(A) L_X(A)---------------------------is T2 allowed to acquire exclusive lock on A? Write(A) L_S(A) ----------------------------------------------T1 already has this lock Read(A) Commit RollBack Will this schedule allowed by 2PL
Can 2PL have Read Write conflict?Consider following schedule with two transactionT1 T2L_S(A) Read(A) L_X(A) -is T2 allowe...
898
views
asked
Jan 29, 2019
1
votes
0
answers
8
Madeeasy
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 regards to the connectivity of X and X', where X' denotes the complement of ... such questions. So the conclusion is "Every sell complementary graph is cormected". So option (d) is the correct answer.
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...
459
views
asked
Jan 29, 2019
0
votes
2
answers
9
MadeEasy Test Series
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?
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?
516
views
asked
Jan 28, 2019
0
votes
0
answers
10
Is there any example of schedule which is Strict but not serializable
I have gone through link https://stackoverflow.com/questions/40859477/is-a-strict-schedule-always-serializable But i don’t think example given there is correct.I don’t think it is strict schedule as T2 is reading x which is written by T1 , even before T1 commits. Hence is any other example which is strict but not serializable?
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...
330
views
asked
Jan 22, 2019
Databases
databases
conflict-serializable
+
–
0
votes
0
answers
11
Doubt in 2PL
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 after it has unlocked some item. It can definitely not use Exclusive lock .
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...
146
views
asked
Jan 21, 2019
1
votes
1
answer
12
Madeeasy
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 i understood is for schedule to be serial. r1(A) & w1(B) must be together. Similarly r2( ... ) must be last one to write B. But we can order T1, T2 &T3 in any order. 3! =6 So I am getting 6 as answer , but not 5
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...
790
views
asked
Jan 21, 2019
0
votes
0
answers
13
Doubt in Set associative mapping
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?show=230067 but not totally sure about it.
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...
220
views
asked
Jan 20, 2019
1
votes
0
answers
14
madeeasy
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 not error free but cannot damage parity bit and parity bits has been inserted from left ... respective positions. What was the original value Host A transmitted in hexadecimal, (Assume that not more than 1 bit is in error.)
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...
882
views
asked
Jan 18, 2019
1
votes
1
answer
15
Madeeasy
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 other pair of element of that array. Which of the following represent worst case time ... difference. Also do elements in pair need to be adjutant to each other? It will really helpful if explained with small example
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...
426
views
asked
Jan 17, 2019
0
votes
0
answers
16
Doubt in Regular expression
how to prove $(x^{*}y)^{*}x^{*}y = x^{*}(yx^{*})^{*}y$ I have already checked https://gateoverflow.in/290653/me_test_series?show=290690 It contains extra y. x*y(yx*)*y and I am not able to solve this , please help
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 ...
272
views
asked
Jan 16, 2019
0
votes
0
answers
17
madeeasy
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 is 4? I think answer is wrong For non pipe line total time = Total number of ... * time for each cycle calculation For pipeline version total time = Total number of instruction * max(3,8,5,6,4) So No role of CPI
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 ...
337
views
asked
Jan 12, 2019
CO and Architecture
co-and-architecture
pipelining
speedup
+
–
0
votes
0
answers
18
MadeEasy Full Length Test 2018: CO & Architecture - Instruction Execution
A particular parallel program computation requires 100 seconds when executed on a single processor. If 40 percent of this computation is “ inherently sequential ”, then what are the theoretically best elapsed times for this program running with 2 and 4 processors, respectively ?
A particular parallel program computation requires 100 seconds when executed on a single processor. If 40 percent of this computation is “ inherently sequential ”, th...
704
views
asked
Jan 12, 2019
CO and Architecture
co-and-architecture
instruction-execution
made-easy-test-series
+
–
0
votes
0
answers
19
Madeeasy
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}
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}
146
views
asked
Jan 12, 2019
1
votes
0
answers
20
Made Easy
I think answer is 0 , given answer is 3
I think answer is 0 , given answer is 3
251
views
asked
Jan 11, 2019
Page:
1
2
3
4
5
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
