As per idempotent law, X + X will always be equal to ________(a) 0(b) 1(c) X(d) 2XThis question was addressed to me during an online interview.This interesting question is from Fundamental Concepts & Postulates in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

As per idempotent law, X + X will always be equal to ________(a) 0(b)

1.	As per idempotent law, X + X will always be equal to ________(a) 0(b) 1(c) X(d) 2XThis question was addressed to me during an online interview.This interesting question is from Fundamental Concepts & Postulates in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The CORRECT option is (c) X Easiest explanation: It will always return the same value X. SINCE, boolean DEALS with only two NUMBERS 0 and 1, if we add 0+0, the ANSWER is 0. Similarly, if we add 1+1 the answer is 1.

Discussion

No Comment Found

Related InterviewSolutions

The expression of a NAND gate is_______(a) A.B(b) A’B+AB’(c) (A.B)’(d) (A+B)’I got this question in homework.I'd like to ask this question from Universal Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Which of the following correctly describes the distributive law.(a) ( A+B)(C+D)=AB+CD(b) (A+B).C=AC+BC(c) (AB)(A+B)=AB(d) (A.B)C=AC.ABThis question was addressed to me by my college professor while I was bunking the class.The doubt is from Universal Gates topic in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
The ________ gate is an OR gate followed by a NOT gate.(a) NAND(b) EXOR(c) NOR(d) EXNORI got this question in an interview for internship.My question is taken from Universal Gates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Number of outputs in a half adder _____________(a) 1(b) 2(c) 3(d) 0The question was posed to me during an interview.My question is taken from Universal Gates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
How many AND gates are required to realize the following expression Y=AB+BC?(a) 4(b) 8(c) 1(d) 2I had been asked this question in class test.My enquiry is from Universal Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals
The complement of the input given is obtained in case of:(a) NOR(b) AND+NOR(c) NOT(d) EX-ORI got this question in a job interview.The question is from Universal Gates topic in division Boolean Algebra and Logic Circuits of Computer Fundamentals
The following figure shows a ___________ gate.(a) NOR(b) NAND(c) EXOR(d) ORI have been asked this question by my school principal while I was bunking the class.Asked question is from Universal Gates topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals
The Output is LOW if any one of the inputs is HIGH in case of a _________ gate.(a) NOR(b) NAND(c) OR(d) ANDI had been asked this question by my college professor while I was bunking the class.I'd like to ask this question from Universal Gates topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals
A ____________ is a circuit with only one output but can have multiple inputs.(a) Logic gate(b) Truth table(c) Binary circuit(d) Boolean circuitThis question was addressed to me by my college professor while I was bunking the class.The doubt is from Universal Gates in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
There are 5 universal gates.(a) True(b) FalseI have been asked this question in an internship interview.My question is taken from Universal Gates in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

As per idempotent law, X + X will always be equal to ________(a) 0(b) 1(c) X(d) 2XThis question was addressed to me during an online interview.This interesting question is from Fundamental Concepts & Postulates in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment