Bissoy.com
Doctors Medicines MCQs Q&A

What is the minimum number of 2 Input NAND Gate required to make a 2 Input XOR gate?

What is the minimum number of 2 Input NAND Gate required to make a 2 Input XOR gate? Correct Answer 4

The minimum number of 2 Input NAND Gate required to make a 2 Input XOR gate is 4. This process is of making XOR gate using NAND gate is called realisation of XOR gate using NAND gate. NAND gate is a universal gate and can be used to design any logic gate.

Related Questions

In AES, to make the s-box, we apply the transformation b’_i = b_i XOR b_(i+4) XOR b(i+5) XOR b_(i+6) XOR b_(i+7) XOR c_i What is c_i in this transformation?
In AES, to make the s-box, we apply the transformation – b’i = bi XOR b(i+4) XOR b(i+5) XOR b(i+6) XOR b(i+7) XOR ci What is ci in this transformation?
Which of the following circuits are equivalent (i.e., they produce the same output for all inputs)? F = ab + bc + ca G = (a + b) (b + c) (c + a) H = NAND (NAND(a, b), NAND(b, c), NAND(c, a))
Each of the question below consists of a question and three statements number I, II and III given below it. You have to decide whether the data provided in the statement are sufficient to answer the question. Two person X and Y together can make 25% of total number of bricks in 4.8 days. Another person Z can make 50 bricks in a day. What is the time taken by person X and Z together to make the total number of bricks? I. Dimensions of a brick is (3cm × 4cm × 5cm) while the dimension of a cuboids when all the bricks are put together is (72cm × 80cm × 50cm) and ratio of number of days taken by X and Y alone to make the total number of bricks is 3 : 2. II. The total number of bricks is 4800 and person Y can make 150 bricks in day. III. Total volume of all the bricks together is 1.008m3 and dimension of a bricks is (5cm × 6cm × 7cm) and time taken by Z to make total number of bricks is 200 % more than the total time taken by person Y to make total number of bricks.
Which of the following statements are true? i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices. ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don’t contain literal pointers iii)in order to calculate the address of the next node you need to remember the address of the previous node iv)xor lists are much efficient than single, doubly linked lists and arrays
The inverse s-box permutation follows, b’_i = b_(i+2) XOR b(i+5) XOR b_(i+7) XOR d_i Here d_i is
The Chi function is defined as ← a XOR ( aXOR 1) AND a) b) a ← a AND ( aXOR 1) AND a) c) a ← a AND ( a XOR a) d) a ← a XOR ( a AND a)
The inverse s-box permutation follows, b’i = b(i+2) XOR b(i+5) XOR b(i+7) XOR di Here di is –
How many NAND gates are required to make an XOR gate?
একটি XOR লজিক গেট নিম্নলিখিত কোন লজিক গেট/ গেটগুলোর সমবায়ে গঠিত হতে পারে? (An XOR logic gate can be constructed from the combination of which of the following logic gate/gates?)