Minimization Techniques » Exercise – 1
1. The Boolean expression
can be minimised to :
(a) A’B’C’D+A’BC’+AC’D
(b) A’B’C’D+BCD’+AB’C’D
(c) A’BCD’+B’C’D+AB’C’D
(d) A’BCD’+B’C’D+ABC’D’
| 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 Info | ENGG DIPLOMA | UGC NET Total Info |
| IES 2023 Total Info | PSUs 2022 Total Info | CSIR UGC NET Total Info |
| JAM 2023 Total Info | M TECH 2023 Total Info | RAILWAY 2022 Total Info |
Related Posts
555555555513. Mapping the SOP expression , we get ________. (a) (A) (b) (B) (c) (C) (d) (D)- 555555555514. Mapping the standard SOP expression , we get (a) (A) (b) (B) (c) (C) (d) (D)
- 555555555546. Convert 59.7210 to BCD. (a) 111011 (b) 01011001.01110010 (c) 1110.11 (d) 0101100101110010
- 555555555550. The Boolean expression can be reduced to ________. (a) (b) (c) (d)
- 5555555555210. Solve this BCD problem: 0101 + 0110 = ________. (a) 00010111BCD (b) 00001001BCD (c) 00010001BCD (d) 00010011BCD