Consider the following schedule for transactions T1, T2 and T3: Which one of the schedules below is the correct serialization of the above?

Consider a B⁺- tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?

What is the Boolean expression for the output f of the combinational logic circuit of NOR gates given below?

The minters expansion of $$f\left( {P,Q,R} \right) = PQ + Q\overline R + P\overline R $$ is