Question

The set for which the Boolean function is functionally complete is __________

(a) {*, %, /}

(b) {., +, -}

(c) {^, +, -}

(d) {%, +, *}

I got this question during an interview for a job.

This question is from Boolean Functions in section Boolean Algebra and Modeling Computations of Discrete Mathematics

Answer 1

The correct choice is (b) {., +, -}

The best explanation: A Boolean function is represented by using three operators ., +, -. We can find a smaller set of functionally complete operators if one of the three operators of this set can be expressed in terms of the other two.