Which of the following is NOT a superkey in a relational schema with attributes $$V, W, X, Y, Z$$ and primary key $$V Y?$$

Consider the following two phase locking protocol. Suppose a transaction $$T$$ accesses (for read or write operations), a certain set of objects $$\left\{ {{O_1},...,{O_k}} \right\}.$$ This is done in the following manner:

Step 1. T acquires exclusive locks to $${{O_1},...,{O_k}}$$ in increasing order of their
addresses.
Step 2. The required operations are performed.
Step 3. All locks are released.

This protocol will

A database of research articles in a journal uses the following schema.

(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)

The primary key is (VOLUME, NUMBER, STARTPAGE, ENDPAGE) and the following functional dependencies exist in the schema.

(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → TITLE
(VOLUME, NUMBER) → YEAR
(VOLUME, NUMBER, STARTPAGE, ENDPAGE) → PRICE

The database is redesigned to use the following schemas.

(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, PRICE)
(VOLUME, NUMBER, YEAR)

Which is the weakest normal form that the new database satisfies, but the old one does not?

Consider a carry lookahead adder for adding two $$n$$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is