All mock tests are FREE till 31 December — register to save your progress

How many different Boolean functions of degree n are there?

Pick an option to check yourself, or open the answer below.

Show answer & explanation

Correct answer: B. 2^(2ⁿ)

Explanation

There are 2ⁿ input rows, and each can map to 0 or 1: 2^(2ⁿ) functions.

More Discrete Structures and Optimization questions