Register
Filter

Questions by sripo

1 votes
1 answer
32
Feeling depressed and stressed out
I am stressed out sitting at home full time to study,I dont know if I am doing the right thing.Need counselling.Need to complete 4 subjects more.I feel like I have wasted alot of time in my bachelors.
I am stressed out sitting at home full time to study,I dont know if I am doing the right thing.Need counselling.Need to complete 4 subjects more.I feel like I have wasted...
0 votes
1 answer
33
Is the given schedule Recoverable
S=r1(A),w2(A),r3(A),w1(A),w3(A) Is this Schedule Non Recoverable? As there is a dirty read happening at w2(A)->r3(A)
S=r1(A),w2(A),r3(A),w1(A),w3(A)Is this Schedule Non Recoverable? As there is a dirty read happening at w2(A)->r3(A)
0 votes
0 answers
34
Does Dirty Read Imply Non Recoverable Schedule
If I have dirty read which is write-read conflict does it imply that the schedule is non recoverable? Do all anomalies result of conflict result in non recoverable thereby non serializable schedules?
If I have dirty read which is write-read conflict does it imply that the schedule is non recoverable?Do all anomalies result of conflict result in non recoverable thereby...
1 votes
1 answer
36
What is the value of T(n) for the given recurrence relation
T(n)=T(n/2)+2; T(1)=1 when n is power of 2 the correct expression for T(n) is: a) 2(logn+1) b) 2logn c)logn+1 d)2logn+1
T(n)=T(n/2)+2; T(1)=1when n is power of 2 the correct expression for T(n) is:a) 2(logn+1)b) 2lognc)logn+1d)2logn+1
0 votes
0 answers
37
Which colleges accept JEST TCS scores other than IMSc
Which programmes can I get into with my JEST score other than IMSc,can I get into CMI Data Science with my JEST TCS score,which exams can I write for CS in JEST?
Which programmes can I get into with my JEST score other than IMSc,can I get into CMI Data Science with my JEST TCS score,which exams can I write for CS in JEST?
0 votes
0 answers
38
List of MTech Exams after GATE
This can be a duplicate question please give me a link of the exams along with when in the date of registration so that I don't miss the dates.I am aware that TIFR happens before GATE,but other institute exams after gate.
This can be a duplicate question please give me a link of the exams along with when in the date of registration so that I don't miss the dates.I am aware that TIFR happen...
2 votes
1 answer
39
If grammar is not LL(1) then it can never be CLR(1) or LALR(1)?
Can you give an example which is not LL(1) but is CLR(1)
Can you give an example which is not LL(1) but is CLR(1)
0 votes
1 answer
41
How to understand difference between n/2 and log(n) when comes to operations on a binary tree
For a heap containing n elements,smallest element can be found in n/2 operations.I always get confused and think as logn operations.Please help me differentiating between these two times.
For a heap containing n elements,smallest element can be found in n/2 operations.I always get confused and think as logn operations.Please help me differentiating between...
0 votes
1 answer
44
Are these two languages equal?
L1=ab* L2=a(aa)*b(bb)* Are the languages equal if not what relation do they satisfy?
L1=ab*L2=a(aa)*b(bb)*Are the languages equal if not what relation do they satisfy?
1 votes
1 answer
45
What is the minimal DFA for this language (11+111)*, for Σ={0,1}.
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
What is the number of states for the above DFA,please draw NFA,DFA and minimised DFA for the same.Also won't the language not accept epsilon?
0 votes
1 answer
46
Number of sub-strings for a given sub string having repeated symbols
Lets for a a given string aabbbccdd I need to find the number of substrings possible how to go about it? Does the n(n+1)/2 formula work here also?
Lets for a a given string aabbbccddI need to find the number of substrings possible how to go about it? Does the n(n+1)/2 formula work here also?
1 votes
1 answer
47
Runtime Environment Heap Allocation
Does Heap Allocation support both recursion and dynamic memory allocation? Because,a stack can be implemented using dynamic memory allocation.Please correct me. Test Series answer shows only dynamic memory allocation
Does Heap Allocation support both recursion and dynamic memory allocation? Because,a stack can be implemented using dynamic memory allocation.Please correct me.Test Serie...
1 votes
1 answer
48
Are right recursive grammars ambiguous?
Are right recursive grammars ambiguous?
Are right recursive grammars ambiguous?
0 votes
2 answers
49
Is the given grammar CLR(1) or not please explain me if there is a shift reduce conflict
S→(X S→E] S→E) X→E) X→E] E→ϵ Is this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E-> epsilon with lookup symbols ),]
S→(XS→E]S→E)X→E)X→E]E→ϵIs this grammar CLR(1)? The answer says it is but I find a shift reduce conflict for E- epsilon with lookup symbols ),]
0 votes
1 answer
50
Is there shift reduce conflict in this production?
For given production for a LR(1) grammar B->b.C ,$|c here C is non terminal C->c. ,$|c and here c is terminal. $|c are lookup symbols Will there be a shift reduce conflict if a non terminal is visited.Please explain how shift reduce conflict works
For given production for a LR(1) grammarB->b.C ,$|c here C is non terminalC->c. ,$|c and here c is terminal. $|c are lookup symbolsWill there be a shift reduce conflict...
Page: