Difference between revisions of "CSC103 Schedule 2011"
(→Weekly Schedule) |
(→Weekly Schedule) |
||
Line 48: | Line 48: | ||
** This creates a <font color="magenta">need</font> for electrical circuits that implement the 3 boolean operators | ** This creates a <font color="magenta">need</font> for electrical circuits that implement the 3 boolean operators | ||
** <font color="magenta">Logic Gates</font>: NOT, AND, OR | ** <font color="magenta">Logic Gates</font>: NOT, AND, OR | ||
+ | ** Truth tables and verification of rules of addition | ||
---- | ---- | ||
* [[CSC103 2011 Homework 1 | Homework #1 ]] | * [[CSC103 2011 Homework 1 | Homework #1 ]] | ||
Line 59: | Line 60: | ||
* '''Monday/Wednesday''' | * '''Monday/Wednesday''' | ||
<font color="lightgray"> | <font color="lightgray"> | ||
− | + | ||
* Logic Gates | * Logic Gates | ||
* Logic Design | * Logic Design |
Revision as of 07:45, 27 January 2011
--D. Thiebaut 08:44, 7 January 2011 (EST)
Prof
Dominique Thiébaut email |
Weekly Schedule
Week | Topics | Reading |
Week 1 1/24 |
|
|
Week 2 1/31 |
|
|
Week 3 2/7 |
|
|
Week 4 2/14 |
|
|
Week 5 2/21 |
|
|
Week 6 2/28 |
|
|
Week 7 3/7 |
|
|
Week 8 3/14 |
|
|
Wiki pages
Click here to access the class Wiki pages.
Additional Resources
- IEEE Special Issue on Singularity
- Stock pictures
- Javascript Resources
- Tutorials and examples of Javascript code. Type in the code and see its effect directly on the same page.