Question 7 20 Marks Figure Q7 A Shows An Arrangement Of 9 Lamps Of The Many Patterns That Could Be Formed A System 1 (33.46 KiB) Viewed 16 times
Question 7 20 Marks Figure Q7 A Shows An Arrangement Of 9 Lamps Of The Many Patterns That Could Be Formed A System 2 (42.14 KiB) Viewed 16 times
Question 7 20 Marks Figure Q7 A Shows An Arrangement Of 9 Lamps Of The Many Patterns That Could Be Formed A System 3 (42.14 KiB) Viewed 16 times
Question 7 20 Marks Figure Q7 A Shows An Arrangement Of 9 Lamps Of The Many Patterns That Could Be Formed A System 4 (33.68 KiB) Viewed 16 times
Question 7 (20 marks) Figure Q7(a) shows an arrangement of 9 lamps. Of the many patterns that could be formed, a system uses only the 6 shown in Figure Q7(b) where a filled circle indicates a lamp is on; a lamp can be only on or off. Table Q7 shows a table describing the states of the lamps for the input codes (U. V. W) used to generate the output patterns in Figure 07b) (the decimal equivalent of each code is marked against each pattern). A 0 in the output colams means that the lamp is off, a I means that the lamp is on, and an x represents a don't care state. 0.000. .0. 000 .00 ... 0.0 000 0.0 0.0 0.0 .00 000 00. 2 3 (b) TOTO NO +0+0+0 -0-0-0 .... Sute: 1 (a) Figure 07 State U V W # 1 2 k unused 0 0 0 X A A X 1 0 0 1 1 0 1 0 010 2 0 1 0 0 1 10100 3 0 1 1 00 000 4 1 0 0 00 1000 1 5 1 0 1 0 I 0010 1 6 1 1 0 1 1 1 1 unused 1 X Table 07 (a) In your answer book construct the truth table for lamps and d in Table 07. (2 marks) (b) Write out a sum-of-minterms Boolean expression for lamp e by treating don't care states as 0x (2 marks) (c) Draw Karnaugh maps for lamps e and h. By treating each don't care state as 0 or 1 as appropriate, find the simplest form for the Boolean expressions for lamps and A (6 marks) Page 10 of 14 ELEC 5201F Fial Project (2022) (d) An expression for lamp g is. g=VW+U+W Implement the expression using only NAND gates and draw the circuit diagram (3 marks) (e) Use the Quine-McCluskey (Tabular) method to determine the simplest Boolean expression for lampi (7 marks) 4 X
Figure Q7(a) shows an arrangement of 9 lamps. Of the many patterns that could be formed, a system uses only the 6 shown in Figure Q7(b) where a filled circle indicates a lamp is on; a lamp can be only on or off. Table Q7 shows a table describing the states of the lamps for the input codes (U. V. W) used to generate the output patterns in Figure Q7(b) (the decimal equivalent of each code is marked against each pattern). A 0 in the output column means that the lamp is off, a 1 means that the lamp is on, and an x represents a don't care state. ooo 00 000 State: 1 2 3 h i X 0 0 0 ON OROR O 6980 (a) Figure Q7 State U unused 0 1 0 2 0 3 0 456 unused V 0 0 1 1 1 W 0 1 0 1 1 0 1 a b 1 0 0 0 0 1 X X 0 1 0 (b) e X 1 1 1 0 1 X f X 0 0 1 0 1 X 8 X 0 1 0 1 1 X X 1 0 0 0 1 X X
Table 07 (a) In your answer book construct the truth table for lamps a and d in Table Q7. (2 marks) (b) Write out a sum-of-minterms Boolean expression for lamp e by treating don't care states as O's. (2 marks) 0 or 1 as (c) Draw Karnaugh maps for lamps e and h. By treating each don't care state as appropriate, find the simplest form for the Boolean expressions for lamps e and h. (6 marks) Page 10 of 14 ELEC S201F Final Project (2022) (d) An expression for lamp g is, g=V.W+U.W Implement the expression using only NAND gates and draw the circuit diagram. (3 marks) (e) Use the Quine-McCluskey (Tabular) method to determine the simplest Boolean expression for lamp i. (7 marks)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!