TRUTH TABLES
A truth table is a breakdown of a logic function by listing all possible values the function can attain. Such a table typically contains several rows and columns, with the top row representing the logical variables and combinations, in increasing complexity leading up to the final function.
Truth tables were easy to understand, but when the inputs and the gates increased it became confusing to get the output. We converted truth tables to Boolean expressions, k-maps, and logic gates. There are some tricks that makes it easier to do the truth table like separating each variable are rewriting them after every change, it’s easier as we don’t have to remember the outputs. In general, I will rather do Booleans expressions or k-maps because I think they are more representative than truth table.