Assuming No 23 Abcdefg Consider The Boolean Function F A B C D Given By The Following Truth Table For All The Qu 1 (58.34 KiB) Viewed 27 times
can u please solve q2
Assuming No 23 Abcdefg Consider The Boolean Function F A B C D Given By The Following Truth Table For All The Qu 2 (58.34 KiB) Viewed 27 times
Assuming (no+23),= (abcdefg), consider the Boolean function F(A,B,C,D) given by the following truth table for all the questions: (no+23) = (abcdefg) Q1.(40 points) ABCD F 0000 X a) Implement F(ABCD) using 3x8 Decoders with Active High' output and Enable inputs and external gates, 0001 a 0010 b b) Implement F(ABCD) using 3x8 Decoders with 'Active Low output and Enable inputs and external gates, 0011 с 0100 d 0101 c) Is it possible to implement F(ABCD) with decoders using logic gates with smaller number of inputs than given in part a) or part b)? e 0110 f 0111 g 1000 Q2. (60 points) X 1001 g 1010 f 1011 1100 d 1101 a) Implement F(ABCD) using a 8x1 MUX and external gates, choosing inputs A, B, C as the selection inputs of the MUX. b) Implement F(ABCD) using a 8x1 MUX and external gates, choosing inputs B, C, D as the selection inputs of the MUX. c) Implement F(ABCD) using a 4x1 MUX and external gates, choosing inputs B and C as the selection inputs of the MUX. с 1110 b 1111 a x: don't care
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!