Circuit A is a 1-bit adder; circuit B is a 1 bit multiplier.<BR>[Hint: Construct the truth table for the adder and the multiplier]
Circuit A has more gates than circuit B ✘ Circuit B has more gates than circuit A ✘ Circuit A has the same number of gates as circuit B ✘ None of the above ✔
Forces the assembler to reserve one byte of memory ✘ Forces the assembler to reserve a specified number of bytes in the memory ✘ Forces the assembler to reserve a specified number of consecutive bytes in the memory ✘ None of the above ✔
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
Set of {AND,OR} ✘ Set of {EXOR, NOT} ✘ Set of {AND,OR,NOT} ✘ None of the above ✔
In a C expression using assignment operators, relational operators and arithmetic operators, the hierarchy of operations (in the absence of parenthesis) is