Scribd
Upload
191 views

Gate Assignment

The document contains questions and answers about binary numbers, Boolean logic gates, and their truth tables. i. It converts the decimal number 937 to binary as 1110101001. It also converts 256 to binary as 100000000. ii. It gives the truth tables for the Boolean expressions (X.Y)+Y and (X⊕Y)'+W. iii. It explains that an XNOR gate outputs 1 only when all its inputs are the same (both 0 or both 1), otherwise it outputs 0. It provides the truth table and logic symbol for a 2-input XNOR gate. iv. It defines NAND and NOR gates, providing their logic symbols and truth tables for

Uploaded by

Atta Ur Rahman Afridi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
191 views

Gate Assignment

The document contains questions and answers about binary numbers, Boolean logic gates, and their truth tables. i. It converts the decimal number 937 to binary as 1110101001. It also converts 256 to binary as 100000000. ii. It gives the truth tables for the Boolean expressions (X.Y)+Y and (X⊕Y)'+W. iii. It explains that an XNOR gate outputs 1 only when all its inputs are the same (both 0 or both 1), otherwise it outputs 0. It provides the truth table and logic symbol for a 2-input XNOR gate. iv. It defines NAND and NOR gates, providing their logic symbols and truth tables for

Uploaded by

Atta Ur Rahman Afridi
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Assignment # 1

Q.A: convert the following into binary number system.


i. the last three digits of your Roll no?
ii. 256
Answer. I:
(937)10 = (?)2
2 937
2 468 1
2 234 0
2 117 0
2 58 1
2 29 0
2 14 1
2 7 0
2 3 1
1 1
Thus ,
(937)10 = (1110101001)2
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
ii. (256)10 = (?)20
Answer;
2 256 Thus ,
2 128 0
2 64 0 (256)10 = (100000000)2
2 32 0
2 16 0
2 8 0
2 4 0
2 2 0
1 0
Q .B: X,Y and Z are Boolean variables. Determine the truth table for
the following combinations?

i. (X.Y) + y
Truth table:
X Y (X.Y) Z= (X.Y)+Y
0 0 0 0
0 1 0 1
1 0 0 0
1 1 1 1
0 0 0 0
0 1 0 1

ii. Z=(x y)’ + w


Truth table:

X Y W (XY)’ Z=(XY)’+W
0 0 0 0 0
0 0 1 0 1
0 1 0 1 1
0 1 1 1 1
1 0 0 1 1
1 0 1 1 1
1 1 0 0 0
1 1 1 0 1
Q.C: what is X.NOR gate. Explain with truth table?
Answer;
The 'Exclusive-NOR' gate circuit does the opposite to the EOR gate. It will
give a low output if either, but not both, of its two inputs are high. The symbol is an
EXOR gate with a small circle on the output. The small circle represents inversion
Basically the “Exclusive-NOR” gate is a combination of the Exclusive-
OR gate and the NOT gate but has a truth table similar to the standard NOR
gate in that it has an output that is normally at logic level “1” and goes “LOW”
to logic level “0” when ANY of its inputs are at logic level “1”.
However, an output “1” is only obtained if BOTH of its inputs are at the same
logic level, either binary “1” or “0”. For example, “00” or “11”. This input
combination would then give us the Boolean expression
of: Q = (A ⊕ B) = A.B + A.B
Then the output of a digital logic Exclusive-NOR gate ONLY goes “HIGH”
when its two input terminals, A and B are at the “SAME” logic level which can
be either at a logic level “1” or at a logic level “0”. In other words, an even
number of logic “1’s” on its inputs gives a logic “1” at the output, otherwise is
at logic level “0”.
Then this type of gate gives and output “1” when its inputs are “logically equal”
or “equivalent” to each other, which is why an Exclusive-NOR gate is
sometimes called an Equivalence Gate.
The logic symbol for an Exclusive-NOR gate is simply an Exclusive-OR gate
with a circle or “inversion bubble”, ( ο ) at its output to represent the NOT
function. Then the Logic Exclusive-NOR Gate is the reverse or
“Complementary” form of the Exclusive-OR gate, (A ⊕ B) we have seen
previously.

Ex-NOR Gate Equivalent


The Exclusive-NOR Gate, also written as: “Ex-NOR” or “XNOR”, function is
achieved by combining standard gates together to form more complex gate
functions and an example of a 2-input Exclusive-NOR gate is given below.

>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
Q.D: what is NAND and NOR gate. Explain with truth table?

1. NAND gate;
This is a NOT-AND gate which is equal to an AND gate followed by a NOT
gate. The outputs of all NAND gates are high if any of the inputs are low. The
symbol is an AND gate with a small circle on the output would be used. The small
circle represents inversion.

Truth table;
2 input NAND gate
A B A+B
0 0 1
0 1 1
1 0 1
1 1 0

2. NOR gate;
This is a NOT-OR gate which is equal to an OR gate followed by a NOT
gate. The outputs of all NOR gates are low if any of the inputs are high.
The symbol is an OR gate with a small circle on the output would be used. The small
circle represents inversion.

Truth table;

2 inputs NOR gate


A B A+B
0 0 1
0 1 0
1 0 0
1 1 0

You might also like