5555555555
41. How many gates would be required to implement the following Boolean expression after simplification? XY + X(X + Z) + Y(X + Z)
(a) 1
(b) 2
(c) 4
(d) 5
| 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
555555555542. How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z) (a) 1 (b) 2 (c) 4 (d) 5- 5555555555136. How many NOT gates are required to implement the Boolean expression, ? (a) 1 (b) 2 (c) 4 (d) 5
- 5555555555139. How many AND gates are required to implement the Boolean expression, ? (a) 1 (b) 2 (c) 3 (d) 4
- 555555555540. Derive the Boolean expression for the logic circuit shown below: (a) (b) (c) (d)
- 555555555536. Applying the distributive law to the expression , we get ________. (a) (b) (c) (d)