This computer science video is an introduction to Karnaugh maps, otherwise known as K-maps. A Karnaugh map is a modified form of truth table that makes it easier to recognise patterns in the output of circuits involving logic gates. It covers creating a Karnaugh map from a standard truth table for a logic circuit, and the interpretation of a Karnaugh map to derive a minimised Boolean expression. Specifically, this video covers Karnaugh maps for circuits with 2 variables and 3 variables, and the rules for grouping output values.