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-377
1
1 vote
2
2 answers
174
174 views
GO Classes DPP | GATE CS, DA | DBMS | Relational Algebra
Consider the relations:$\mathrm{Users(username, name, email, password, address)}$and$\mathrm{FriendsWith(username, username2, sincewhen)}$.A friendship tuple indicates th...
GO Classes
174
views
asked
Sep 21
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-279
goclasses-cs-dpp
goclasses-cs-dpp-day-377
databases
goclasses-databases-practice-questions
projection
relational-algebra
multiple-selects
+
–
1
1 vote
1
1 answer
96
96 views
GO Classes DPP | GATE CS, DA | DBMS | Relational Algebra
Consider the relations:$\mathrm{STUDENT(name,regno,gpa,level,dept)}$$\mathrm{COURSE(cno,cname,dept)}$$\mathrm{TAKE(regno,cno)}$Using only the basic relational algebra ope...
GO Classes
96
views
asked
Sep 21
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-279
goclasses-cs-dpp
goclasses-cs-dpp-day-377
databases
goclasses-databases-practice-questions
relational-algebra
+
–
1
1 vote
1
1 answer
95
95 views
GO Classes DPP | GATE CS, DA | DBMS | Relational Algebra
Consider $R(a,b)$ and $S(c,d)$.Which relational algebra expression is equivalent to:SELECT a, d FROM R, S WHERE R.a 10 AND R.b = S.c;Use only the basic operators.$\pi_{a...
GO Classes
95
views
asked
Sep 21
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-279
goclasses-cs-dpp
goclasses-cs-dpp-day-377
databases
goclasses-databases-practice-questions
projection
relational-algebra
+
–
1
1 vote
1
1 answer
91
91 views
GO Classes DPP | GATE CS, DA | DBMS | Relational Algebra
Let $R$ and $S$ be union-compatible relations.Which expression computes $R\cap S$ using only union and set difference?$(R\cup S)-((R-S)\cup(S-R))$ $(R\cup S)-(R-S)$ $(R-S...
GO Classes
91
views
asked
Sep 21
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-279
goclasses-cs-dpp
goclasses-cs-dpp-day-377
databases
goclasses-databases-practice-questions
relational-algebra
+
–
1
1 vote
1
1 answer
109
109 views
GO Classes DPP | GATE CS, DA | DBMS | Relational Algebra
Consider $\text{parts(pno, pname, price)}$.Which relational algebra expression returns exactly the names of all parts whose price is greater than $\$200$?$\pi_{\text{pnam...
GO Classes
109
views
asked
Sep 21
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-279
goclasses-cs-dpp
goclasses-cs-dpp-day-377
databases
goclasses-databases-practice-questions
projection
relational-algebra
multiple-selects
+
–
2
2 votes
1
1 answer
90
90 views
GO Classes DPP | GATE CS | Theory of Computation | Language Quotient
For languages $X,Y\subseteq\Sigma^*$, define$$X/Y = \{w:\exists y\in Y,\ wy\in X\}$$ Suppose $X$ is regular, but nothing is assumed about $Y$.Which statement is always tr...
GO Classes
90
views
asked
Sep 21
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-377
goclasses-toc-practice-questions
closure-property
regular-language
multiple-selects
+
–
0
0 votes
1
1 answer
69
69 views
GO Classes DPP | GATE CS | Theory of Computation | Closure Properties
Let $X$ and $Y$ be regular languages. Their symmetric difference is$$X\triangle Y=\{w:w\text{ belongs to exactly one of }X,Y\}$$. Which expression correctly represents $X...
GO Classes
69
views
asked
Sep 21
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-377
goclasses-toc-practice-questions
closure-property
regular-language
multiple-selects
+
–
2
2 votes
1
1 answer
74
74 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
Let $M$ and $N$ be two DFAs. Define$$Z=\{u_1v_1u_2v_2\cdots u_kv_k : k\ge0, ~u_i\in L(M), ~v_i\in L(N)\}.$$Which regular-language expression describes $Z$?$L(M)^*L(N)^*$ ...
GO Classes
74
views
asked
Sep 21
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-377
goclasses-toc-practice-questions
closure-property
regular-language
multiple-selects
+
–
1
1 vote
1
1 answer
65
65 views
GO Classes DPP | GATE CS | Theory of Computation | Reversal Transformation
Let $L$ be an arbitrary regular language over $\Sigma$, and define$$K=\{w\in\Sigma^*:w^Rw\in L\}$$.Which statement is correct?$K$ is always regular. $K$ is regular only i...
GO Classes
65
views
asked
Sep 21
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-377
goclasses-toc-practice-questions
regular-language
multiple-selects
+
–
0
0 votes
1
1 answer
61
61 views
GO Classes DPP | GATE CS | Theory of Computation | Regular Language
For an arbitrary language $L$, which of the following statements is correct?If $L^*$ is regular, then $L$ must be regular. If $L$ is nonregular, then $L^*$ must be nonreg...
GO Classes
61
views
asked
Sep 21
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-377
goclasses-toc-practice-questions
closure-property
regular-language
multiple-selects
+
–
To see more, click for the
full list of questions
or
popular tags
.