CSC103 Weekly Schedule Fall 2012

From dftwiki3
Revision as of 12:05, 21 August 2012 by Thiebaut (talk | contribs) (Created page with "--~~~~ ---- __NOTOC__ <center> [http://cs.smith.edu/classwiki/index.php/CSC103_Page_2012f Wikis] | Weekly Schedule | [[CSC103_2012f | Main Pag...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

--D. Thiebaut 12:05, 21 August 2012 (EDT)


Wikis | Weekly Schedule | Main Page


Office Hours: TBA

Weekly Schedule

Week Topics Reading
Week 1
9/6
  • Thursday
    • Introduction to the class and the 1/2 semester
    • Organization of the class
    • a short movie to get the discussion started...
    • some examples of computers:


AbacusWolfram.png


DifferenceEngine.jpg


DifferenceEngineDetail.jpg


DNAComputer.png


(start at 1min 47sec)

    • Keywords:
      • code: Translating from one system of values to another system.
    • Electricity
    • The Binary System: a system where the only two numbers available are 0 and 1. Every operation that we can do in decimal, with 10 digits, we can also do in binary.
    • The Transistor: A switch controlled by electricity.
    • Two giants for computer science:
      • George Boole (1779-1848): logic expression = boolean expression. Logic: creating formulas where variables are combined by operators. The variables are boolean variables, the operators are logic operators. Any formula can be represented with a combination of just three operators: AND, OR, and NOT.
      • Claude Shannon (1916-2001): writes a Master's thesis at MIT in 1948, which states that any binary numerical computation can be performed using logic expressions and logic operators.



Week 2
9/11
  • Tuesday
  • Thursday

Reading:

Week 3
9/18
  • Tuesday
  • Thursday

Reading:

Week 4
9/25
  • Tuesday
  • Thursday

  • Reading
Week 5
10/2
  • Tuesday
  • Thursday

Reading:

Week 6
10/9
  • Tuesday: Fall Break
  • Thursday

  • Reading
Week 7
10/16
  • Tuesday
  • Thursday
  • Reading










...