This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Chapter 3 Instructor's Manual http://74.125.47.132/...mhsieh.idv.tw%2Forganization972%2FIMCh3.PDF+site%3Awww.hmhsieh.idv.tw+instructor&amp;hl=en&amp;gl=us[2/12/2010 9:48:23 AM] This is the html version of the file http://www.hmhsieh.idv.tw/organization972/IMCh3.PDF . Google automatically generates html versions of documents as we crawl the web. Page 1 Chapter 3 Instructor's Manual ______________________________________________________________________________ Chapter Objectives Chapter 3, Boolean Algebra and Digital Logic, is a classic presentation of digital logic and how it relates to Boolean algebra. This chapter covers both combinational and sequential logic in sufficient detail to allow the reader to understand the logical makeup of more complicated MSI (medium scale integration) circuits (such as decoders). More complex circuits, such as buses and memory, are also included. We have included optimization and Kmaps in a special &quot;Focus On&quot; section. This chapter should be covered after Chapter 1, but before Chapters 4 through 11. Lectures should focus on the following points: Boolean algebra. Boolean algebra is a very natural way to represent digital information, and thus is an important concept to study if one wishes to understand computers. The common Boolean functions AND, OR and NOT should be covered, as well as truth table and Boolean identities. The Essentials of Computer Organization and Architecture Linda Null and Julia Lobur Jones and Bartlett Publishers, 2003 Chapter 3 Instructor's Manual http://74.125.47.132/...mhsieh.idv.tw%2Forganization972%2FIMCh3.PDF+site%3Awww.hmhsieh.idv.tw+instructor&amp;hl=en&amp;gl=us[2/12/2010 9:48:23 AM] Page 1 Last Updated: October 2003 Logic gates. Boolean algebra allows us to represent expressions in an abstract form. Digital circuits are built using logic gates, the basic building blocks for digital systems. It is important to understand how Boolean expressions are physically implemented. Digital components. The complexity of a Boolean expression (and its corresponding implementation) has a direct impact on the complexity of the resulting digital circuit. Therefore, it is important to understand how Boolean algebra relates to digital components. Combinational circuits. Combinational circuits represent a large portion of the actual components used in today's machines. Adders, decoders, multiplexers, and parity checkers are just a few examples. Understanding these simple circuits goes a long way towards understanding the overall system. Sequential circuits. These circuits allow the computer to retain, or remember, values. Clocks are used to synchronize these circuits. SR, JK and D flipflops can be used to build a large number of components, particularly registers and memory....
View
Full
Document
This note was uploaded on 10/05/2010 for the course CGS CGS 3269 taught by Professor K during the Spring '10 term at University of Central Florida.
 Spring '10
 K

Click to edit the document details