5555555555
9. Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as a BCD-to-decimal converter. These result in ________terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term.
(a) don’t care, 1s, 0s, simplify
(b) spurious, ANDs, ORs, eliminate
(c) duplicate, 1s, 0s, verify
(d) spurious, 1s, 0s, simplify
| 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
555555555597. Occasionally, a particular logic expression will be of no consequence in the operation of a circuit, such as in a BCD-to-decimal converter. These result in ________ terms in the K-map and can be treated as either ________ or ________, in order to ________ the resulting term. (a) don't care, 1's, 0's, simplify (b) spurious, AND's, OR's, eliminate (c) duplicate, 1's, 0's, verify (d) spurious, 1's, 0's, simplify- 555555555540. Derive the Boolean expression for the logic circuit shown below: (a) (b) (c) (d)
- 555555555513. Simplify the expression using DeMorgan's theorems. (a) (b) (c) (d)
- 5555555555141. Implementing the expression with NOR logic, we get: (a) (A) (b) (B) (c) (C) (d) (D)
- 5555555555142. Implementing the expression using NAND logic, we get: (a) (A) (b) (B) (c) (C) (d) (D)