NIMCET 2017 Question Paper with solutions

For n-Boolean variables, there are $2^{\mathit{n}}$ possible boolean inputs. Each input can generate either True or False as the output. Hence, total number of different boolean function = $2^{2^{\mathit{n}}}$ .