Reduce the Boolean function specified in the truth table below to its minimum SOP form using K-map, where A, B, C are the inputs while X are the outputs. Based on the reduced Boolean function, design the logic circuit using any logic gates. A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 1 1 C 0 1 0 1 0 1 اداد 0 1 X 1 1 0 1 1 1 0 1

1. Design a 8 - to - 1 multiplexer using 2- to-1 multiplexer using blocks. 2. Using K- Map, simplify the following Boolean expression : Ү-2 (0, 2, 4, 6, 8, 10, 11, 12, 13) 3. Build the logic circuit for the following function using Programmable Read Only Memory. F1 = ĀBC + ABC + ABC + ABC F2 = ABC + ABC + ABC + ABC E (Ctrl)

Create Truth table and logic diagram using basic gates F = X +YZ

Design a combinational logic circuit which has one output Z and a 4-bit input ABCD representing a binary number. Z should be 1 iff the input is at least 5, but is no greater than 11. Use one OR gate (three inputs) and three AND gates (with no more than three inputs each.)