Q. Variable in Boolean expressions can be expressed as

View solution

Q. Circuit that is said to be universal gate is

View solution

Q. The connection from output to one of input gate is

View solution

Q. In NAND logic analysis procedure application requires repeated application of

View solution

Q. Circuits whose output depends on directly present input is called

View solution

Q. Full subtract circuits have

View solution

Q. In designing a combinational circuits, truth table defines the relationship of

View solution

Q. The most significant bit of arithmetic addition is called

View solution

Q. Flip flop are constructed using

View solution

Q. Two bit addition is done by

View solution

Q. AND gates are converted to NAND gates using

View solution

Q. In don't cares map input are marked by

View solution

Q. OR operation is achieved through a NAND gate with Additional

View solution

Q. The simplified expression of half subtractor borrow is

View solution

Q. The analysis of combinational circuits is a

View solution

Q. The simplified expression of full subtractor borrow is

View solution

Q. OR gates are converted to NAND gates using

View solution

Q. To implement the Boolean function with NAND gates we convert the function to

View solution

Q. Designing combinational circuits we consider?

View solution

Q. Full adder performs addition on

View solution