Boolean Algebra – 25

5555555555

25. The systematic reduction of logic circuits is accomplished by:

(a) using Boolean algebra
(b) symbolic reduction
(c) TTL logic
(d) using a truth table

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

Sale

Highlight important details or key points; Summarize information in a clear and concise manner

₹ 333

Sale

Made Easy Editorial Board (Author); Marathi (Publication Language); 620 Pages - 01/01/2015 (Publication Date) - Made Easy Publications (Publisher)

₹ 320

Patil (Author); English (Publication Language)

Sale

Neamen, Donald (Author); English (Publication Language); 1351 Pages - 08/25/2006 (Publication Date) - McGraw Hill Education (Publisher)

₹ 2,500

Boolean Algebra - 49
555555555549. The Boolean expression is equal to ________. (a) C (b) D (c) C + D (d) 1
Tags: boolean, algebra, electronics, engineering
Boolean Algebra - 40
555555555540. Derive the Boolean expression for the logic circuit shown below: (a) (b) (c) (d)
Tags: boolean, algebra, logic, electronics, engineering
Logic Gates - 130
5555555555130. The Boolean SOP expression obtained from the truth table below is ________. (a) (b) (c) (d) None of these
Tags: logic, boolean, truth, table, electronics, engineering
Logic Gates - 114
5555555555114. Which of the following is not a basic Boolean operation? (a) OR (b) NOT (c) AND (d) FOR
Tags: logic, boolean, electronics, engineering
Boolean Algebra - 11
555555555511. Which of the following is a form of DeMorgan's theorem? (a) (b) (c) (d)
Tags: boolean, algebra, electronics, engineering

Related Posts