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?

Consider the following code:
int a;
int arr[] = {30, 50, 10};
int *ptr = arr[10] + 1;
a = *ptr;
(*ptr)++;
ptr = ptr + 1;
printf("%d", a + arr[1] + *ptr);
In the diagram, the lines QR and ST are parallel to each other. The shortest distance between these two lines is half the shortest distance between the point P and the line QR. What is the ratio of the area of the triangle PST to the area of the trapezium SQRT?
Note: The figure shown is representative

Consider the following process information for Shortest Remaining Time First (SRTF) scheduling:
\[ \begin{array}{|c|c|c|} \hline \textbf{Process} & \textbf{Arrival Time (AT)} & \textbf{Burst Time (BT)} \\ \hline P1 & 0 & 10 \\ P2 & 1 & 13 \\ P3 & 2 & 6 \\ P4 & 8 & 9 \\ \hline \end{array} \]Find the turnaround time for each process.