The GATE Grind

GATE 2014 CS (CS1) – Question 60

Engineering Mathematics · Discrete Mathematics: Sets, Relations, Functions, Partial Orders and Lattices · 2 marks · Numerical answer

S is the set of all functions $f:\{0,1\}^4\to\{0,1\}$. If N counts functions from S to {0,1}, find $\log_2\log_2N$.

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: 16 to 16

Explanation

The domain{0,1}⁴ has16elements, so S contains2¹⁶Boolean functions. There are N=2^(2¹⁶) functions from S to{0,1}. Consequently log₂log₂N=log₂(2¹⁶)=**16**. The two levels of function counting are both needed.