Request New Subject
Home
Computer Science Engineering (CSE)
Discrete Mathematics
Q. The set for which the Boolean function is functionally complete is (Solved)
1. {*, %, /}
2. {., +, -}
3. {^, +, -}
4. {%, +, *}
b. {., +, -}
Related Topics
→ Computer Architecture and Organization
→ Microprocessor and Interfacing Technique
→ Computer Networks
→ Data Structure and Algorithms (DSA)
→ Operating System (OS)
→ Artificial Intelligence and Robotics (AIR)
→ Software Project Management (SPM)
→ Computer Fundamentals
→ High Performance Computing (HPC)
→ Data Communication and Computer Network
Subscribe Now
Get All Updates & News
Subscribe