Difference between revisions of "CSC103 2008"

From dftwiki3
Jump to: navigation, search
(→‎Schedule)
m (moved CSC103 to CSC103 2008)
 
(42 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
=CSC 103: How Computers Work=
+
<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" />
  
−
==Schedule==
+
<center> [http://tango.csc.smith.edu/classwiki/index.php/CSC103_Page Wikis] |  [[CSC103 Weekly Schedule | Weekly Schedule]] </center>
−
First half of Fall 2008
+
 
 +
Dominique Thiébaut<br />
 +
McConnell Hall, 208. <br />
 +
Smith College <br />
 +
Telephone: 3854 <br />
 +
 
 +
__TOC__
 +
 
 +
<!--[[Image: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:
  
−
==Textbook==
+
# A brief history of computers
−
'' 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]
+
# Binary numbers, and understanding how and why computers use them
 +
# Logic gates - the basic building blocks of computers
 +
# Javascript programming - which you may find you'll like to use beyond this course!
 +
# A better understanding of how the computer does everything you direct it to do.  
 +
# Some important issues about computers in our future
  
−
Book chapters
+
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.
  
−
* Chapter 1: What Computers can do.  Must read
+
==Instructor==
−
* 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
 
  
−
==Organization and Schedule==
+
[http://cs.smith.edu/~thiebaut '''Dominique Thiebaut''']<br />
 +
Office: McConnell 208, Clark Science Center<br />
 +
Email: thiebaut@cs.smith.edu<br />
 +
Office Hours: MW 2:30-4:00 p.m.<br />
  
−
*Week 1:
+
==Schedule==
−
** Chapter 1, general introduction
+
First half of Fall 2008: Sept 4th to Oct. 15th.
 +
 
 +
==Textbook==
 +
[[Image:MostComplexMachine.gif | right]]
 +
''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]])
  
−
*Week 2:
+
==Tentative list of topics covered==
−
**Chapter 2, binary system, arithmetic, logic gates
 
−
**Chapter 2, logic gates, binary adder
 
  
−
*Week3:
+
*Binary system, arithmetic, logic gates (Chaps 1, 2)
−
** Building a computer, von Neuman architecture, bottleneck, CPU, RAM, Secondary Memory, Suse EEE
+
*logic gates, binary adder (Chap 2)
−
** History of computers, video "Machine that changed the world", Loom, Craig.
+
* 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:
 +
** [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.
  
−
* Week 4:
+
==Grading==
−
** Client/Server architecture. 
 
−
***Trends. 
 
−
***Services. 
 
−
***Google vs. Microsoft
 
−
** Programming: Javascript
 
  
−
* Week 5:
+
* Attendance and participation: 10%
−
** Programming: Javascript
+
* Homework assignments (roughly one weekly assignmnent): 50%
−
** Programming: Javascript
+
* Quizzes: 10%
 +
* Final take-home exam: 30%
  
−
* Week 6:
+
No late assigments will be accepted.
−
** Programming: other languages (Macros?)
 
−
** Singularity, AI
 
  
−
* Week 7:
+
==Teaching Assistants==
−
** Chapter 4, NP, solvability, towers of hanoi
 
−
** Singularity
 
  
−
* Week 8:
+
* '''[http://sophia.smith.edu/~acheng/csc Alex Cheng]''' (acheng@email.smith.edu) is the teaching assistant for CSC103 and CSC102
−
** Advanced material
+
* '''Diana Jaunzeikare''' (djaunzei@email.smith.edu) is the roving teaching assistant for computer science courses.
 +
**Hours ( McConnel 104 (CS lounge) ):
 +
:::Sundays 7-10pm
 +
:::Mondays 7-9pm
 +
:::Tuesdays 7-9pm

Latest revision as of 14:05, 29 January 2012

<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" />

Wikis | Weekly Schedule

Dominique Thiébaut
McConnell Hall, 208.
Smith College
Telephone: 3854


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

MostComplexMachine.gif

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)

Tentative list of topics covered

  • Binary system, arithmetic, logic gates (Chaps 1, 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:

Grading

  • Attendance and participation: 10%
  • Homework assignments (roughly one weekly assignmnent): 50%
  • Quizzes: 10%
  • Final take-home exam: 30%

No late assigments will be accepted.

Teaching Assistants

  • Alex Cheng (acheng@email.smith.edu) is the teaching assistant for CSC103 and CSC102
  • Diana Jaunzeikare (djaunzei@email.smith.edu) is the roving teaching assistant for computer science courses.
    • Hours ( McConnel 104 (CS lounge) ):
Sundays 7-10pm
Mondays 7-9pm
Tuesdays 7-9pm
Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC103_2008&oldid=13375"