1

The set for which the Boolean function is functionally complete is

Correct Answer: {., +, -}

Make the most of this question

This page focuses on one Discrete Mathematics question from Engineering. After checking the answer, return to the topic list to practice more or run a timed set.