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-373
1
1 vote
1
1 answer
113
113 views
GO Classes DPP | GATE CS | Theory of Computation | Regular vs Non-Regular
Which classification is correct?$\{w\in \{0,1\}^* \mid \#0(w)=\#1(w)\}$ is regular. $\{w\in \{0,1\}^* \mid \#0(w)=\#1(w)\}$ is not regular. $\{w\in \{0,1\}^* \mid \#01(...
GO Classes
113
views
asked
Sep 16
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-373
goclasses-toc-practice-questions
regular-language
multiple-selects
+
–
1
1 vote
1
1 answer
80
80 views
GO Classes DPP | GATE CS | Theory of Computation | Myhill-Nerode
For $L=\{a^n b^n\mid n\ge0\}$, which choice correctly proves non-regularity using Myhill-Nerode?Use $S=\{a^i\mid i\ge0\}$ and distinguish $a^i$ from $a^j$ using suffix $b...
GO Classes
80
views
asked
Sep 16
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-373
goclasses-toc-practice-questions
regular-language
myhill-nerode
+
–
1
1 vote
1
1 answer
85
85 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
Let $L=\{w\in{0,1}^*\mid w$ contains equal numbers of substrings $01$ and $10\}$. Which statements are correct?$L$ is regular. A correct regular expression for $L$ is $\e...
GO Classes
85
views
asked
Sep 16
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-373
goclasses-toc-practice-questions
regular-language
multiple-selects
+
–
1
1 vote
1
1 answer
70
70 views
GO Classes DPP | GATE CS | Theory of Computation | Pumping Lemma
To prove $L=\{a^n b^n\mid n\ge0\}$ is not regular using the pumping lemma, choose $w=a^p b^p$, where $p$ is the pumping length. Which statements are correct?Since $|xy|\l...
GO Classes
70
views
asked
Sep 16
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-373
goclasses-toc-practice-questions
pumping-lemma
multiple-selects
+
–
1
1 vote
1
1 answer
65
65 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
Let $L_n=\{0^n1^n\}$ for each $n\ge0$. Which statements are correct?Each $L_n$ is regular. Any finite union of such languages is regular. $\bigcup_{n\ge0}L_n=\{0^n1^n\mid...
GO Classes
65
views
asked
Sep 16
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-373
goclasses-toc-practice-questions
regular-language
multiple-selects
+
–
3
3 votes
1
1 answer
118
118 views
GO Classes DPP | GATE CS, DA | DBMS | Chase Chain Reaction
Consider $R(A,B,C,D,E,F,G,H)$ with $F=\{AB\to CD,\ AC\to DE,\ EF\to AG\}$.The decomposition is $R_1(A,C,D,E),$ $R_2(A,B,C),$ $R_3(A,B,F,G,H)$.Which statement correctly de...
GO Classes
118
views
asked
Sep 16
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-275
goclasses-cs-dpp
goclasses-cs-dpp-day-373
databases
goclasses-databases-practice-questions
lossless-decomposition
chase-test
+
–
2
2 votes
1
1 answer
92
92 views
GO Classes DPP | GATE CS, DA | DBMS | Non-Binary Losslessness
Consider $R(A,B,C,D,E,F,G)$ with $F=\{AC\to BD,\ BC\to E,\ BE\to DF,\ AG\to EB\}$ and decomposition $R_1(A,B,C,D),$ $R_2(A,B,C,E,G),$ $R_3(B,E,F),$ $R_4(A,E,G)$.Which of ...
GO Classes
92
views
asked
Sep 16
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-275
goclasses-cs-dpp
goclasses-cs-dpp-day-373
databases
goclasses-databases-practice-questions
lossless-decomposition
+
–
1
1 vote
1
1 answer
95
95 views
GO Classes DPP | GATE CS, DA | DBMS | Decomposition
Consider $R(A,B,C,D,E,F)$ with $F=\{A\to C,\ CE\to D,\ CD\to A,\ DF\to A\}$.The decomposition is $R_1(A,B,C,D),$ $R_2(A,D,E),$ $R_3(B,C,E,F)$.Which statement is correct?T...
GO Classes
95
views
asked
Sep 16
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-275
goclasses-cs-dpp
goclasses-cs-dpp-day-373
databases
goclasses-databases-practice-questions
decomposition
chase-test
+
–
2
2 votes
1
1 answer
96
96 views
GO Classes DPP | GATE CS, DA | DBMS | Non-Binary Lossy Decomposition
Consider the relation $R(T,I,G,E,R,S)$ with $F=\{G\to ES,\ RT\to I,\ IR\to E\}$.It is decomposed into $R_1(T,E),$ $R_2(I,G),$ $R_3(I,E,R,S)$.What does the Chase Test conc...
GO Classes
96
views
asked
Sep 16
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-275
goclasses-cs-dpp
goclasses-cs-dpp-day-373
databases
goclasses-databases-practice-questions
decomposition
chase-test
+
–
1
1 vote
1
1 answer
92
92 views
GO Classes DPP | GATE CS, DA | DBMS | Non-Binary Decomposition
Consider $R(S,N,C,P,X,Y,Q)$ with $F=\{S\to NC,\ P\to XY,\ SP\to Q\}$.The relation is decomposed into $R_1(S,N,C),$ $R_2(P,X,Y), $ $R_3(S,P,Q)$.Which statement is correct?...
GO Classes
92
views
asked
Sep 16
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-275
goclasses-cs-dpp
goclasses-cs-dpp-day-373
databases
goclasses-databases-practice-questions
dependency-preserving
chase-test
+
–
To see more, click for the
full list of questions
or
popular tags
.