Question: There are _________ numbers of Boolean functions of degree n.

Options

A : n

B : 2(2*n)

C : n3

D : n(n*2)

Click to view Correct Answer

Previous || Next

Discrete Mathematics Boolean Functions more questions

Which type of myosins move toward the minus-end of a....

The cross bridges involved in muscle contraction are located on....

Consider the global matrix A?=b. Let the coefficient matrix A=M-N.....

There exists a language L. We define a string w....

How many comparisons will be made in the worst case....

If a set A has n elements, then the total....

The half life period of nth order reaction varies inversely....

If there are b branches and n nodes, then how....

Which of the following is a part of structural component?

What is the cost of computation of FFT? (Note: ‘N’....

Chemical Engineering Basics - Part 1 more Online Exam Quiz

Discrete Mathematics Basic

Discrete Mathematics Bayes Theorem

Discrete Mathematics Binomial Coefficient

Discrete Mathematics Bipartite Graphs

Discrete Mathematics Boolean Algebra

Discrete Mathematics Burnside Theorem

Discrete Mathematics Campus Interviews

Discrete Mathematics Ciphers

Discrete Mathematics Circular Permutations

Discrete Mathematics Closure Associativity