6 votes 6 votes Q.86 The number of possible boolean functions that can be defined for $n$ boolean variables over $n$-valued boolean algebra is (a) $2^{2^n}$ (b) $2^{n^2}$ (c) $n^{2^n}$ (d) $n^{n^n}$ Digital Logic digital-logic boolean-algebra + – Payal Rastogi asked Dec 25, 2015 • edited Jun 12, 2023 by Hira Thakur Payal Rastogi 5.4k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes answer is option (d) n^n^n since n valued boolean algebra given. we are familiar with the most common in computer science as 0,1 two valued so we have 2^2^n if it is 3 valued boolean then no of functions would b 3^3^n so similarly for n it is n^n^n Asim Siddiqui 4 answered Jun 17, 2020 Asim Siddiqui 4 comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes We know for n variable we have total 2^n combination are possible and these combination can have two values either 1 or 0 therefore we have 2^2^n that is option a Roshini answered Jun 17, 2020 Roshini comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Number of rows in truth table =x = n^n for each row 2 values are possible as it is boolean function= 2x2x2……...n^n times. The number of possible boolean functions that can be defined for n boolean variables over n valued boolean algebra is 2^(n^n) aaaakash001 answered Oct 22, 2022 aaaakash001 comment Share Follow See all 0 reply Please log in or register to add a comment.