Recent questions tagged goclasses-cs-dpp-day-364

Consider the following schema:$\text{Parent(pid ~INTEGER ~PRIMARY KEY)}$$\text{Child(cid ~INTEGER, ~pid ~INTEGER,}$$\text{PRIMARY KEY(cid,~pid),}$$\text{FOREIGN KEY(pid) ...

Consider relation $S(D,E)$ with primary key $(D,E)$.The current instance of $S$ contains $(1,3)$, $(2,4)$, $(3,1)$.Relation $R(A,B,C)$ contains the foreign-key constraint...

Consider the relations $\text{Employee}(eid)$, $\text{Policy}(pid,eid)$, $\text{Dependent}(did,pid)$.The following foreign keys are defined:$\text{Policy}.eid$ $\text{ RE...

Consider the relations $Parent(pid)$ and $Child(cid,pid)$where $Parent.pid$ is the primary key and $Child.pid$ is a foreign key referencing $Parent.pid$No cascading actio...

Let $R(A,B,C)$ be a referencing relation and $S(D,E)$ be a referenced relation.Suppose $B$ is a foreign key of $R$ that references the candidate key $D$ of $S$.Which of t...

Consider the right-linear grammar,$$\begin{aligned}A &\to fB \mid gA \\B &\to gA \mid fC \mid f \\C &\to gA \mid fC \mid f\end{aligned}$$When this grammar is converted in...

Which of the following statements are correct for converting a finite automaton into an equivalent right-linear grammar?Each automaton state becomes a non-terminal. The s...

Consider the NFA given below: Which right-linear grammar is obtained by the standard NFA-to-grammar construction?$q_0 \to aq_1$,$q_1 \to aq_0 \mid bq_1 \mid \epsilon$ $q_...

Consider the right-linear grammar,$$\begin{aligned}S &\to aB \mid bS \mid \epsilon \\B &\to aS \mid bB\end{aligned}$$Which NFA is obtained by the standard grammar-to-NFA ...

Consider the right-linear grammar,$$\begin{aligned}S &\to aT \\T &\to abcS \mid b\end{aligned}$$If this grammar is converted into an NFA with one input symbol per transit...