The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by prashant dubey
User prashant dubey
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User prashant dubey
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
answered
Jun 6, 2019
in
Compiler Design

153
views
compilerdesign
ll1parser
syntaxdirectedtranslation
0
votes
2
Ambiguity
If the grammar be left recursive then is it always be ambiguous?
answered
Jun 6, 2019
in
Compiler Design

518
views
compilerdesign
+1
vote
3
Made Easy Test Series: DFA
Min number of states in equivalent DFA ______________ will it be 4 or 5 ??
answered
May 2, 2019
in
Theory of Computation

115
views
madeeasytestseries
theoryofcomputation
0
votes
4
Made Easy Test Series : Compiler Design
Consider the following CFG: $S\rightarrow Aa\mid ca$ $A\rightarrow c\mid d$ How many conflict occur in $CLR\left ( 1 \right )$ Parsing construction ? I think $LR\left ( 0 \right )$ there is $1$ conflict, but in $SLR\left ( 1 \right )orCLR\left ( 1 \right )$ there won’t be any conflict. Someone verify it.
answered
Apr 29, 2019
in
Compiler Design

106
views
compilerdesign
madeeasytestseries
+1
vote
5
Made Easy Test Series:Programming & DS
Suppose a queue $Q$ and two stacks $S_{1}$ and $S_{2}$ as given below. void enqueue(Q,x){ push(S1,x); } void dequeue(Q,x){ if(stackempty(S2))then if(stackempty(S1))then{ print("Q is empty"); return; } else while ... $Enqueue(4),Enqueue(3),Enqueue(2),Dequeue, Enqueue(6),Dequeue,Dequeue, Dequeue,Enqueue(5)$ Please tell value of X and Y are u getting
answered
Apr 28, 2019
in
Programming

113
views
madeeasytestseries
programming
madeeasytestseries2019
0
votes
6
SelfDoubt:Mathematical logic
“Every asymmetric relation is antisymmetric” Is this statement is True or False? I think it is false, because asymmetric relation never allows loops and antisymmetric relation allows loops. Am I not correct?
answered
Apr 27, 2019
in
Set Theory & Algebra

44
views
discretemathematics
0
votes
7
Raghuramkrishnan
R(A, B, C, D) FD: B>C, D>A is the following decomposition in BCNF? R1(B, C), R2(A, D), R3(C, D)
answered
Apr 27, 2019
in
Databases

191
views
databases
databasenormalization
normal
bcnfdecomposition
bcnf
0
votes
8
BCNF
Every BCNF decomposition is A)Dependency preserving B)not a dependency preserving C)Need not be dependency preserving D)None of the above
answered
Apr 27, 2019
in
Databases

625
views
bcnf
docm
bcnfdecomposition
databasenormalization
0
votes
9
GATE19905c
For the synchronous counter shown in Fig.3, write the truth table of $Q_{0}, Q_{1}$,and $Q_{2}$ after each pulse, starting from $Q_{0}=Q_{1}=Q_{2}=0$ and determine the counting sequence and also the modulus of the counter.
answered
Apr 27, 2019
in
Digital Logic

1.3k
views
gate1990
descriptive
digitallogic
flipflop
0
votes
10
self doubts
{w1 x w2w1,x,w2∈(a+b)*,w1=w2} it is regular ?????
answered
Apr 27, 2019
in
Theory of Computation

53
views
0
votes
11
Testbook Test Series: Compiler Design  Syntax Directed Translation
answered
Apr 26, 2019
in
Compiler Design

131
views
compilerdesign
syntaxdirectedtranslation
testbooktestseries
0
votes
12
MadeEasy Test Series 2018: Programming & DS  Prorgramming In C
answered
Apr 26, 2019
in
Programming

175
views
programming
programminginc
madeeasytestseries2018
madeeasytestseries
0
votes
13
UGCNETJune2010II: 39
In order to allow only one process to enter its critical section, binary semaphore are initialized to $0$ $1$ $2$ $3$
answered
Apr 8, 2019
in
Operating System

969
views
ugcnetjune2010ii
operatingsystem
binarysemaphore
0
votes
14
Kmap
Consider the boolean expression F(A,B,C,D)=Σm=(0,1,2,5,6,7,8,10,14,15).Find the number of essential prime implicants. a)1 b)2 c)3 d)4
answered
Apr 8, 2019
in
Digital Logic

104
views
digitallogic
kmap
0
votes
15
MadeEasy Test Series: Compiler Design  Lexical Analysis
I am getting 30 Answer given is 29
answered
Apr 8, 2019
in
Compiler Design

273
views
madeeasytestseries
compilerdesign
lexicalanalysis
tokens
0
votes
16
Peter Linz Edition 5 Exercise 9.1 Question 5 (Page No. 238)
What language is accepted by the Turing machine whose transition graph is in the figure below$?$
answered
Apr 6, 2019
in
Theory of Computation

35
views
peterlinz
peterlinzedition5
theoryofcomputation
turingmachine
0
votes
17
Kenneth Rosen Edition 7th Exercise 2.2 Question 4 (Page No. 136)
Let $A= \left \{ a,b,c,d,e \right \}$ and $B= \left \{ a,b,c,d,e,f,g,h \right \}$. Find $A \cup B$ $A \cap B$ $AB$ $BA$
answered
Apr 6, 2019
in
Set Theory & Algebra

27
views
kennethrosen
discretemathematics
settheory&algebra
easy
0
votes
18
CFL decidability
Problem : intersection of 2 CFL's is CFL. Is this decidable ?
answered
Mar 28, 2019
in
Theory of Computation

611
views
theoryofcomputation
decidability
turingmachine
contextfreelanguages
0
votes
19
Class of Language and Decidability
Question 1 >> Consider the following two languages: Which of the following statement is true? a. L1 is CSL and L2 is CFL but not CSL b. Both L1 and L2 are CSL but not CFL c. Both L1 and L2 are CSL but not CFL d. Both L1 and L2 ... language is CSL but not CFL, but I think it should be D) both language is CFL but not regular. is there something I am missing.
answered
Mar 28, 2019
in
Theory of Computation

83
views
theoryofcomputation
identifyclasslanguage
contextfreelanguages
+1
vote
20
GATE2005IT51
Let $T(n)$ be a function defined by the recurrence $T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and $T(1) = 1$ Which of the following statements is TRUE? $T(n) = \Theta(\log n)$ $T(n) = \Theta(\sqrt n)$ $T(n) = \Theta(n)$ $T(n) = \Theta(n \log n)$
answered
Mar 28, 2019
in
Algorithms

2.4k
views
gate2005it
algorithms
recurrence
easy
0
votes
21
DBMS Korth Edition 6 Exercise 7 Question 14 (Page No. 318)
Explain the distinctions among the terms primary key, candidate key, and superkey.
answered
Mar 28, 2019
in
Databases

108
views
databases
korthedition6
databasedesign
erdiagram
descriptive
0
votes
22
self doubt
S → aA / CB A → BaA / epsilon B → bB / Abc / epsilon C → B what is follow of C , FOLLOW(C)? I think answer is FOLLOW (C) = First(B) = { b, first (A), (dollar for epsilon) } = {b, a, $} Am i right? Because i found some where FOLLOW(C) = FOLLOW(B) . Is this statement correct? (But I think this is wrong) PLZ confirm the solution of above doubt………………..!!!!!!!!!!!
answered
Mar 26, 2019
in
Compiler Design

57
views
compilerdesign
lr
0
0
votes
23
Gate Practice question check if grammar is LR(0)?
is it correct please tell me its urgent!
answered
Mar 26, 2019
in
Compiler Design

1k
views
compilerdesign
parsing
lrparser
lr
0
+1
vote
24
Compiler Design  Parsing: Is LALR(1) made from the LR(0) or the LR(1) automaton?
answered
Mar 26, 2019
in
Compiler Design

322
views
compilerdesign
lrparser
parsing
0
votes
25
Compiler Design LR(1) doubt
Can lookahead symbol be epsilon in LR(1) parsing? and pls give the LR(1) diagram for the following grammar? A>AB  a B>*AC  Cb  ∈ C>+ABc  ∈
answered
Mar 26, 2019
in
Compiler Design

148
views
compilerdesign
lrparser
parsing
parser
Amazon.in Widgets
52,223
questions
59,811
answers
201,020
comments
118,087
users