810 likes | 1.97k Views
Chapter 12: Boolean Algebra and Combinatorial Circuits. Discrete Mathematical Structures: Theory and Applications. Learning Objectives. Learn about Boolean expressions Become aware of the basic properties of Boolean algebra
E N D
Chapter 12: Boolean Algebra and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications
Learning Objectives • Learn about Boolean expressions • Become aware of the basic properties of Boolean algebra • Explore the application of Boolean algebra in the design of electronic circuits • Learn the application of Boolean algebra in switching circuits Discrete Mathematical Structures: Theory and Applications
Two-Element Boolean Algebra Let B = {0, 1}. Discrete Mathematical Structures: Theory and Applications
Two-Element Boolean Algebra Discrete Mathematical Structures: Theory and Applications
Two-Element Boolean Algebra Discrete Mathematical Structures: Theory and Applications
Two-Element Boolean Algebra Discrete Mathematical Structures: Theory and Applications
Boolean Algebra Discrete Mathematical Structures: Theory and Applications
Boolean Algebra Discrete Mathematical Structures: Theory and Applications
Boolean Algebra Discrete Mathematical Structures: Theory and Applications
Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications
Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications
Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications
Logical Gates and Combinatorial Circuits • In circuitry theory, NOT, AND, and OR gates are the basic gates. Any circuit can be designed using these gates. The circuits designed depend only on the inputs, not on the output. In other words, these circuits have no memory. Also these circuits are called combinatorial circuits. • The symbols NOT gate, AND gate, and OR gate are also considered as basic circuit symbols, which are used to build general circuits. The word circuit instead of symbol is also used. Discrete Mathematical Structures: Theory and Applications
Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications
Logical Gates and Combinatorial Circuits • The diagram in Figure 12.32 represents a circuit with more than one output. Discrete Mathematical Structures: Theory and Applications