Step 1: Use decomposition on \(P \rightarrow QR\).
From \(P \rightarrow QR\), by decomposition, we get:
\[
P \rightarrow Q \text{and} P \rightarrow R.
\]
Hence, statement (C) is true.
Step 2: Infer \(PS \rightarrow T\).
From \(P \rightarrow R\), by augmentation with \(S\), we obtain:
\[
PS \rightarrow RS.
\]
Given \(RS \rightarrow T\), by transitivity:
\[
PS \rightarrow T.
\]
Hence, statement (A) is true.
Step 3: Infer \(PS \rightarrow Q\).
From \(P \rightarrow Q\), by augmentation with \(S\), we get:
\[
PS \rightarrow Q.
\]
Thus, statement (D) is true.
Step 4: Eliminate incorrect option.
There is no dependency that allows inferring \(R \rightarrow T\) without \(S\). Hence, (B) is false.
Consider the relation \(R(P,Q,S,T,X,Y,Z,W)\) with the following functional dependencies:
\[ PQ \rightarrow X; P \rightarrow YX; Q \rightarrow Y; Y \rightarrow ZW \] Consider the decomposition of the relation \(R\) into the constituent relations according to the following two decomposition schemes. \[ \begin{aligned} D_1 &: R = [(P,Q,S,T);\; (P,T,X);\; (Q,Y);\; (Y,Z,W)] \\ D_2 &: R = [(P,Q,S);\; (T,X);\; (Q,Y);\; (Y,Z,W)] \end{aligned} \] Which one of the following options is correct?
In a 4-bit ripple counter, if the period of the waveform at the last flip-flop is 64 microseconds, then the frequency of the ripple counter in kHz is ______________. {(Answer in integer)}
Consider the following C code segment:
int x = 126, y = 105;
do {
if (x > y)
x = x - y;
else
y = y - x;
} while (x != y);
printf("%d", x);
The output of the given C code segment is ____________. (Answer in integer)
The following two signed 2’s complement numbers (multiplicand \( M \) and multiplier \( Q \)) are being multiplied using Booth’s algorithm:
| Multiplicand (\( M \)) | Multiplier (\( Q \)) |
|---|---|
| 1100 1101 1110 1101 | 1010 0100 1010 1010 |
The total number of addition and subtraction operations to be performed is __________. (Answer in integer)
The maximum value of \(x\) such that the edge between the nodes B and C is included in every minimum spanning tree of the given graph is __________ (answer in integer).
Consider the following C program
The value printed by the given C program is __________ (Answer in integer).