1 / 22

Lecture 20: Combinatorial Circuits I

Lecture 20: Combinatorial Circuits I. 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

angelinem
Télécharger la présentation

Lecture 20: Combinatorial Circuits I

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Lecture 20: Combinatorial Circuits I Discrete Mathematical Structures: Theory and Applications

  2. 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

  3. Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

  4. Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

  5. Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

  6. 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

  7. Logical Gates and Combinatorial Circuits Discrete Mathematical Structures: Theory and Applications

  8. Discrete Mathematical Structures: Theory and Applications

  9. Discrete Mathematical Structures: Theory and Applications

  10. Discrete Mathematical Structures: Theory and Applications

  11. Discrete Mathematical Structures: Theory and Applications

  12. Discrete Mathematical Structures: Theory and Applications

  13. Discrete Mathematical Structures: Theory and Applications

  14. Discrete Mathematical Structures: Theory and Applications

  15. Discrete Mathematical Structures: Theory and Applications

  16. Discrete Mathematical Structures: Theory and Applications

  17. Discrete Mathematical Structures: Theory and Applications

  18. Discrete Mathematical Structures: Theory and Applications

  19. Discrete Mathematical Structures: Theory and Applications

  20. Discrete Mathematical Structures: Theory and Applications

  21. Discrete Mathematical Structures: Theory and Applications

  22. Discrete Mathematical Structures: Theory and Applications

More Related