Consider the following statements S1 and S2 about the relational data model:

S1: A relation scheme can have at most one foreign key.

S2: A foreign key in a relation scheme R cannot be used to refer to tuples of R.

Which one of the following choices is correct? 

Suppose the following functional dependencies hold on a relation U with attributes P, Q, R, S, and T :

P → QR

RS → T

Which of the following functional dependencies can be inferred from the above functional dependencies?  

Let S be the following schedule of operations of three transactions T₁, T₂ and T₃ in a relational database system:

R₂(Y), R₁(X), R₃(Z), R₁(Y), W₁(X), R₂(Z), W₂(Y), R₃(X), W₃(Z)

Consider the statements P and Q below:

P: S is conflict-serializable.

Q: If T₃ commits before T₁ finishes, then S is recoverable.

Which one of the following choices is correct?

Which one of the following circuits implements the Boolean function given below?

f(x, y, z) = m₀ + m₁ + m₃ + m₄ + m₅ + m₆, where m_i is the i^th minterm.