Consider the following two statements about database transaction schedules:

I. Strict two-phase locking protocol generates conflict serializable schedules that are also recoverable.

II. Timestamp-ordering concurrency control protocol with Thomas Write Rule can generate view serializable schedules that are not conflict serializable.

Which of the above statements is/are TRUE?

Which one of the following is NOT a valid identity?

Consider Z = X - Y, where X, Y and Z are all in sign-magnitude form. X and Y are each represented in n bits. To avoid overflow, the representation of Z would require a minimum of:

What is the minimum number of 2-input NOR gates required to implement a 4-variable function function expressed in sum-of-minterms form as

f = Σ(0, 2, 5, 7, 8, 10, 13, 15)?

Assume that all the inputs and their complements are available.