Difference between revisions of "CSC103 2008"
| Line 26: | Line 26: | ||
*Week 1: | *Week 1: | ||
**Chapter 1, general introduction | **Chapter 1, general introduction | ||
| + | |||
| + | *Week 2: | ||
**Chapter 2, binary system, arithmetic, logic gates | **Chapter 2, binary system, arithmetic, logic gates | ||
| + | **Chapter 2, logic gates, binary adder | ||
| + | |||
| + | *Week3: | ||
| + | ** Chapter 4, NP, solvability, towers of hanoi | ||
| + | ** History of computers, video "Machine that changed the world", Loom, Craig. | ||
| − | *Week | + | * Week 4: |
| − | |||
** | ** | ||
Revision as of 15:29, 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
- Week 2:
- Chapter 2, binary system, arithmetic, logic gates
- Chapter 2, logic gates, binary adder
- Week3:
- Chapter 4, NP, solvability, towers of hanoi
- History of computers, video "Machine that changed the world", Loom, Craig.
- Week 4:
