Difference between revisions of "CSC103 2008"

From dftwiki3
Jump to: navigation, search
(Schedule)
(Organization, Schedule & Reading)
Line 43: Line 43:
 
''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].  This book should be available at the Greycourt bookstore.  ([[CSC103_Book_Chapters | List of Chapters]])
 
''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].  This book should be available at the Greycourt bookstore.  ([[CSC103_Book_Chapters | List of Chapters]])
  
==Organization, Schedule & Reading==
+
==Topics Covered==
  
*'''Week''' 1: 
+
*Binary system, arithmetic, logic gates (Chap 2)
** General introduction (Chap 1)
+
*logic gates, binary adder (Chap 2)
 
+
* Building a computer (Chap 5)
*'''Week''' 2:
+
**von Neuman architecture
**Binary system, arithmetic, logic gates (Chap 2)
+
**Von Neuman bottleneck
**logic gates, binary adder (Chap 2)
+
** CPU, RAM, Secondary Memory
 
+
** Case Study: the Suse EEE, and the switch from magnetic to semiconductor storage
*'''Week3''':
+
* History of computers (Chap 5)
** Building a computer (Chap 5)
+
* Programming: Javascript (Chap 6)
***von Neuman architecture
+
** Programming Environment (Chap 7)
***Von Neuman bottleneck
+
** Program development
*** CPU, RAM, Secondary Memory
+
** Other programming languages
*** Case Study: the Suse EEE, and the switch from magnetic to semiconductor storage
+
* Parallel Programming (Chap 10)
** History of computers (Chap 5)
+
** Folding @ home
***video "Machine that changed the world"
+
** SETI
*** Loom, Craig.
+
* The Singularity:
 
+
** [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__signs_of_the_singularity.pdf Signs of the Singularity] by Vernor Vinge.
* '''Week''' 4:
+
** [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__can_machines_be_conscious.pdf Can Machine Be Conscious?], Christof Koch and Giulio Tononi.
** 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:
 
*** [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__signs_of_the_singularity.pdf Signs of the Singularity] by Vernor Vinge.
 
*** [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__can_machines_be_conscious.pdf Can Machine Be Conscious?], Christof Koch and Giulio Tononi.  
 
  
 
==Additional Resources==
 
==Additional Resources==
  
 
* [[IEEE_Singularity | IEEE Special Issue on Singularity ]]
 
* [[IEEE_Singularity | IEEE Special Issue on Singularity ]]

Revision as of 15:16, 6 September 2008

<meta name="keywords" content="computer science, how computers work, introductory" /> <meta name="description" content="Dominique Thiebaut's Web Page" /> <meta name="title" content="Dominique Thiebaut -- Computer Science" /> <meta name="abstract" content="Dominique Thiebaut's Computer Science Web pages" /> <meta name="author" content="thiebaut at cs.smith.edu" /> <meta name="distribution" content="Global" /> <meta name="revisit-after" content="10 days" /> <meta name="copyright" content="(c) D. Thiebaut 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,2008" /> <meta name="robots" content="FOLLOW,INDEX" />

Blog | Weekly Schedule


UnderConstruction.gif

CSC 103: How Computers Work, Fall 08

Overview

This course has no prerequisites. It is intended to introduce students to the history, theory and use of digital computers. Students from all majors are welcome - though there is some math and computer programming during the semester, the course is designed assuming students have no previous computer experience. Through the material presented in this course, students will be introduced to:

  1. A brief history of computers
  2. Binary numbers, and understanding how and why computers use them
  3. Logic gates - the basic building blocks of computers
  4. Javascript programming - which you may find you'll like to use beyond this course!
  5. A better understanding of how the computer does everything you direct it to do.
  6. Some important issues about computers in our future

A great number of topics are discussed in this seven week period, with the purpose not to explore any one topic fully or in depth. Rather the purpose is to provide a high level view of how a computer works - from the most fundamental hardware component (the logic gate) through the sophisticated programs we all use every day (such as word processors). Hopefully this first look at all these topics will encourage students to take additional courses in areas that are of most interest.

Instructor

Dominique Thiebaut
Office: McConnell 208, Clark Science Center
Email: thiebaut@cs.smith.edu
Office Hours: MW 2:30-4:00 p.m.

Schedule

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

Textbook

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

Topics Covered

  • Binary system, arithmetic, logic gates (Chap 2)
  • logic gates, binary adder (Chap 2)
  • 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)
  • Programming: Javascript (Chap 6)
    • Programming Environment (Chap 7)
    • Program development
    • Other programming languages
  • Parallel Programming (Chap 10)
    • Folding @ home
    • SETI
  • The Singularity:

Additional Resources