There are                    numbers of Boolean functions of degree n.

Related MCQs

• Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex?
• Minimize the Boolean expression using Boolean identities: A′B+ABC′+BC’+AB′C′.
• Minimize the following Boolean expression using Boolean identities. F(A,B,C) = (A+BC’)(AB’+C)
• What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?
• What is the definition of Boolean functions?
• How many numbers must be selected from the set {1, 2, 3, 4} to guarantee that at least one pair of these numbers add up to 7?
• G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is              
• What are the canonical forms of Boolean Expressions?
• What is the use of Boolean identities?
• A                    is a Boolean variable.