Digital Logic Fundamentals

Perform binary addition and subtraction using two's complement representation.

Apply Boolean algebra laws (De Morgan's, distributive, associative) to simplify logic expressions.

Construct and interpret truth tables for combinational logic expressions.

Use Karnaugh maps to minimize Boolean functions of up to four variables.

Implement simplified Boolean functions using both basic logic gates (AND, OR, NOT) and universal gates (NAND, NOR).

Explain the cause of and methods to mitigate logic hazards (static, dynamic) in combinational circuits.