Register
Filter

Questions by sripo

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...
0 votes
0 answers
51
Available programs in TIFR for CS branch
I have done my B.E I just want to know if TIFR has a MSc or MTech program or they have direct PhD Programs.?
I have done my B.E I just want to know if TIFR has a MSc or MTech program or they have direct PhD Programs.?
0 votes
0 answers
52
Which mode to take preemptive or non preemptive
If the mode for scheduling is not mentioned whether to do preemptive or non preemptive which one should we take when solving Gate questions?
If the mode for scheduling is not mentioned whether to do preemptive or non preemptive which one should we take when solving Gate questions?
0 votes
0 answers
53
Backtracking part of Algo
Is Backtracking Branch and Bound part of Gate syllabus?
Is Backtracking Branch and Bound part of Gate syllabus?
1 votes
0 answers
54
Dfa for no states
What is the difference between a dfa accepting epsilon moves and dfa accepting nothing? I have a dfa which has no states what will be the dfa this is regarding,this question https://gateoverflow.in/8362/gate2015-1-52
What is the difference between a dfa accepting epsilon moves and dfa accepting nothing?I have a dfa which has no states what will be the dfa this is regarding,this questi...
0 votes
0 answers
56
Construct DFA for given Language
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?
For the language which ends with 01 or 11 or 10 or 11 for $\sum$={0,1}* .Is dfa possible for this language?
0 votes
0 answers
60
Concatenation of DCFLs
L1={an bn | n>=0} L2={bn cn | n>=0} What is L1.L2 ? Is it an b2n cn ?
L1={an bn | n>=0}L2={bn cn | n>=0}What is L1.L2 ?Is it an b2n cn ?
Page: