--D. Thiebaut 08:44, 7 January 2011 (EST)
Back to Main Page for CSC103
Prof
|
Dominique Thiébaut email
Dept. Computer Science
Ford Hall, 356.
Telephone: 3854
Office Hours: M:4-5, T3-4, W3-4, and my appointment
|
Weekly Schedule
| Week |
Topics |
Reading
|
Week 1
1/24
|
- Monday:
- Introduction to the semester
- Overview
- Binary System
- The Transistor
- Wednesday
- Quick review
- George Boole (1779-1848)
- Logic, logic expression = boolean expression
- Any complicated logic expression can be expressed with only 3 operators: AND, OR, and NOT
- Shannon (1916-2001), in 1948 writes a Master's thesis at MIT: Any binary numerical computation can be performed using logic expressions, and logic operators
- Verify that we can add in binary.
- Therefore we should be able to add using AND, OR, and NOT.
- This creates a need for electrical circuits that implement the 3 boolean operators
- Logic Gates: NOT, AND, OR
|
- Read Chapter 1 of the textbook. Skip Section 1.3 and up.
|
Week 2
1/31
|
- Truth tables and verification of rules of addition
- Logic Gates
- Logic Design
- Simulator
- Creating a Wiki page
|
|
Week 3
2/7
|
- PC Lab: "Take apart a PC"
|
|
Week 4
2/14
|
|
- Concentrate on Sections 3.2 and 3.4 in the textbook.
- Start reading the papers on the Singularity which we will discuss the last day of class:
|
Week 5
2/21
|
|
|
Week 6
2/28
|
|
|
Week 7
3/7
|
- The singularity
- Moore's Law
|
|
Week 8
3/14
|
|
|
Wiki pages
Click here to access the class Wiki pages.
Additional Resources
