A compound statement like 'it is sunny or it is not warm' depends on two basic facts. Each is T or F, so there are 2×2=4 possible situations, and a truth table gives each its own row. List them in a fixed pattern so none is missed or repeated: the first column reads T, T, F, F and the second T, F, T, F. With three statements, the first column has four T's then four F's, the second alternates in pairs, and the third alternates every row, giving 23=8 rows.
Then compute the expression from the inside out, one connective per column. For P∨¬Q: first a column for ¬Q (F, T, F, T), then the 'or' column (T, T, F, T). The only false row is P = F, Q = T, so the statement fails only when it is not sunny but it is warm. Two expressions are equivalent exactly when their final columns match in every row.
Checking one situation is not a truth table. When P and Q are both true, P∨Q and P∧Q are both true, which might suggest they are equivalent; the TF row shows they are not. A tree diagram also branches on T or F, and a Venn diagram shades regions, but only the full table puts every combination of inputs and its result side by side.
Think of it like this. A truth table is like testing a new light circuit by flipping its switches through every on/off combination and writing down whether the bulb lights. With 2 switches there are 4 settings to try, and each extra switch doubles the list. The one setting you skip could be the one that blows the fuse.
Core idea. A truth table enumerates all input truth assignments and the resulting value of an expression.