This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CPSC 121 Lecture 14 February 6, 2009 Menu February 6, 2009 Topics: Overflow in n-Bit Binary Addition/Subtraction (revisited) (More) Examples (cont’d) Reading: Next: Epp 3.1, Theorem 3.4.1 (page 157), Representation of Integers (pages 159–163), Epp 3.6, and 3.7 Reminders: On-line Quiz 7 deadline 9:00pm February 8 Assignment 2 due Friday, February 13 (by 17:00) Marked Assignment 1 available in tutorials Midterm exam Tuesday, February 24 (evening) READ the WebCT Vista course announcements board Coming soon: After covering the cited material in Epp chapter 3 we will go beyond Epp to talk about a new category of circuit, called a sequential circuit. This, in turn, will allow us to explore, at the circuit level, a full (albeit simple) computer. Associated readings from Epp are Epp 12.2 (pages 745–747) and “Designing a Finite Automaton” (pages 752–754, skipping part b of the examples). We’ll reread and revisit this material later. The objective for now is to build intuition for how a finite-state automaton works. Today, we return to the combinational circuits described in Lecture 10 to revisit the issue of detecting overflow in n-bit binary addition/subtraction and, time permitting, continue with the examples introduced at the end of Lecture 13....
View Full Document
This note was uploaded on 01/09/2010 for the course CPSC 121 taught by Professor Belleville during the Spring '08 term at UBC.
- Spring '08