2 resources.
Logic gates for GATE CS and EC: truth tables for AND, OR, NOT, NAND, NOR, XOR and XNOR, NAND as a universal gate, a half adder, tracing a circuit, and common mistakes.
Boolean algebra for GATE CS and EC: the laws, De Morgan's theorems, the consensus theorem, simplifying algebraically and with a Karnaugh map, with worked examples and common mistakes.