# Module 2.0

# 2.0 Digital Logic

- Section 2.0 Digital Logic.
- • Introduction to Digital Logic.

- Section 2.1 Logic Gates.
- • 74 Series standard logic gates.
- • Standard logic functions.
- AND, OR, NAND, NOR, XOR, XNOR, NOT.
- • Truth tables for standard logic functions.

- Section 2.2 Truth Tables.
- • Combining logic gates.
- • Truth tables.
- • Boolean expressions.

- Section 2.3 Boolean Algebra.
- • Simplifying Boolean equations.
- • Boolean laws and rules.
- • De Morgan’s theorem.

- Section 2.4 Karnaugh Maps.
- • Constructing Karnaugh maps.
- • Minimising Karnaugh maps.
- • Software for Boolean simplification.

- Section 2.5 Digital Logic Quiz.
- • Test your knowledge of Digital Logic.

## Introduction to Digital Logic

Digital logic is the foundation, not only of computing but also many other electronic devices and control systems found in almost every part of modern life.

This module introduces the basics of digital logic and shows how the whole of digital electronics depends on just seven types of logic gates, connected together with a minimum of additional components. Combinations of logic gates then form circuits that can perform specific tasks within larger circuits or systems. The process of producing complex circuits using combinations of basic devices is called Combinational Logic.

There are many ways that a number of logic gates can be combined to perform a specific task. They may all work, but some combinations will perform the task that better than others. For example, a circuit designer may want to design a combinational logic circuit that uses the minimum number of gates, or performs the required task in the least time, or at the minimum cost.

This module also introduces the way digital logic gates work and teaches you key methods by which a basic digital logic circuit design may be minimised, made more efficient and/or cheaper.