Constructing Truth Tables for Combinational Logic Circuits 

Hope the exam went well

@@EngineersAcademyLTD Well, your video really helped the tracing of the truth table but drawing a circuit *sigh*

Good luck!

hope the test goes well!

Hi Roddy, one useful method is to convert the truth table into a Karnaugh Map, from which the necessary logic gates can be derived. We don't have any videos on Karnaugh Maps unfortunately but I am sure there will be others that do, and we might look to add this in the future.

@@EngineersAcademyLTD How do you draw these circuits, Nevermind though because my exam in 40 min lol

Hope it went well

2 is the number of possible states (true or false, 1 or 0, etc.) that each input has, and N is the number of inputs.

If you had 4 inputs, there would be 2^4 = 16 possible combinations, and you can still use the half and half rule to generate all combinations. So in this example it would be 8 1's and 8 0's for the first column, followed by groups of 4 for the next column, groups of 2 and then groups of 1.

It works for all. So for example, if you had 4 inputs, there would be 2^4 = 16 possible combinations, and you can still use the half and half rule to generate all combinations. So in this example it would be 8 1's and 8 0's for the first column, followed by groups of 4 for the next column, groups of 2 and then groups of 1.

@@EngineersAcademyLTD tqvm, it helpd for my automation test

Great - glad it helped.

😁😁

You are great 🙏♥️😁

4 inputs means 2^4 = 16 possible combinations