Unlimited Attempts Allowed

$vv$ Details

Submission: clearly label each task and submit all the tasks within one Pdf file.

Objectives:

Understanding the minimization of the Boolean function for output is to minimize the combinational circuit that generates the output

Being able to simplify the circuit by minimizing the Boolean function for each output.

Tasks:

Construct the gate circuit for the following Boolean function using

logi$.$ly simulator $($the licensed software is installed in CSE labs, the trial online

$F=a^{\text{'}}{b}^{\text{'}}{c}^{\text{'}}+a^{\text{'}}b{c}^{\text{'}}+a{b}^{\text{'}}{c}^{\text{'}}+a{b}^{\text{'}}c+ab{c}^{\text{'}}+abc$

and complete the truth table for $F$ by changing the inputs abc to $000,001,010,$dots$110,111$ and observing the output.

Submit: the logic gate circuit and the truth table

Simplify above Boolean function algebraically $($using Boolean algebra properties$).$ Show the process.

Submit: the simplification process by applying Boolean logic properties appropriately

Simplify the Boolean function in Step $1$ using K$-$map. Show the process.

Submit: K$-$map simplification process

Draw the circuit for the simplified Boolean function F obtained in Step $3$ using

logic.ly simulator.

Submit: the simplified circuit.