{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

11-30 Class Notes CS 107 - 11-30 Class Notes CS 107...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Program #6 is due tonight at 11:59pm, just before midnight. The in-class final exam time & place is posted at the bottom of the class schedule: 3:30-5:30 Tuesday 12/6, LC D5 Solution to the in-lab portion of the final has been posted. Announcements: Questions? Lab 14 solution: Building a linked list of Employee Command Line arguments Binary Numbers Magic Trick Last Time: What went well, what didn't, how to improve the course, book, TA/lab Course Evaluations (Course CS 107, Call #10634 ) Binary Numbers, continued… Secrets of Digital Logic made simple Today: Consider the following tables: Binary Numbers & Digital Logic (with apologies to students who already know this)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Background image of page 2
Background image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 11-30 Class Notes CS 107 Wednesday, November 30, 2011 12:13 PM CS 107 Fall 2011 Page 1 So how does this relate to binary numbers? How can we use basic logic with binary numbers to make a computer work? For a small example lets implement a half-adder using simple logic gates a. We've already seen Binary Numbers Logic gates: consider behavior of AND, OR, NOT, XOR b. Steps: Think of inputs and outputs for a half-adder (adding 2 bits) a. a. How would we implement this using logic gates? CS 107 Fall 2011 Page 2 CS 107 Fall 2011 Page 3...
View Full Document

{[ snackBarMessage ]}