50 + Interview Questions in Boolean Algebra And Logic Circuits in Computer Fundamentals Page 1 InterviewSolution

1.	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
Answer» The correct answer is (C) (A.B)’ Best explanation: A NAND gate is an AND gate followed by a NOT gate. It therefore INVERTS the output of an AND gate. NAND gate is ALSO a universal gate.

Discussion

2.	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
Answer» The correct OPTION is (B) (A+B).C=AC+BC Explanation: The second option correctly describes the distributive law. (A+B).C =AC+BC. Boolean LAWS are used to implementing and simplifying Boolean EXPRESSION.

Discussion

3.	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
Answer» Correct option is (c) NOR The best explanation: A NOR gate is a UNIVERSAL gate which is an OR gate FOLLOWED by a NOT gate. It therefore reverses the output OBTAINED by an OR gate. It can be used to IMPLEMENT any BOOLEAN expression.

Discussion

4.	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
Answer» CORRECT answer is (b) 2 The best I can explain: A HALF adder GIVES two outputs. One is called the SUM and the other is carry. Half adder can be IMPLEMENTED using an EXOR gate and an AND gate.

Discussion

5.	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
Answer» Correct choice is (d) 2 Explanation: 2 AND GATES are required to realize the expression. 1 AND gate will be used to connect the inputs A and B whereas the other will be used to connect the inputs B and C.

Discussion

6.	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
Answer» The correct ANSWER is (c) NOT Easiest EXPLANATION: The NOT gate, also called as the inverter gate is used to reverse the INPUT which is given. It gives an inverted output, thus gives the complement. Expression for NOT gate: Y=A’, where A is the input.

Discussion

7.	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
Answer» The CORRECT choice is (a) NOR For explanation: The figure is that of a NOR GATE. The BUBBLE SIGNIFIES that it is a NOR gate. It is a type of universal gate and can be used to implement all the boolean EXPRESSIONS.

Discussion

8.	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
Answer» Right answer is (b) NAND Easy explanation: In CASE of a NAND GATE the output is LOW if any one of the INPUTS is HIGH (i.e. 1). It gives a HIGH output only in one case when all the inputs GIVEN to it are LOW.

Discussion

9.	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
Answer» Right ANSWER is (a) Logic GATE Best EXPLANATION: A logic gate is used to evaluate a Boolean expression. It can have MULTIPLE inputs but can have only ONE output. The different types of logic gates are AND, OR, NOT etc.

Discussion

10.	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
Answer» Right option is (B) False To explain: There are only 2 main universal gates: NAND and NOR. A NAND GATE as well as the NOR gate can be used to implement any other BOOLEAN expression thus it is called as a universal gate.

Discussion

11.	The expression of an EXOR gate is ____________(a) A’B+AB’(b) AB+A’B’(c) A+A.B(d) A’+B’The question was asked in exam.Enquiry is from Logic Gates topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right choice is (a) A’B+AB’ EASIEST explanation: The expression for an EXOR gate is A’B+AB’. An EXOR gate is nothing but an EXCLUSIVE OR gate.

Discussion

12.	The gate which is called an inverter is called _________(a) NOR(b) NAND(c) EXOR(d) NOTI have been asked this question in a job interview.My enquiry is from Logic Gates topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct answer is (d) NOT The explanation: Inverter is used to reverse the OUTPUT. A NOT GATE is used to invert or CHANGE the output from 0 to 1 and vice-versa.

Discussion

13.	The universal gate that can be used to implement any Boolean expression is __________(a) NAND(b) EXOR(c) OR(d) ANDI got this question in a job interview.My query is from Logic Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Correct ANSWER is (a) NAND The best EXPLANATION: NAND gate can be used to implement any BOOLEAN expression. It is a universal gate. A universal gate can be used to implement any other Boolean function WITHOUT using any other LOGIC gate.

Discussion

14.	When logic gates are connected to form a gating/logic network it is called as a ______________ logic circuit.(a) combinational(b) sequential(c) systematic(d) hardwiredI have been asked this question in quiz.I would like to ask this question from Logic Gates topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Correct OPTION is (a) combinational For explanation: It is referred to as a combinational circuit as it comprises a number of gates. It is connected to EVALUATE a RESULT of a BOOLEAN expression.

Discussion

15.	Which of the following gate will give a 0 when both of its inputs are 1?(a) AND(b) OR(c) NAND(d) EXORI got this question in an interview for internship.This interesting question is from Logic Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The CORRECT answer is (c) NAND Easiest explanation: The NAND gate gives 0 as the OUTPUT when both of its INPUTS are 1 or any one of the INPUT is 1. It RETURNS a 1 only if both the inputs are 0.

Discussion

16.	The boolean expression of an OR gate is _______(a) A.B(b) A’B+AB’(c) A+B(d) A’B’I had been asked this question during an interview.This is a very interesting question from Logic Gates topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» CORRECT ANSWER is (c) A+B Explanation: An OR gate GIVES the result as 1 if any one of the inputs is one. Its expression is A+B. An ORGATE gives a 0 only if both the inputs are 0.

Discussion

17.	The gate which is used to reverse the output obtained is _____(a) NOR(b) NAND(c) EXOR(d) NOTI have been asked this question in a job interview.This intriguing question originated from Logic Gates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right OPTION is (d) NOT The best I can explain: NOT GATE is USED to reverse the output from 0 to 1 and vice-versa. The Boolean expression for NOT gate is Y=A’. Therefore, it GIVES the complement of the result obtained.

Discussion

18.	A__________ gate gives the output as 1 only if all the inputs signals are 1.(a) AND(b) OR(c) EXOR(d) NORThe question was posed to me in an interview for job.This question is from Logic Gates in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right answer is (a) AND For EXPLANATION I would say: The AND GATE gives a 1 only if all the input signals are 1. The Boolean EXPRESSION for EVALUATING an AND signal is: Y=A.B.

Discussion

19.	Logic Gates are the building blocks of all circuits in a computer.(a) True(b) FalseI have been asked this question by my college director while I was bunking the class.This interesting question is from Logic Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right answer is (a) True To EXPLAIN: The statement is true. Logic gates are idealized to IMPLEMENT a BOOLEAN function in all circuits of a computer. The signals are directed as PER the outputs of the logic gates in the form of 0 and 1.

Discussion

20.	Electronic circuits that operate on one or more input signals to produce standard output_______(a) Series circuits(b) Parallel Circuits(c) Logic Signals(d) Logic GatesThe question was posed to me in exam.My doubt is from Logic Gates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» RIGHT choice is (d) Logic Gates To EXPLAIN I WOULD say: The logic gates operate on one or more input signals to PRODUCE a standard output. Logic gates give the output in the form of 0 and 1. The Boolean algebra can be applied to the logic gates.

Discussion

21.	The output of AND gates in the SOP expression is connected using the ________ gate.(a) XOR(b) NOR(c) AND(d) ORI had been asked this question by my school teacher while I was bunking the class.This intriguing question comes from SOP & POS in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The CORRECT ANSWER is (d) OR The explanation: SINCE the product terms or the min terms are added in an SOP expression. Therefore, the OR GATE is USED to connect the AND gates.

Discussion

22.	The expression A+BC is thereduced form of ______________(a) AB+BC(b) (A+B)(A+C)(c) (A+C)B(d) (A+B)CThis question was posed to me during an interview.This is a very interesting question from SOP & POS topic in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The CORRECT CHOICE is (b) (A+B)(A+C) Easy explanation: The SECOND OPTION is correct. It can simplified as FOLLOWS: (A+B)(A+C) =AA+AC+AB+BC =A+AC+AB+BC =A(1+C)+AB+BC =A+AB+BC =A(1+B)+BC =A+BC.

Discussion

23.	The number of cells in a K-map with n-variables.(a) 2n(b) n^2(c) 2^n(d) nThe question was asked in an interview for job.My question is from SOP & POS topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right ANSWER is (c) 2^n Easiest explanation: K-map is NOTHING but Karnaugh map. SOP and POS expressions can be SIMPLIFIED using the K-map. The number of cells in case of n-variables=2^n.

Discussion

24.	The number of min terms for an expression comprising of 3 variables?(a) 8(b) 3(c) 0(d) 1This question was addressed to me in an interview for internship.This intriguing question originated from SOP & POS in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» CORRECT option is (a) 8 The best I can EXPLAIN: If any expression comprises of n VARIABLES, its corresponding MIN terms are GIVEN by 2^n. Here, n=3 since there are 3 variables therefore, min terms=2^3=8.

Discussion

25.	Which operation is shown in the following expression: (X+Y’).(X+Z).(Z’+Y’)(a) NOR(b) ExOR(c) SOP(d) POSThis question was addressed to me in a national level competition.I'd like to ask this question from SOP & POS topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» CORRECT ANSWER is (c) SOP To elaborate: The expression comprises of MAX TERMS. Also, the terms are ANDed together, therefore it is a POS term.

Discussion

26.	LSI stands for___________(a) Large Scale Integration(b) Large System Integration(c) Large Symbolic Instruction(d) Large Symbolic IntegrationI had been asked this question in quiz.I'm obligated to ask this question of SOP & POS in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct option is (a) LARGE SCALE INTEGRATION The best I can explain: It STANDS for large scale integration. This is the abstraction LEVEL of the integrated circuits. It can also be small scale, medium, large or very large scale integration.

Discussion

27.	The corresponding min term when x=0, y=0 and z=1.(a) x.y.z’(b) X’+Y’+Z(c) X+Y+Z’(d) x’.y’.zThe question was posed to me in an interview for job.This intriguing question comes from SOP & POS in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right ANSWER is (d) x’.y’.z Best EXPLANATION: The MIN term is obtained by taking the complement of the ZERO values and taking the term with value 1 as it is. Here, x=0,y=0 and z=1, then the min term is x’y’z.

Discussion

28.	Which of the following is an incorrect SOP expression?(a) x+x.y(b) (x+y)(x+z)(c) x(d) x+yThe question was asked in quiz.This interesting question is from SOP & POS in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct answer is (b) (x+y)(x+z) For EXPLANATION I WOULD say: The second expression is incorrect because it consists of TWO maxterms ANDed together. This MAKES it a POS or the product of SUM expression. Other options are valid SOP expressions.

Discussion

29.	A sum of products expression is a product term (min term) or several min terms ANDed together.(a) True(b) FalseI had been asked this question at a job interview.My question is taken from SOP & POS topic in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Correct OPTION is (b) False Easy explanation: The statement is partially correct. A SUM of products expression is a product term (min term) or SEVERAL min terms OR ed(i.e. ADDED) TOGETHER.

Discussion

30.	The min term when X=Y=Z=0 is_____________(a) x’+y’+z’(b) xyz(c) x’y’z’(d) x+y+zI had been asked this question by my school principal while I was bunking the class.This interesting question is from Boolean Functions in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» CORRECT answer is (c) X’y’z’ The best I can EXPLAIN: There MINTERM expression is obtained using the AND TERM. Here, when X=Y=Z=0, the expression obtained is x’y’z’.

Discussion

31.	The terms in SOP are called___________(a) max terms(b) min terms(c) mid terms(d) sum termsThis question was addressed to me at a job interview.My question is from SOP & POS in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right ANSWER is (B) MIN terms The best I can explain: The SOP is the sum of products. It consists of min terms often called the product terms. Similarly, POS consists of MAX terms.

Discussion

32.	The max term when X=Y=Z=1 is ________(a) x’+y’+z’(b) xyz(c) x’y’z’(d) x+y+zThe question was asked in class test.My question is taken from Boolean Functions in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The CORRECT ANSWER is (a) x’+y’+z’ The best I can EXPLAIN: The max term consists of VARIABLES forming an OR term.Here, when X=Y=Z=1, the expression is x’+y’+z’.

Discussion

33.	The minterm of any expression is denoted by___________(a) Mt(b) m(c) M(d) minThis question was addressed to me in unit test.The query is from Boolean Functions in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The CORRECT option is (b) m The best I can EXPLAIN: The variables forming an AND term is generally the minterm.It is denoted by m. (LOWER CASE letter).

Discussion

34.	What is the complement of X’Y’Z?(a) X+YZ(b) X’+Y+’Z’(c) X+Y+Z’(d) XYZ’The question was posed to me in quiz.The question is from Boolean Functions in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Correct CHOICE is (c) X+Y+Z’ To ELABORATE: The COMPLEMENT is obtained by converting the complement terms to normal terms and VICE versa. Also, the OR and AND OPERATORS are interchanged. Here, X’Y’Z gets converted to X+Y+Z’.

Discussion

35.	The complement term for X’.Y’.Z + X.Y will be _____________(a) XYZ’+X’Y’(b) (X+Y+Z’)(X’+Y’)(c) (X+Y+Z’)(X’+Y)(d) (X+Y+Z’)(X’+Y)This question was posed to me during an interview.Query is from Boolean Functions in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct choice is (B) (X+Y+Z’)(X’+Y’) BEST EXPLANATION: The OR andAND operators are interchanged. The complement terms are reduced to normal terms and the result is obtained.

Discussion

36.	The number of literals in the expression F=X.Y’ +Z are _____________(a) 4(b) 3(c) 2(d) 1The question was posed to me at a job interview.This interesting question is from Boolean Functions topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The CORRECT answer is (b) 3 Explanation: Literals the generally the NUMBER of variables used in any boolean expression. Here, since there are 3 variables X, Y and Z, THEREFORE the answer is 3.

Discussion

37.	The general form for calculating the number of rows in a truth table is ________(a) 2^n(b) 2^n+1(c) 2^n(d) 2^n+1This question was addressed to me in a job interview.The query is from Boolean Functions in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right option is (C) 2^N The explanation: The GENERAL form for the calculation of ROWS in a truth table is 2^n . Here, n= number of literals in the function.

Discussion

38.	In the boolean function w=f(X,Y,Z), what is the RHS referred to as ________(a) right hand side(b) expression(c) literals(d) booleanI have been asked this question in an interview for internship.This intriguing question originated from Boolean Functions in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Correct option is (b) expression Easy explanation: The RHS is COMMONLY REFERRED to as the expression. The SYMBOLS X, Y and Z are commonly referred to as the literals of the function.

Discussion

39.	The result of X+X.Y is X.(a) True(b) FalseI got this question in an interview for internship.This key question is from Boolean Functions in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct option is (a) True For explanation: This is a BOOLEAN EXPRESSION. It can be EVALUATED as : X+X.Y= X(1+Y) = X. Since 1+Y=1 by boolean laws.

Discussion

40.	Boolean Function is of the form of ________(a) Truth values(b) K=f(X,Y,X)(c) Algebraic Expression(d) Truth TableI got this question in exam.I want to ask this question from Boolean Functions in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Correct choice is (a) Truth values The explanation is: The boolean function is of the FORM of ALGEBRAIC expressions or truth table. A boolean function is of the form as that of option 2. The RESULT obtained from a boolean function can be a truth value or a FALLACY.

Discussion

41.	Truth table is used to represent Boolean__________(a) functions(b) algebra(c) operators(d) additionI had been asked this question during an online exam.The origin of the question is Fundamental Concepts & Postulates topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct choice is (a) FUNCTIONS The best EXPLANATION: The BOOLEAN functions are REPRESENTED using the truth tables. Truth tables represent the tautology and fallacy for terms.

Discussion

42.	The expression for involution law is_________(a) x+y=y+x(b) x+1=1(c) (x’)’=x(d) x.x=xThis question was addressed to me during an interview.This intriguing question comes from Fundamental Concepts & Postulates topic in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» RIGHT OPTION is (c) (x’)’=x To elaborate: The INVOLUTION law states that the COMPLEMENT of complement of a number is the number itself. The THIRD option justifies the statement. Thus, (x’)’=x.

Discussion

43.	Who proposed the use of Boolean algebra in the design of relay switching circuits?(a) George Boole(b) Claude E. Shannon(c) Claude E. Boole(d) George ShannonThe question was posed to me by my college director while I was bunking the class.My question is taken from Fundamental Concepts & Postulates topic in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct answer is (B) Claude E. SHANNON For EXPLANATION: Claude E Shannon suggested the USE of Boolean in relay switching circuits. George Boole, a mathematician introduced it for simplifying representations and manipulation of propositional logic.

Discussion

44.	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

45.	Which of the following is false?(a) x+y=y+x(b) x.y=y.x(c) x.x’=1(d) x+x’=1I had been asked this question during an online interview.I need to ask this question from Fundamental Concepts & Postulates topic in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right answer is (C) x.x’=1 The explanation is: The first and second option describes the COMMUTATIVE law. The fourth option holds true since if x=1, then x’=0, and x+x’=1. Third option is incorrect because on multiplication of a boolean VALUE with its COMPLEMENT the result will always be 0.

Discussion

46.	In the expression Y + X’.Y, which operator will be evaluated first?(a) ‘(b) +(c) .(d) ,This question was addressed to me during an interview.I want to ask this question from Fundamental Concepts & Postulates topic in division Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Correct OPTION is (a) ‘ EXPLANATION: In BOOLEAN Algebra, complement of a number is given the highest precedence. THEREFORE, complement which is denoted by the ‘ (apostrophe) SYMBOL is evaluated first.

Discussion

47.	Which operator has the highest precedence?(a) +(b) .(c) !(d) *I have been asked this question in quiz.I want to ask this question from Fundamental Concepts & Postulates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» Right ANSWER is (c) ! To elaborate: The NOT OPERATOR has the HIGHEST precedence. It is DENOTED by ! or – sign. Further, AND (.) OPERATIONS are performed and then the OR terms are evaluated.

Discussion

48.	The symbol + in Boolean is also known as the ____________ operator.(a) AND(b) OR(c) ADD(d) SUMMATIONI have been asked this question in homework.I'm obligated to ask this question of Fundamental Concepts & Postulates topic in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct answer is (b) OR To explain: The SYMBOL + is also CALLED as the OR operator.It is USED for LOGICAL addition. It follows the law of binary addition.

Discussion

49.	Boolean Algebra can deal with any number system.(a) True(b) FalseI had been asked this question in semester exam.Enquiry is from Fundamental Concepts & Postulates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» The correct option is (b) False The BEST I can explain: BOOLEAN Algebra can only be used with the binary number SYSTEM. Boolean deals with only TWO values 0 and 1. In Boolean System, if the RESULT is tautology it returns 1 otherwise 0.

Discussion

50.	The number of values applicable in Boolean Algebra.(a) 1(b) 2(c) 3(d) 4This question was addressed to me during an online interview.The doubt is from Fundamental Concepts & Postulates topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals
Answer» RIGHT CHOICE is (b) 2 To explain: Boolean algebra is based on binary number system. It therefore comprises only 2 bits : 0 and 1. Hence, only two values are APPLICABLE to Boolean algebra.

Discussion

Explore topic-wise InterviewSolutions in .

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

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

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

The expression of an EXOR gate is ____________(a) A’B+AB’(b) AB+A’B’(c) A+A.B(d) A’+B’The question was asked in exam.Enquiry is from Logic Gates topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

The gate which is called an inverter is called _________(a) NOR(b) NAND(c) EXOR(d) NOTI have been asked this question in a job interview.My enquiry is from Logic Gates topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

The universal gate that can be used to implement any Boolean expression is __________(a) NAND(b) EXOR(c) OR(d) ANDI got this question in a job interview.My query is from Logic Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals

Which of the following gate will give a 0 when both of its inputs are 1?(a) AND(b) OR(c) NAND(d) EXORI got this question in an interview for internship.This interesting question is from Logic Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals

The boolean expression of an OR gate is _______(a) A.B(b) A’B+AB’(c) A+B(d) A’B’I had been asked this question during an interview.This is a very interesting question from Logic Gates topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals

The gate which is used to reverse the output obtained is _____(a) NOR(b) NAND(c) EXOR(d) NOTI have been asked this question in a job interview.This intriguing question originated from Logic Gates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

A__________ gate gives the output as 1 only if all the inputs signals are 1.(a) AND(b) OR(c) EXOR(d) NORThe question was posed to me in an interview for job.This question is from Logic Gates in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

Logic Gates are the building blocks of all circuits in a computer.(a) True(b) FalseI have been asked this question by my college director while I was bunking the class.This interesting question is from Logic Gates in section Boolean Algebra and Logic Circuits of Computer Fundamentals

The expression A+BC is thereduced form of ______________(a) AB+BC(b) (A+B)(A+C)(c) (A+C)B(d) (A+B)CThis question was posed to me during an interview.This is a very interesting question from SOP & POS topic in division Boolean Algebra and Logic Circuits of Computer Fundamentals

The number of cells in a K-map with n-variables.(a) 2n(b) n^2(c) 2^n(d) nThe question was asked in an interview for job.My question is from SOP & POS topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

The number of min terms for an expression comprising of 3 variables?(a) 8(b) 3(c) 0(d) 1This question was addressed to me in an interview for internship.This intriguing question originated from SOP & POS in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

Which operation is shown in the following expression: (X+Y’).(X+Z).(Z’+Y’)(a) NOR(b) ExOR(c) SOP(d) POSThis question was addressed to me in a national level competition.I'd like to ask this question from SOP & POS topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals

LSI stands for___________(a) Large Scale Integration(b) Large System Integration(c) Large Symbolic Instruction(d) Large Symbolic IntegrationI had been asked this question in quiz.I'm obligated to ask this question of SOP & POS in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

The corresponding min term when x=0, y=0 and z=1.(a) x.y.z’(b) X’+Y’+Z(c) X+Y+Z’(d) x’.y’.zThe question was posed to me in an interview for job.This intriguing question comes from SOP & POS in division Boolean Algebra and Logic Circuits of Computer Fundamentals

Which of the following is an incorrect SOP expression?(a) x+x.y(b) (x+y)(x+z)(c) x(d) x+yThe question was asked in quiz.This interesting question is from SOP & POS in section Boolean Algebra and Logic Circuits of Computer Fundamentals

A sum of products expression is a product term (min term) or several min terms ANDed together.(a) True(b) FalseI had been asked this question at a job interview.My question is taken from SOP & POS topic in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

The min term when X=Y=Z=0 is_____________(a) x’+y’+z’(b) xyz(c) x’y’z’(d) x+y+zI had been asked this question by my school principal while I was bunking the class.This interesting question is from Boolean Functions in section Boolean Algebra and Logic Circuits of Computer Fundamentals

The terms in SOP are called___________(a) max terms(b) min terms(c) mid terms(d) sum termsThis question was addressed to me at a job interview.My question is from SOP & POS in section Boolean Algebra and Logic Circuits of Computer Fundamentals

The max term when X=Y=Z=1 is ________(a) x’+y’+z’(b) xyz(c) x’y’z’(d) x+y+zThe question was asked in class test.My question is taken from Boolean Functions in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

The minterm of any expression is denoted by___________(a) Mt(b) m(c) M(d) minThis question was addressed to me in unit test.The query is from Boolean Functions in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

What is the complement of X’Y’Z?(a) X+YZ(b) X’+Y+’Z’(c) X+Y+Z’(d) XYZ’The question was posed to me in quiz.The question is from Boolean Functions in division Boolean Algebra and Logic Circuits of Computer Fundamentals

The number of literals in the expression F=X.Y’ +Z are _____________(a) 4(b) 3(c) 2(d) 1The question was posed to me at a job interview.This interesting question is from Boolean Functions topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals

The general form for calculating the number of rows in a truth table is ________(a) 2^n(b) 2^n+1(c) 2^n(d) 2^n+1This question was addressed to me in a job interview.The query is from Boolean Functions in division Boolean Algebra and Logic Circuits of Computer Fundamentals

The result of X+X.Y is X.(a) True(b) FalseI got this question in an interview for internship.This key question is from Boolean Functions in division Boolean Algebra and Logic Circuits of Computer Fundamentals

Boolean Function is of the form of ________(a) Truth values(b) K=f(X,Y,X)(c) Algebraic Expression(d) Truth TableI got this question in exam.I want to ask this question from Boolean Functions in section Boolean Algebra and Logic Circuits of Computer Fundamentals

Truth table is used to represent Boolean__________(a) functions(b) algebra(c) operators(d) additionI had been asked this question during an online exam.The origin of the question is Fundamental Concepts & Postulates topic in section Boolean Algebra and Logic Circuits of Computer Fundamentals

The expression for involution law is_________(a) x+y=y+x(b) x+1=1(c) (x’)’=x(d) x.x=xThis question was addressed to me during an interview.This intriguing question comes from Fundamental Concepts & Postulates topic in division 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

Which of the following is false?(a) x+y=y+x(b) x.y=y.x(c) x.x’=1(d) x+x’=1I had been asked this question during an online interview.I need to ask this question from Fundamental Concepts & Postulates topic in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

In the expression Y + X’.Y, which operator will be evaluated first?(a) ‘(b) +(c) .(d) ,This question was addressed to me during an interview.I want to ask this question from Fundamental Concepts & Postulates topic in division Boolean Algebra and Logic Circuits of Computer Fundamentals

Which operator has the highest precedence?(a) +(b) .(c) !(d) *I have been asked this question in quiz.I want to ask this question from Fundamental Concepts & Postulates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

The symbol + in Boolean is also known as the ____________ operator.(a) AND(b) OR(c) ADD(d) SUMMATIONI have been asked this question in homework.I'm obligated to ask this question of Fundamental Concepts & Postulates topic in chapter Boolean Algebra and Logic Circuits of Computer Fundamentals

Boolean Algebra can deal with any number system.(a) True(b) FalseI had been asked this question in semester exam.Enquiry is from Fundamental Concepts & Postulates in portion Boolean Algebra and Logic Circuits of Computer Fundamentals

The number of values applicable in Boolean Algebra.(a) 1(b) 2(c) 3(d) 4This question was addressed to me during an online interview.The doubt is from Fundamental Concepts & Postulates topic in portion Boolean Algebra and Logic Circuits of Computer Fundamentals