Best NIMCET Coaching Aspire Study
Online Classes, Classroom Classes
and More.
We are asked to find the total number of binary functions that can be defined using n Boolean variables.
For n Boolean variables, the number of possible input combinations is 2n.
Each input combination can map to either 0 or 1, so there are 2 possible outputs for each of the 2n input combinations.
Total Binary Functions = 2(2n)
The total number of binary functions that can be defined using n Boolean variables is: 2(2n)
Get MCA exam-wise questions, solutions, test series & updates instantly on your phone.
🚀 Install NowAspire Study Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Aspire Study Online Test Series, Information About Examination,
Syllabus, Notification
and More.
Commented Jul 20 , 2021
0 Upvote 0 Downvote Reply
Your reply to this comment :