We say that a set of gates is logically complete if we can build any circuit without using any other kind of gates. Which of the following sets are logically complete

Related MCQs

• Circuit A is a 1-bit adder; circuit B is a 1 bit multiplier. (Hint: Construct the truth table for the adder and the multiplier)
• Which of the following pair of gates can form a latch?
• Using DeMorgan’s Theorem we can convert any AND-OR structure into
• Which microprocessor accepts the program written for 8086 without any changes?
• Microprocessor is a/an circuit that functions as the CPU of the compute
• The character set of Fortran 77 includes lower case alphabets a to z.
• The main concerns of the are to define a flexible set of commands
• In 8086 the overflow flag is set when .
• In a C expression using assignment operators, relational operators and arithmetic operators, the hierarchy of operations (in the absence of parenthesis) is
• To perform any operations, the Mp should identify the