Boolean Algebra – 29

5555555555

29. When are the inputs to a NAND gate, according to De Morgan’s theorem, the output expression could be:

(a) X = A + B
(b)
(c) X = (A)(B)
(d)

Answer
Answer : (a)
Explanation
Explanation : No answer description available for this question. Let us discuss.
Subject Name : Electronics Engineering
Exam Name : IIT GATE, UPSC ESE, RRB, SSC, DMRC, NMRC, BSNL, DRDO, ISRO, BARC, NIELIT
Posts Name : Assistant Engineer, Management Trainee, Junior Engineer, Technical Assistant
Electronics & Communication Engineering Books

GATE 2023 Total InfoENGG DIPLOMAUGC NET Total Info
IES 2023 Total InfoPSUs 2022 Total InfoCSIR UGC NET Total Info
JAM 2023 Total InfoM TECH 2023 Total InfoRAILWAY 2022 Total Info

Related Posts

  • Boolean Algebra - 32555555555532. The Boolean expression is logically equivalent to what single gate? (a) NAND (b) NOR (c) AND (d) OR
    Tags: boolean, algebra, expression, gate, nand, electronics, engineering
  • Boolean Algebra - 11555555555511. Which of the following is a form of DeMorgan's theorem? (a) (b) (c) (d)
    Tags: boolean, algebra, theorem, electronics, engineering
  • Boolean Algebra - 49555555555549. The Boolean expression is equal to ________. (a) C (b) D (c) C + D (d) 1
    Tags: boolean, algebra, expression, electronics, engineering
  • Boolean Algebra - 35555555555535. Applying DeMorgan's theorem to the expression , we get ________. (a) (b) (c) (d)
    Tags: boolean, algebra, theorem, expression, electronics, engineering
  • Boolean Algebra - 37555555555537. Applying DeMorgan's theorem to the expression , we get ________. (a) (b) (c) (d)
    Tags: boolean, algebra, theorem, expression, electronics, engineering

LEAVE A REPLY

Please enter your comment!
Please enter your name here