Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
shubham02
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by shubham02
0
votes
1
answer
1
DBMS-Timestammp
Consider the following scenarios: The possible values of P and Q allowed under Thomas Write Rule but not under basic time stamp ordering protocol if TS(T2) > TS(T1) (a) W(B), W(C) (b) W(A), W(A) (c) Both (A) and (B) (d) None of these
Consider the following scenarios:The possible values of P and Q allowed under Thomas Write Rule but not under basic time stamp ordering protocol if TS(T2) TS(T1)(a) W(B)...
419
views
asked
Oct 3, 2018
0
votes
0
answers
2
#self Doubt
Consider the below SDT: →+{(+)} → {(a)} What is/are the output(s) for the input string ++? (i) a+a+a (ii) aa+a+ (iii) aaa++ (iv) +a+aa (a) Only (i) (b) Only (ii) and (iii) (c) Only (ii) and (iv) (d) All Solution: Option (b) how 3 can be generated
Consider the below SDT:→+{(+)}→ {(a)}What is/are the output(s) for the input string ++?(i) a+a+a(ii) aa+a+(iii) aaa++(iv) +a+aa(a) Only (i) (b) Only (ii) and (iii) (c...
109
views
asked
Aug 23, 2018
0
votes
0
answers
3
#self doubt
1. Consider the below SDT: E-> E+E {print(+)} E->a {print(a)} What is/are the output(s) for the input string a+a+a ? (i) a+a+a (ii) aa+a+ (iii) aaa++ (iv) +a+aa (a) Only (i) (b) Only (ii) and (iii) (c) Only (ii) and (iv) (d) All Solution: Option (b) How iii can be generated
1. Consider the below SDT: E- E+E {print(+)}E->a {print(a)}What is/are the output(s) for the input string a+a+a ?(i) a+a+a(ii) aa+a+(iii) aaa++(iv) +a+aa(a) Only (i)(b) O...
828
views
asked
Aug 23, 2018
Compiler Design
syntax-directed-translation
+
–
0
votes
1
answer
4
TOC Self doubt
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true? S1: Language L is regular. S2: Complement of L is CFL. S3: Complement of L is CSL. S4: Reversal of L is CFL. (a) Only S1 (b) Only S2 and S4 (c) Only S1 and S3 (d) All of these which is the answer and why..???
Consider the following language L = {w ∈ (a+b)* | w has atleast as many occurrences of (bba)’s as (abb)’s}. Which of the following statements is/are true? S1: Langu...
162
views
asked
Aug 22, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register