An index in a DBMS is said to be dense if an index entry appears for every searchkey value in the indexed file. Otherwise it is called a sparse index. Consider the following two statements.

S1: A hash index must be a dense index

S2: A $\mathrm{B}^{+}$tree index can be a sparse index

Which one of the following options is correct?

Which one of the following options is not a property of Boolean Algebra?

Note: + is OR operation, • is AND operation, and ' is NOT operation

In a system, numbers are represented using 4-bit two's complement form. Consider four numbers $N 1=1011, N 2=1101, N 3=1010$ and $N 4=1001$ in the system. Which of the following operations will result in arithmetic overflow?

The 32-bit IEEE 754 single precision representation of a number is 0xC2710000. The number in decimal representation is $\_\_\_\_$ . (rounded off to two decimal places)