Difference between revisions of "CSC103 Syllabus 2012 (old)"

From dftwiki3
Jump to: navigation, search
(Tentative list of topics covered)
 
(14 intermediate revisions by the same user not shown)
Line 9: Line 9:
 
<meta name="robots" content="FOLLOW,INDEX" />
 
<meta name="robots" content="FOLLOW,INDEX" />
  
<center> [http://tango.csc.smith.edu/classwiki/index.php/CSC103_Page Wikis] |  [[CSC103 Weekly Schedule | Weekly Schedule]] </center>
+
<center> [http://cs.smith.edu/classwiki/index.php/CSC103_Page_2012 Wikis] |  [[CSC103 Weekly Schedule 2012 | Weekly Schedule]] </center>
  
 
Dominique Thiébaut<br />  
 
Dominique Thiébaut<br />  
Line 18: Line 18:
 
__TOC__
 
__TOC__
  
<center>[[Image:underConstruction.gif]]</center>
+
<!--center>[[Image:underConstruction.gif]]</center-->
  
 
=CSC 103: How Computers Work, Spring 12=
 
=CSC 103: How Computers Work, Spring 12=
Line 39: Line 39:
 
Office: Ford Hall 356, Clark Science Center<br />
 
Office: Ford Hall 356, Clark Science Center<br />
 
Email: thiebaut@cs.smith.edu<br />
 
Email: thiebaut@cs.smith.edu<br />
Office Hours: TBA<br />
+
Office Hours: '''Office Hours:''' M 1:10-3:00 p.m., W 4:00-6:00 p.m.<br />
  
 
==Schedule==
 
==Schedule==
Line 62: Line 62:
  
 
*Binary system, arithmetic, logic gates   
 
*Binary system, arithmetic, logic gates   
*logic gates, binary adder   
+
* Logic gates, binary adder   
* Building a computer  
+
* Logic design: building a simple circuit typically found inside microprocessors.
**von Neuman architecture
+
* What's inside a computer?
 +
** Computer architecture: the methodology used to design computers:  the ''von Neumann'' 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
+
* '''Assembly Language''': how a microprocessor operates: what does it do?  How fast?
* History of computers
+
* History of computers  
* Programming: Javascript
+
** Babbage
 +
* Programming: the '''Javascript''' language
 
** Programming Environment  
 
** Programming Environment  
 
** Program development  
 
** Program development  
 +
** Creating Web Pages
 
** Other programming languages
 
** Other programming languages
* Parallel Programming
+
* Important Concepts:
** Folding @ home
+
** '''Moore's Law'''
** SETI
+
** '''Von Neumann's bottleneck'''
* The Singularity:
+
** 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__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.
+
*** [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__can_machines_be_conscious.pdf Can Machine Be Conscious?], Christof Koch and Giulio Tononi.
  
 
==Grading==
 
==Grading==
  
 
* Attendance and participation: 10%
 
* Attendance and participation: 10%
* Homework assignments (roughly one weekly assignmnent): 50%
+
* Homework assignments (roughly one weekly assignmnent): 50%.  Homework assignments will be typically due on Wednesdays.
* Quizzes: 10%
+
* Quiz: 10%
 
* Final take-home exam: 30%
 
* Final take-home exam: 30%
  
No late assigments will be accepted.
+
<center>'''No late assigments will be accepted.'''</center>
  
 
==Teaching Assistants==
 
==Teaching Assistants==
  
* TBA
+
* Lucia Villagra (lvillagr@smith.edu), TA hours Tuesday evening from 7-9 p.m., FH 241.
 +
 
 +
<br />
 +
 
 +
<br />
 +
 
 +
<br />
 +
 
 +
<br />
 +
 
 +
<br />
 +
 
 +
<br />
 +
 
 +
<br />
 +
 
 +
<br />
 +
 
 +
<br />
 +
[[Category:CSC103]]

Latest revision as of 15:43, 26 February 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
Ford Hall 356, 208.
Smith College
Telephone: 3854


CSC 103: How Computers Work, Spring 12

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: Ford Hall 356, Clark Science Center
Email: thiebaut@cs.smith.edu
Office Hours: Office Hours: M 1:10-3:00 p.m., W 4:00-6:00 p.m.

Schedule

First half of Spring 2012: Mon January 30th, to Wed. March 7, 2012.

Textbook

HowCOmptuersWorkRonWhite.png
MostComplexMachine.gif
  • There are no textbooks for the class. We will use on line resources throughout the class.
  • If you'd prefer having a textbook to read, these are good options:
    • How Computers Work., by Ron White, 9th Edition, QUE [1]. QUE Editor.
    • The Most Complex Machine., by David Eck, A. K. Peters, Natick Ma [2].





Tentative list of topics covered

  • Binary system, arithmetic, logic gates
  • Logic gates, binary adder
  • Logic design: building a simple circuit typically found inside microprocessors.
  • What's inside a computer?
    • Computer architecture: the methodology used to design computers: the von Neumann architecture
    • Von Neuman bottleneck
    • CPU, RAM, Secondary Memory
  • Assembly Language: how a microprocessor operates: what does it do? How fast?
  • History of computers
    • Babbage
  • Programming: the Javascript language
    • Programming Environment
    • Program development
    • Creating Web Pages
    • Other programming languages
  • Important Concepts:

Grading

  • Attendance and participation: 10%
  • Homework assignments (roughly one weekly assignmnent): 50%. Homework assignments will be typically due on Wednesdays.
  • Quiz: 10%
  • Final take-home exam: 30%
No late assigments will be accepted.

Teaching Assistants

  • Lucia Villagra (lvillagr@smith.edu), TA hours Tuesday evening from 7-9 p.m., FH 241.