Difference between revisions of "CSC103 2008"

From dftwiki3
Jump to: navigation, search
(Organization and Schedule)
Line 10: Line 10:
  
  
==Organization and Schedule==
+
==Organization, Schedule & Reading==
  
 
*'''Week''' 1:   
 
*'''Week''' 1:   
** Chapter 1, general introduction
+
** General introduction (Chap 1)
  
 
*'''Week''' 2:
 
*'''Week''' 2:
**Chapter 2, binary system, arithmetic, logic gates
+
**Binary system, arithmetic, logic gates (Chap 2)
**Chapter 2, logic gates, binary adder
+
**logic gates, binary adder (Chap 2)
  
 
*'''Week3''':
 
*'''Week3''':
** Building a computer
+
** Building a computer (Chap 5)
 
***von Neuman architecture
 
***von Neuman architecture
 
***Von Neuman bottleneck
 
***Von Neuman bottleneck
 
*** CPU, RAM, Secondary Memory
 
*** CPU, RAM, Secondary Memory
 
*** Case Study: the Suse EEE, and the switch from magnetic to semiconductor storage
 
*** Case Study: the Suse EEE, and the switch from magnetic to semiconductor storage
** History of computers  
+
** History of computers (Chap 5)
 
***video "Machine that changed the world"
 
***video "Machine that changed the world"
 
*** Loom, Craig.
 
*** Loom, Craig.
  
 
* '''Week''' 4:
 
* '''Week''' 4:
** Client/Server architecture.   
+
** Client/Server architecture.  (Chap 10)
 
***Trends.   
 
***Trends.   
 
***Services.   
 
***Services.   
 
***Google vs. Microsoft
 
***Google vs. Microsoft
** Programming: Javascript
+
** Programming: Javascript (Chap 6)
  
 
* '''Week''' 5:
 
* '''Week''' 5:
** Programming: Javascript
+
** Programming: Javascript (Chap 7)
 
** Programming: Javascript  
 
** Programming: Javascript  
  
 
* '''Week''' 6:
 
* '''Week''' 6:
** Programming: other languages (Macros?)
+
** Programming: other languages
** Chapter 4, NP, solvability, towers of hanoi
+
** Chapter 4, NP, solvability, towers of hanoi (Chap. 4)
  
* '''Week''' 7:
+
* '''Week''' 7:  
** Parallel programming
+
** Parallel programming (Chap 10)
 
*** SETI@home
 
*** SETI@home
 
***Folding@home
 
***Folding@home
  
 
* '''Week''' 8:
 
* '''Week''' 8:
** Singularity
+
** Singularity (Handouts)

Revision as of 10:59, 12 August 2008

UnderConstruction.gif

CSC 103: How Computers Work

Schedule

First half of Fall 2008: Sept 4th to Oct. 21st.

Textbook

The Most Complex Machine., by David Eck, A. K. Peters, Natick Ma [1]. This book should be available at the Greycourt bookstore. (CSC103_Book_Chapters)


Organization, Schedule & Reading

  • Week 1:
    • General introduction (Chap 1)
  • Week 2:
    • Binary system, arithmetic, logic gates (Chap 2)
    • logic gates, binary adder (Chap 2)
  • Week3:
    • Building a computer (Chap 5)
      • von Neuman architecture
      • Von Neuman bottleneck
      • CPU, RAM, Secondary Memory
      • Case Study: the Suse EEE, and the switch from magnetic to semiconductor storage
    • History of computers (Chap 5)
      • video "Machine that changed the world"
      • Loom, Craig.
  • Week 4:
    • Client/Server architecture. (Chap 10)
      • Trends.
      • Services.
      • Google vs. Microsoft
    • Programming: Javascript (Chap 6)
  • Week 5:
    • Programming: Javascript (Chap 7)
    • Programming: Javascript
  • Week 6:
    • Programming: other languages
    • Chapter 4, NP, solvability, towers of hanoi (Chap. 4)
  • Week 7:
    • Parallel programming (Chap 10)
      • SETI@home
      • Folding@home
  • Week 8:
    • Singularity (Handouts)