Difference between revisions of "CSC103 2008"
| Line 1: | Line 1: | ||
=CSC 103: How Computers Work= | =CSC 103: How Computers Work= | ||
| − | + | ==Schedule== | |
First half of Fall 2008 | First half of Fall 2008 | ||
| − | Textbook | + | ==Textbook== |
| + | '' The Most Complex Machine''., by David Eck, A. K. Peters, Natick Ma [http://www.amazon.com/Most-Complex-Machine-Computers-Computing/dp/1568810547/ref=sr_1_1?ie=UTF8&s=books&qid=1214414726&sr=8-1] | ||
Book chapters | Book chapters | ||
| Line 20: | Line 21: | ||
* Chapter 11: Graphics: math, realistic images | * Chapter 11: Graphics: math, realistic images | ||
* Chapter 12: AI | * Chapter 12: AI | ||
| + | |||
| + | ==Schedule== | ||
| + | |||
| + | *Week 1: | ||
| + | **Chapter 1, general introduction | ||
| + | **Chapter 2, binary system, arithmetic, logic gates | ||
| + | |||
| + | *Week 2: | ||
| + | **Chapter 2, binary adder | ||
| + | ** | ||
Revision as of 12:38, 25 June 2008
CSC 103: How Computers Work
Schedule
First half of Fall 2008
Textbook
The Most Complex Machine., by David Eck, A. K. Peters, Natick Ma [1]
Book chapters
- Chapter 1: What Computers can do. Must read
- Chapter 2: (read 2.1) computing with Silicon. Arithmetic, circuits
- Chapter 3: (read 3.1 and 3.3) Building computers
- Chapter 4: Theoretical computers. Computational universality in Section 4.1 is important
- Chapter 5: History of computers
- Chapter 6: Programming: basic concepts (variables, loops, decisions)
- Chapter 7: Programming Methodology for building large programs
- Chapter 8: Programming Languages
- Chapter 9: Applications
- Chapter 10: Cooperating Computers. Parallelism and networks
- Chapter 11: Graphics: math, realistic images
- Chapter 12: AI
Schedule
- Week 1:
- Chapter 1, general introduction
- Chapter 2, binary system, arithmetic, logic gates
- Week 2:
- Chapter 2, binary adder
