2 votes
1
Are regular languages closed under intersection?
1 votes
2
Which reference book you guys use for Compiler Design?What are the research prospect in this domain?
0 votes
3
i wanted to ask that i have all the material for gate. But the question bank which i have(apart from the previous years) does not have answer key. Is it okay to solve que...
0 votes
4
ReguralCFLCSLRecursive
0 votes
5
What is the exact definition of full and complete binary tree? And what is the relation between them.
0 votes
6
where can i get the collection of previous year aptitude questions of all branches to practice?is there any resource available?
1 votes
7
Please suggest me in briefly for revision .How to we test regular,dcfl,cfl,recursive and recursive enumeranle.Eg say if we can find the pattern it's regular.Please help...
0 votes
8
Hey..I am B.E CSE passed out student 2018 from University of Pune ..I have aggregate 54.60 %.. Should I prepare for gate 2020 or not?In this percentage , should I get iit...
1 votes
9
can we have a turing machine which has only one state ?orthe minimum number of state for a turing machine is 2?
0 votes
10
Let S be a binary semaphore variable and value of S = 0 what will be the value of S when followingoperations are executed on semaphore S ________. ...
1 votes
11
What is the difference between regular intersection and intersection?(I found out that CFL is closed under regular intersection but not under intersection)Thanks!
0 votes
12
Do i have to study the conversation of pda to Cfg or cfg to pda? Is this an important concept with relevance to gate? I know how to individually make them though.
1 votes
13
int main(){int a = 10;fun(a);}void fun(int a){printf(“%d”,a);}Which phase of the compiler will raise an error?Lexical syntaxsemanticsnone of the above
2 votes
14
True/FalseSJF and SRTF both suffer from Convoy effect.please tell reason.
0 votes
15
How many tokens in thisa>>=1;and a! , Will >>= and a! be treated as a single token ?
1 votes
16
consider the language L= {$x^{l}y^{m}z^{n}$|(l+m+n) is divisible by 5}which of the following is correct?L is recursiveCSLCFLregular
0 votes
18
In a demand paging system page fault rate 0.60 and page fault service time 8 milliseconds, memory access time 200 nano seconds. Find out effective access time in nano sec...
0 votes
19
Is straight merge sort in gate syllabus?? If yes, where to study from?