Exercise 4.35 - Implement Boolean Function Using Multiplexer

1.5(a) - Subtraction Using 10's Complement - Why we Use Complement Scheme for Subtraction Operation

1.5(b) - Binary Subtraction Through Addition - Why We Use Complement Scheme in Subtraction

1.5(c) - Subtraction of Unsigned Numbers Using 2's Complement (8 bit Input Case)

1.6 - Full Version - Subtraction of Signed Inputs Through Addition Using 2's Complement

2.5a - What is Boolean Function

2.5b - Simplification of Boolean Function

2.6a - Minterm vs Maxterm - Express Boolean Function in Sum of Minterms and Product of Maxterms Form

2.6b - Conversion from Standard Form to Canonical Form

2.6c - Conversion From One Canonical Form to Other Canonical Form

3.2a - K Map - 3 Variable Case - Simplification of Boolean Function

3.2b - K Map - 3 Variable Case - More Examples (Grouping Practice)

3.3a - Four Var K Map - Sum of Products Simplification