Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged goclasses-cs-dpp-day-367
4
4 votes
1
1 answer
170
170 views
GO Classes DPP | GATE CS | Theory of Computation | PDA Trace Analysis
Consider the PDA $P=(\{q,p\},\{0,1\},\{Z_0,X\},\delta,q,Z_0,\{p\})$ with transition rules:$\delta(q,0,Z_0)=\{(q,XZ_0)\}$ $\delta(q,0,X)=\{(q,XX)\}$ $\delta(q,1,X)=\{(q,...
GO Classes
170
views
asked
Sep 9
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-367
goclasses-toc-practice-questions
pushdown-automata
multiple-selects
+
–
1
1 vote
1
1 answer
125
125 views
GO Classes DPP | GATE CS | Theory of Computation | Final-State Acceptance
Suppose $D$ is a DPDA that accepts $L(D)$ by final state. Let $D'$ be the same DPDA, but with final states changed from $F$ to $Q-F$. Is it always true that $L(D')=\overl...
GO Classes
125
views
asked
Sep 9
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-367
goclasses-toc-practice-questions
pushdown-automata
+
–
1
1 vote
1
1 answer
94
94 views
GO Classes DPP | GATE CS | Theory of Computation | Competing Epsilon Move
Suppose a PDA has the transition rules $\delta(q_1,a,c)=\{(q_3,c)\}$ and $\delta(q_1,\epsilon,c)=\{(q_1,c)\}$. From the current configuration $(q_1,acbc,c\#Z)$, where the...
GO Classes
94
views
asked
Sep 9
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-367
goclasses-toc-practice-questions
pushdown-automata
+
–
1
1 vote
1
1 answer
124
124 views
GO Classes DPP | GATE CS | Theory of Computation | N-PDA
Consider an NPDA $(Q,\Sigma,\Gamma,\delta,q_0,z,F)$ where$Q=\{q_0,q_1,q_2,q_3\}$$\Sigma=\{a,b\}$$\Gamma=\{0,1\}$$z=0$$F=\{q_3\}$Suppose the transition rules include $\del...
GO Classes
124
views
asked
Sep 9
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-367
goclasses-toc-practice-questions
pushdown-automata
+
–
1
1 vote
1
1 answer
117
117 views
GO Classes DPP | GATE CS | Theory of Computation | PDA Transition
Suppose an NPDA has the transition rule $\delta(q_1,a,b)=\{(q_2,cd),(q_3,\epsilon)\}$. If the current configuration is $(q_1,abb,bZ)$, where the stack is written top to b...
GO Classes
117
views
asked
Sep 9
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-367
goclasses-toc-practice-questions
pushdown-automata
multiple-selects
+
–
3
3 votes
1
1 answer
246
246 views
GO Classes DPP | GATE CS, DA | DBMS | FD Equivalence & Cover
Consider the two FD sets, $F=\{A \to B,\ B \to C,\ C \to A\}$ and $G=\{A \to C,\ C \to B,\ B \to A\}$.Which of the following statements is correct?Only $F$ is a minimal c...
GO Classes
246
views
asked
Sep 9
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-269
goclasses-cs-dpp
goclasses-cs-dpp-day-367
databases
goclasses-databases-practice-questions
functional-dependency
minimal-cover
equivalence-class
+
–
4
4 votes
2
2 answers
211
211 views
GO Classes DPP | GATE CS, DA | DBMS | Minimal Cover
Consider $F=\{AB \to CF,\ CD \to EA,\ E \to ABC,\ B \to F,\ C \to D\}$Which of the following is a minimal cover of $F$?$\{AB \to C,\ C \to D,\ C \to E,\ E \to A,\ E \to B...
GO Classes
211
views
asked
Sep 9
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-269
goclasses-cs-dpp
goclasses-cs-dpp-day-367
databases
goclasses-databases-practice-questions
functional-dependency
minimal-cover
+
–
4
4 votes
1
1 answer
166
166 views
GO Classes DPP | GATE CS, DA | DBMS | Minimal Cover
Consider $F=\{P \to S,\ PQ \to ST,\ S \to RU,\ RU \to S,\ PT \to V\}$.Which of the following is a minimal cover of $F$?$\{P \to S,\ PQ \to ST,\ S \to RU,\ RU \to S,\ PT \...
GO Classes
166
views
asked
Sep 9
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-269
goclasses-cs-dpp
goclasses-cs-dpp-day-367
databases
goclasses-databases-practice-questions
functional-dependency
minimal-cover
+
–
1
1 vote
1
1 answer
150
150 views
GO Classes DPP | GATE CS, DA | DBMS | Extraneous Attribute
Consider $F=\{A \to B,\ AB \to C\}$.Which of the following statements is correct?$B$ is extraneous in the left-hand side of $AB \to C$. $A$ is extraneous in the left-hand...
GO Classes
150
views
asked
Sep 9
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-269
goclasses-cs-dpp
goclasses-cs-dpp-day-367
databases
goclasses-databases-practice-questions
minimal-cover
functional-dependency
+
–
2
2 votes
1
1 answer
145
145 views
GO Classes DPP | GATE CS, DA | DBMS | FD Equivalence & Cover
Consider the following two sets of functional dependencies:$F=\{A \to B,\ B \to C\}$$G=\{A \to B,\ B \to C,\ A \to C\}$Which of the following statements are correct?$F$ c...
GO Classes
145
views
asked
Sep 9
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-269
goclasses-cs-dpp
goclasses-cs-dpp-day-367
databases
goclasses-databases-practice-questions
functional-dependency
minimal-cover
equivalence-class
multiple-selects
+
–
To see more, click for the
full list of questions
or
popular tags
.