Aspire Faculty ID #16710 · Topic: CUET 2023 · Just now
CUET 2023

The number of possible Boolean functions that can be defined for $n$ Boolean variables over $n$-valued Boolean algebra is ______.

Solution

There are $2^n$ input combinations and each can take $n$ values. Total functions $= n^{2^n}$.

Previous 10 Questions — CUET 2023

Nearest first

Next 10 Questions — CUET 2023

Ascending by ID
Ask Your Question or Put Your Review.

loading...