GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Recent activity by learner_geek
User learner_geek
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User learner_geek
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
#TOC #Peterlinz
For the nfa , find δ*(q0, 1010) and δ* (q1,00). ?
commented
5 days
ago
in
Theory of Computation

28
views
nfa
theoryofcomputation
finiteautomata
1
answer
2
PARSER
Is this statement true: If Grammar is unambiguous must be LL(1) if not LL(1) it does not mean ambiguous.
commented
Aug 16
in
Compiler Design

27
views
compilerdesign
grammar
parsing
0
answers
3
Doubt in CD
In bottom up parsing , if the same entry has both SR or RR moves then what is the problem? Why is it called a confict ? Why cant we just leave it like that? and Why is it not LR(0)?
commented
Aug 16
in
Compiler Design

17
views
compilerdesign
lrparser
0
answers
4
finite automata , toc
construct a DFA over {a,b} such that in each string,no of a's and b's are 2 ?
commented
Aug 16
in
Theory of Computation

31
views
dfa
theoryofcomputation
1
answer
5
Toc Basics
Complement of (0+1)*1 ?? my answer is (0+11*0)* given answer is (1*0)* please give detail explanation!
commented
Aug 15
in
Theory of Computation

38
views
theoryofcomputation
finiteautomata
regularexpressions
1
answer
6
TOC BaSiCs
Please explain:
answer selected
Aug 15
in
Theory of Computation

23
views
theoryofcomputation
regularexpressions
finiteautomata
7
answers
7
GATE 2016143
Consider the transition diagram of a PDA given below with input alphabet $\Sigma=\{a,b\}$ and stack alphabet $\Gamma = \{X,Z\}$. $Z$ is the initial stack symbol. Let $L$ denote the language accepted by the PDA Which one of the following is TRUE? $L =\{a ... input $L =\{a^n\mid n \geq0 \} \cup \{a^nb^n \mid n \geq 0\}$ and is deterministic contextfree
commented
Aug 15
in
Theory of Computation

2.5k
views
gate20161
theoryofcomputation
pushdownautomata
normal
1
answer
8
DECIDABILITY
Is complement of language same type or not decidable by CFL and recursive language or not??? Grammar is ambiguous or not? Grammar in regular/CFL/rel decidable or not?
asked
Aug 15
in
Theory of Computation

20
views
decidability
theoryofcomputation
turingmachine
recursiveandrecursivelyenumerablelanguages
contextfreelanguage
badquestion
1
answer
9
BASIC QUESTION TOC
CAN ANYONE EXPLAIN IN SIMPER MANNER GIVEN ANSWER IS A. HOW??? if we take input 0 then ?? if we take input 1 then ?? if we take input 10 then?? i have confusion as which is present input and previous bit??? The Finite ... B) Outputs 01 whenever the input sequence contains 11. (C) Outputs 00 whenever the input sequence contains 10. (D) None of these
commented
Aug 14
in
Theory of Computation

18
views
theoryofcomputation
gateoverflow
finiteautomata
1
answer
10
i was just compiling some code and i got two different output.
answered
Aug 14
in
Programming

23
views
1
answer
11
TOC basic
The numbers 1,2,4,8,…2n,…1,2,4,8,…2n,… written in unary Is regular or not?? if not please justify??
answer selected
Aug 13
in
Theory of Computation

22
views
theoryofcomputation
finiteautomata
gateoverflow
2
answers
12
GATE1998_1.10
Which of the following set can be recognized by a Deterministic Finite state Automaton? The numbers $1, 2, 4, 8, \dots 2^n, \dots$ written in binary The numbers $1, 2, 4, 8,\dots 2^n, \dots$ written in unary The set of binary string in which the number of zeros is the same as the number of ones. The set $\{1, 101, 11011, 1110111, \dots\}$
commented
Aug 13
in
Theory of Computation

664
views
gate1998
theoryofcomputation
finiteautomata
normal
2
answers
13
TOC Question
Sorry my BAD, it's an infinite language! The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
commented
Aug 11
in
Theory of Computation

81
views
theoryofcomputation
finiteautomata
2
answers
14
what should be the space complexity of this , did not find any proper explanation on internet for space complexity
commented
Aug 11
in
Programming

141
views
2
answers
15
If we have two sorted array of size 'a' and 'b' and "one array smallest element is greater than largest element of other one".Then in the merge procedure, what will be its time complexity?
commented
Aug 11
in
Programming

406
views
algorithms
sorting
1
answer
16
infix to postfix doubt
if i get A + [ (B+C) ] /G in infix and i want to convert it into postfix then what to do with sign [ should i push it into stack ??
answer edited
Aug 10
in
Programming

30
views
0
answers
17
regular expression from DFA
.. Design regular expression for no 2 a's should come together , what i did i draw a dfa for 2 a's come together and then took complement of it , now iam using state elimination method but iam not getting correct regular expression from this , correct regular expression is given below in image
commented
Aug 10
in
Theory of Computation

75
views
1
answer
18
LEFT RECURSION
To avoid left recursion can we do like this. I think this is incorrect way to do
commented
Aug 10
in
Compiler Design

25
views
1
answer
19
LR(0) OR NOT???
If i am wrong let me correct.
commented
Aug 10
in
Compiler Design

14
views
compilerdesign
lrparser
grammar
theoryofcomputation
contextfreelanguage
1
answer
20
Follow
Please give detailed explanation.
answer selected
Aug 10
in
Compiler Design

34
views
2
answers
21
i want to join coaching for gate 2018.
commented
Aug 9
in
Written Exam

119
views
1
answer
22
REGULAR OR NOT
As given that 1st is not regular and 2nd is regular as 1st not form AP but 2nd form.but if in 2nd we fix value of m and n same then it will work as 1st(not regular) so 2nd also should not be regular.as i know if we fix m or n value as any constant it will be AP but what if same???
answer selected
Aug 8
in
Theory of Computation

53
views
theoryofcomputation
settheory&algebra
compilerdesign
ambiguous
regularlanguages
1
answer
23
REGULAR OR NOT
Please mention reason with answer:
answer selected
Aug 8
in
Theory of Computation

34
views
theoryofcomputation
compilerdesign
ambiguous
regularlanguages
settheory&algebra
1
answer
24
Symbol table updation.
Which of the following phases update the symbol table ? Lexical analysis, syntax analysis and semantic analysis . Please also tell what kind of updates a phase performs if it updates symbol table.
answer edited
Aug 8
in
Compiler Design

36
views
compilerdesign
symboltable
0
answers
25
IN SLR(1) SR CONFLICT
Here what will we do check intersection of follow(S) and follow(B) if common find then declare SR CONFLICT or As S production finish but it's Intersection is only possible with terminal(which is after dot in unfinished production) Please help what to do????
closed
Aug 8
in
Compiler Design

29
views
parsing
gate
compilerdesign
normal
numericalanswers
0
answers
26
Draw a DFA for
DFA ???
closed
Aug 8
in
Theory of Computation

44
views
0
answers
27
Closure properties in toc
Please give correct/verified answer.
closed
Aug 8
in
Theory of Computation

38
views
0
answers
28
Equivalence classes & Myhill Nerode Theorm in TOC
closed
Aug 8
in
Theory of Computation

16
views
0
answers
29
Please simplify this TOC GATE Question
commented
Aug 7
in
Theory of Computation

43
views
1
answer
30
LR(zero)
Options are as: (a) i and ii (b) i and iii (c) ii and iii (d) none of the above
answered
Aug 6
in
Compiler Design

32
views
theoryofcomputation
grammar
compilerdesign
contextfreelanguage
0
answers
31
CNF and GNF
Given answer is (a) but L>AB i think it is wrong because A and B produce something else Previously, so instead of L>AB there would have given like L>MN M>c1 and N>S then it was correct . if I am wrong please correct me.
commented
Aug 6
in
Compiler Design

17
views
theoryofcomputation
contextfreelanguage
discretemathematics
derivationtree
cnf
2
answers
32
LL(1) Grammar
Every LL(1) grammer is LALR(1) TRUE OR FALSE Every LL(1) grammer is CLR(1) TRUE OR FALSE AS I think 2nd is True and 1st is False if I am wrong please let me correct.
commented
Aug 5
in
Compiler Design

53
views
compilerdesign
theoryofcomputation
grammar
ll1
parsing
0
answers
33
SLR one
But given answer SLR(1) if i am wrong let me correct.
commented
Aug 5
in
Compiler Design

13
views
1
answer
34
TOC True or False Question
There exist a regular language A such that for language B which is Recursive Enumerable, (A intersection B) is R.E? Is it True or False!
commented
Aug 5
in
Theory of Computation

15
views
theoryofcomputation
1
answer
35
LL one
Given answer is yes but i think should not be LL(1)
answer selected
Aug 5
in
Compiler Design

13
views
0
answers
36
CNF and GNF
Is it mandatory in GNF that first element in production must be terminal(I am considering there is no Left recursion) Is it mandatory in CNF that in production only two nonterminal or terminal should be there Can we not take in one production as two nonterminal and one terminal OR one terminal and two nonterminal
commented
Aug 5
in
Theory of Computation

15
views
theoryofcomputation
derivationtree
contextfreelanguage
cnf
0
answers
37
Ambiguous to unambiguous
Make this grammer into unambiguous
asked
Aug 5
in
Compiler Design

15
views
1
answer
38
First and Follow
Example 3.3
commented
Aug 5
in
Compiler Design

26
views
0
answers
39
UNAMBIGUOUS GRAMMER
If my solution is wrong then please correct it and give proper explanation why it is wrong.
asked
Aug 5
in
Compiler Design

14
views
0
answers
40
Greibach Normal Form
Is my solution correct?? If not please give reason and correct it.
asked
Aug 5
in
Compiler Design

14
views
25,071
questions
32,223
answers
75,101
comments
30,232
users