DMC rd) Boolean Algebra Questions Latest Boolean Algebra MCQ Objective Questions a & Tee are poe eli Slam eel) (Ce Che Ld) riod os i Et Cres ear Download App Question 1: View this Question Online > Which logic gate is represented by following circuit? A, B 2. AND 3. NAND 4. NOT >‘coaching Ky ners for all govt. exams Ute measles | ceo dee Answer (Detailed Solution Below) Option 2: AND Boolean Algebra Question 1 Detailed Solution When two switches are connected in parallel, then the circuit acts as an OR gate A y. L The input X is connected to output Y when at least one of the switch A and Switch B is closed, A B Y Open (0) | Open (0) | OFF (0) Open (0) | Close (1) | ON (1) Close (1) | Open (0) | ON (1) Close (1) | Close (1) | ON (1) From the above truth table, the circuit diagram (pA on OR gate ie. (A +B) When two switches are connected in series, then the circuit acts as an AND gate. X—— Hh ==h —yY A Now, the input X is connected to output Y when both the switch A and Switch B are closed.A B Y Open (2) | Open (0) | OFF (0) Open (0) | Close (1) | OFF (0) Close (1) | Open (0) | OFF (0) Close (1) | Close (1) | ON (1) From the above truth table, the circuit diagram represents an AND gate Le. Y = AB Tear er eee) Start Complete Exam Preparation cy shed live eed (o] Cre ea rad Download App Question 2: View this Question Online > Consider following gates 1. NAND 2.NOR 3.XOR Out of these gates, the Universal gates are 1 “ : 2. Yand only 3. 1and2only4. 1,2and3 Answer (Detailed Solution Below) Option 3: 1 and 2 only Boolean Algebra Question 2 Detailed Solution AUniversal Gate is a gate by which every other gate canbe realized AND, OR, NOT, etc. are basic gates. NAND, NOR, etc. are the universal gate. Example: ' NOT, AND and OR gate aie NAND gate is as shown: NOT —>— off p+ ANDO—~ on org] >— £8 v ’ i Y India’s #1 Learning Platform Pla mete g ne) (ee ced TLC) Git eae Tee Diener Cree eur Exo Download App Question 3: View this Question Online > Which of the following is termed as Universal gate logic 1. OR ht2A % 3. NAND 4. EX-OR Answer (Detailed Solution Below) Option 3: NAND Boolean Algebra Question 3 Detailed Solution AUniversal Gate is a gate by which every other gate can be realized. AND, OR, NOT, etc. are basic gates. NAND, NOR, etc. are the universal gate. For Ex - NOT, AND and OR gate realization using NAND gate is as shown: Noto] >—e Pe -~ AND oy i= ot = India’s #1 Learning Platform Start Complete Exam Preparation cal] SaaS Pe (er) Day Exe DS crel Cesar Download App Question 4: View this Question Online > A tautology is a Boolean formula that is always true. Which of the following is a tautology?Answer (Detailed Solution Below) Option 3:x+7 +k Boolean Algebra Question 4 Detailed Solution * Calculation: xtytR =K4K+7 ~ =14+7 0 [ex+x=1] =1 So, itis always true. Hence option 3is correct. a ieee re eric Start Complete Exam Preparation Cea eer Pra mG oat Mock Tests POR toarercsd Download App Gaim pairs cy Question 5: View this Question Online > The Boolean function a + (a b) is equivalent to1. ab or” i 2 atb 3. aw 4. a+b Answer (Detailed Solution Below) Option 2:a+b Boolean Algebra Question 5 Detailed Solution Calculation: y=atab = y= (a+) (a+b) Because, we have, ysaa+ab+aa+ab XN y=atab+ab XS y=a(1+b)+ab y=atab > Therefore, now consider, y=(a+4) (e+b) y= (1) (a+b) ny=a+b jective Questions ‘Top Boolean Algebra Mie& eee ec SSE Ta eri CM et Ll) Oras fared Pa pores (ores Download App Exons) Question 6 The Boolean function AB + AC is equivalent to 1, AB+AC+BC 2. AB'C'+ABC' + ABC 3. ABC+ABC+B'C’ 4. ABC + ABC’ + AB'C Answer (Detailed Solution Below) Option 4: ABC + ABC’ + AB'C = Boolean Algebra Question 6 Detailed Solution “Important: ‘Axioms and De Morgan's laws of Boolean Algebra: * Double inversion 4 = 4 Pa Os De Morgan's laws: View this Question Online >wit B= 4.8 2A.B=A+B Law Calculation: Let the given function be Y Y=AB+AC Now expanding by using the important properties of boolean algebra: Y= AB(C +0) +AC(B +B) Y= ABC + ABC + ACB + ACB ‘As ABC + ACB = ABC Y= ABC + ABC + ACB Y can also be written as: Y= ABC + ABC'+ AB'C Hence option (4) is the correct answer. » Important PointsName “AND Form OR Form Identity law TARA O+FA=A NullLaw | 0,A-0 Taal idempotent | 5 x Law AAA AtA=A, Inverse Law AA=0 AtA=1 Comtranative AB-BA A+B=B+A Associative (A+B)+C = At Law (asyc (+e) Distributive | A+BC=(A+B) Law (A+C) —_|A(B+C)=AB+Al Absorption = = ‘Lew A(A+B)=A, A+tAB=A, Pe Morgan's) (apy=A+s" | (a+8)=AB" E Pearcy “ye BS la Otel) (Me Led) eG Practice a iS cieeray Cresta pao Download App Question 7 Which one of the following is NOT equivalent to p . q? LA 1. PV @AY-a) at2 GpVv aA er 3. a) V (RA-q) 4. -pA-a)V (pAq) Answer (Detailed Solution Below) Option 3: (“p Aq) V (pA-q) Boolean Algebra Question 7 Detailed Solution Formula: o P= G=(“PA-q)¥ PAG) -FGtp.a G p-a=-pYq=p+q Nee Derivation: 0° Option 1 (pVa)A(pV-~a)= csansnptia® Option 2 Xi GpvaAq- p=eovalio= (®+4).(G+p)=B.4+pq Option 3. (-PAQ)V (pA-q)=P.4+p.44P.4+pq Option 4: GPpA-g)v¥ (PAg)=B.4 +p. Therefore, (+ p A q) V (pA -q) is NOT equivalent top ~qFg ee ec Start Complete Exam Preparation rears fared asus COSC (oreo Download App tis: Question 8 Let Nbeithe set of natural numbers. Consider the following sets. P. Set of Rational numbers (positive and negative) Q Set of functions from {0, 1} to N R Set of functions from No {0, 1} ‘S:Set of finite subsets of N. Which of the sets above are countable? 1. Qand Sonly 2. Pand Sonly 3. Pand Ronly 4. P, Qand Sonly Answer (Detailed Solution Below) Option 4: P, @and Sonly Boolean Algebra Question 8 7 ‘Set of rational numbers are countable. Set of functions from {0, 1} to Nis also countable. aR estas View this Question Online >Set of functions from Nto (0, 1} is equal to number of subsets of N which is uncountable using Cantor's diagonalization argument. ‘Set of finite subsets of N has bijection with N. Tee ate atc SS Ela OL n i) Cll Le LC) eee pos DOS tierce ere enna Download App Question 9 Which of the following is a functionally complete set of gates? (i) NAND (ii) NOT 5 1, {but not Il 2. Ibut not! at ‘< not 4. Both | andi Answer (Detailed Solution Below) Option 1: | but not Il Boolean Algebra Question 9 Detailed Solution The Correct Answer is | but not Il + NAND gate is a functionally complete set of gates. Rear tea View this Question Online > + In the logic gate, a functionally complete collection of logical connectives or Boolean operators is one which can be used to express all possible truth tables by combining members of the set into a Boolean expression.+ Awell-known complete set of connectors is (AND, NOT} and each of the singleton sets {NAND} is functionally complete, consisting of binary conjunction and negation. + ANAND gateis a logic gate that generates a false output only jf all.its inputs are valid, so its output is complementary to that of an AND gate, + A low output only results if all the inputs to the gate are high; a high output results if any input is low. © Key Points ~ A out B InputA | InputB | Output o [| o | 1 0 1 1 1 0 i 1 1 0 en Tee are tae lin pad BA Na RO naos Sie Start Complete Exam Preparation ein ra Cad roms ean Download App Question 10 View this Question Online Logic gates required to built up a half adder circuit are, 1. Ex OR gate and NOR gate 2. Ex~ OR gate and OR gate 3. Ex OR gate and AND gate ° ’ = 4. Ex NOR gate and NAND gate am tailed Solution Below)Option 3 : Ex ~ OR gate and AND gate Boolean Algebra Question 10 Detailed Solution Ahalf adder circuit is basically made up of ana AND gate with KOR gate as shown below. A s B Cc Half adder cO + A half adder is also known as XOR gate because XOR is applied to both it to, ice the sum + Half adder can add only two bits (A and 8) and has nothing to + If the input to a half adder has a carry, then it will neglect it a + That means the binary addition process is not comp Sum (8) = A®B, Carry = AB xe? INPUTS. OUTPUTS y the A and B bits ‘hy itis called a half adder Pe T TPa ee ec Start Complete Exam Preparation rears fared Pa COSC (oreo D>» Download App Exons) Question 11 View this Question Online > Which of the following is nota valid rule of Boolean Algebra? 1. At+N=A 2. ACA=A 3. A-A=0 4. A+M=1 ‘Answer (Detailed Solution Below) Option 1: A+ A’Pa Tee ner Elta Pee oe Start Complete Exam Prepara Pec pore Question Bank Download App call Daily Live Question 12 View this Question Online > Which of the following value is not equal to (7214)g? 1. (111010001100) 2 (EAC)+63. (8724)q0 4. (822030), Answer (Detailed Solution Below) Option 2: (EAC) 5Fg ee ec Start Complete Exam Preparation rears fared Pa COSC (oreo D>» Download App Exons) Question 13 Consider the following Boolean expressions: key #xy! IEXOR @. y)) IIL: XOR (x,y) Which of the above expressions represents exclusive NOR operation? 1. land Il 2. land Ill 3. Wand Ill 4, | llandill Answer (Detailed Solution Below) Option 2: | and Ill View this Question Online >5 India’s #41 Learning Platiorm en re Start Complete Exam Preparation & Quizzes Pe Practice nica PO cierey reser Download App Question 14 View this Question Online The Boolean function a + (@ b) is equivalent to 1. ab 2 atb 4. a+b Answer (Detailed Solution Below) Option 2:a +beee ea ec Start Complete Exam Preparation CC Stier Cote ecg Download App eee ea bes Caer Question 15 Perey View this Question Online > Consider the Boolean function f = (a + be)-(pq + r). Complement f of function f is: 1. (@ tbe) -(pa'+r) 2 a(b'+c)+(p'+q)r 3. @ +b) +(pq' +r)4. (abe) + (parr) Answer (Detailed Solution Below) Option 2: a'(b'+c') + (p' +q))r"