The number of Boolean functions that can be generated by n variables is equal to_________________?
Correct answer: B. 22 n
- A. 2n
- B. 22 n
- C. 2n-1
- D. - 2n
Explanation
There are 2^n possible input combinations for n variables, and each combination can independently produce either 0 or 1. Hence the total number of Boolean functions is 2^(2^n).
Last updated
Practise Electronics and Devices
758 free Electronics and Devices MCQs from Electrical Engineering, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Exams that ask Electrical Engineering questions like this
Electrical Engineering is on 2 papers prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for every one of them.
Related questions
1 db corresponds to_____________change in power level?
A 1,000 V power supply would use_____________ as a filter capacitor?
A 10 V power supply would use ____________ as filter capacitor?
A 2-transistor class B power amplifier is commonly called ______________ amplifier?
A 25eV electron has a speed of______________?