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-380
0
0 votes
1
1 answer
88
88 views
GO Classes DPP | GATE CS, DA | DBMS | Full Outer Join vs Inner Join
Consider $\mathrm{A}(\mathrm{c1},\mathrm{c2},\mathrm{c3})$ and $\mathrm{B}(\mathrm{c1},\mathrm{c2},\mathrm{c3})$, where $\mathrm{c1}$ is the primary key of each relation....
GO Classes
88
views
asked
Sep 25
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-282
goclasses-cs-dpp
goclasses-cs-dpp-day-380
databases
goclasses-databases-practice-questions
relational-algebra
full-outer-join
inner-join
+
–
1
1 vote
1
1 answer
80
80 views
GO Classes DPP | GATE CS, DA | DBMS | Relational Algebra Equivalence
Let $\mathrm{R}(\mathrm{A},\mathrm{B})$ and $\mathrm{S}(\mathrm{A},\mathrm{B})$ be relations under set semantics.Which expression is not always equivalent to the others?$...
GO Classes
80
views
asked
Sep 25
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-282
goclasses-cs-dpp
goclasses-cs-dpp-day-380
databases
goclasses-databases-practice-questions
relational-algebra
+
–
0
0 votes
1
1 answer
83
83 views
GO Classes DPP | GATE CS, DA | DBMS | Full Outer Join
Consider :$$\begin{aligned}\begin{gathered}\mathrm{Customer} \\[-2pt]\begin{array}{|c|c|}\hline\mathrm{cid} & \mathrm{name} \\\hline1 & \mathrm{Joe} \\2 & \mathrm{Betty} ...
GO Classes
83
views
asked
Sep 25
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-282
goclasses-cs-dpp
goclasses-cs-dpp-day-380
databases
goclasses-databases-practice-questions
relational-algebra
full-outer-join
+
–
1
1 vote
1
1 answer
78
78 views
GO Classes DPP | GATE CS, DA | DBMS | Outer Join
Consider $\mathrm{Homes}(\mathrm{home\_id},\mathrm{city},\ldots)$ and $\mathrm{Transactions}(\mathrm{home\_id},\mathrm{sale\_price},\ldots)$.We want every home in Berkele...
GO Classes
78
views
asked
Sep 25
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-282
goclasses-cs-dpp
goclasses-cs-dpp-day-380
databases
goclasses-databases-practice-questions
relational-algebra
outer-join
multiple-selects
+
–
2
2 votes
3
3 answers
123
123 views
GO Classes DPP | GATE CS, DA | DBMS | Outer Join
Consider $ \mathrm{MEMBER}(\mathrm{personName}, \mathrm{groupName}) $ and $ \mathrm{PICTURE}(\mathrm{groupName}, \mathrm{picture}) $.Every person belongs to at least one ...
GO Classes
123
views
asked
Sep 25
Databases
goclasses
goclasses-da-dpp
goclasses-da-dpp-day-282
goclasses-cs-dpp
goclasses-cs-dpp-day-380
databases
goclasses-databases-practice-questions
relational-algebra
outer-join
+
–
0
0 votes
1
1 answer
78
78 views
GO Classes DPP | GATE CS | Theory of Computation | Infinite Intersection
Let \(I \subseteq \Sigma^*\) be any nonregular language.For every string \(w \notin I\), define $R_w = \Sigma^* - \{w\}.$Now consider $K = \bigcap_{w \notin I} R_w.$What ...
GO Classes
78
views
asked
Sep 24
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-380
goclasses-toc-practice-questions
regular-language
+
–
0
0 votes
1
1 answer
86
86 views
GO Classes DPP | GATE CS | Theory of Computation | Closure Property
For every $n\geq 0$, define $L_n=\{a^nb^n\}$.Which statement is correct?Every $L_n$ is nonregular, but $\bigcup_{n=0}^{\infty}L_n$ is regular. Every $L_n$ is regular, and...
GO Classes
86
views
asked
Sep 24
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-380
goclasses-toc-practice-questions
regular-language
closure-property
+
–
0
0 votes
1
1 answer
89
89 views
GO Classes DPP | GATE CS | Theory of Computation | Subset Superset
Let $\Sigma=\{0,1\}.$Which of the following are valid examples?$A=\{01\}, \qquad B=\{0^n1^n\mid n\ge0\}$where $A$ is regular, $B$ is nonregular, and $A\subseteq B$. $C=\{...
GO Classes
89
views
asked
Sep 24
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-380
goclasses-toc-practice-questions
regular-language
multiple-selects
+
–
0
0 votes
1
1 answer
75
75 views
GO Classes DPP | GATE CS | Theory of Computation | Chomsky Hierarchy
Let $L$ be a context-free language that is not regular.Which of the following must be true?$L$ is recursive. $L$ is not recursive. There exists a regular grammar $G$ such...
GO Classes
75
views
asked
Sep 24
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-380
goclasses-toc-practice-questions
chomsky-classification
+
–
0
0 votes
1
1 answer
85
85 views
GO Classes DPP | GATE CS | Theory of Computation | Grammar Classification
Consider the grammar $$S\rightarrow aS\mid Sb\mid b$$ Which of the following statements are correct?The given grammar is a Type $3$ grammar. The given grammar is a Type $...
GO Classes
85
views
asked
Sep 24
Theory of Computation
goclasses
goclasses-cs-dpp
theory-of-computation
goclasses-cs-dpp-day-380
goclasses-toc-practice-questions
grammar
multiple-selects
+
–
To see more, click for the
full list of questions
or
popular tags
.