A B⁺ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk blocks are of size 512 bytes, and index pointers are of size 4 bytes. Given this scenario, what would be the best choice of the degree (i.e. the number of pointers per node) of the B⁺ - tree?

Consider the following multiplexer where $$10, 11, 12, 13$$ are four data input lines selected by two address line combinations $${A_1}\,{A_0} = 00,01,10,11$$ respectively and $$f$$ is the output of the multiplex (or). $$EN$$ is the Enable input.

The function $$f(x,y,z)$$ implemented by the above circuit is

The decimal value $$0.25$$

The $$2's$$ compliment representation of the decimal value $$-15$$ is