Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

No Downloads

Total views

7,371

On SlideShare

0

From Embeds

0

Number of Embeds

1,536

Shares

0

Downloads

413

Comments

0

Likes

9

No embeds

No notes for slide

- 1. Boolean Algebra Theory and Applications
- 2. Learning Objectives <ul><li>Learn about Boolean expressions </li></ul><ul><li>Become aware of the basic properties of Boolean algebra </li></ul><ul><li>Explore the application of Boolean algebra in the design of electronic circuits </li></ul><ul><li>Learn the application of Boolean algebra in switching circuits </li></ul>
- 3. Two-Element Boolean Algebra Let B = {0, 1}.
- 5. Two-Element Boolean Algebra
- 6. Logical Gates and Combinatorial Circuits
- 7. Logical Gates and Combinatorial Circuits
- 8. Logical Gates and Combinatorial Circuits
- 9. Logical Gates and Combinatorial Circuits <ul><li>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 . </li></ul><ul><li>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. </li></ul>
- 10. Logical Gates and Combinatorial Circuits
- 32. Logical Gates and Combinatorial Circuits <ul><li>The diagram in Figure 12.32 represents a circuit with more than one output. </li></ul>
- 36. Logical Gates and Combinatorial Circuits <ul><li>A NOT gate can be implemented using a NAND gate (see Figure 12.36(a)). </li></ul><ul><li>An AND gate can be implemented using NAND gates (see Figure 12.36(b)). </li></ul><ul><li>An OR gate can be implemented using NAND gates (see Figure12.36(c)). </li></ul>
- 37. Logical Gates and Combinatorial Circuits <ul><li>Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NAND gates. </li></ul><ul><li>Any circuit which is designed by using NOT, AND, and OR gates can also be designed using only NOR gates. </li></ul>

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment