Difference between revisions of "CSC103 Weekly Schedule Spring 2012"

From dftwiki3
Jump to: navigation, search
(Weekly Schedule)
(Weekly Schedule)
Line 43: Line 43:
 
*   
 
*   
 
||
 
||
 
+
* Reading
*
+
** Primary:
 +
***[http://www.youtube.com/watch?v=Bl2RlVekfwM Video] (Part 2) on George Boole and Boolean Algebra. (5.18 min)
 +
***[http://en.wikipedia.org/wiki/Claude_E._Shannon#Boolean_theory Shannon's MIT Thesis], and boolean theory
 +
***[http://en.wikipedia.org/wiki/Binary_numeral_system#Counting_in_binary Counting in Binary]
 +
***[http://knol.google.com/k/counting-in-binary-for-beginners# Counting in binary for beginners]
 +
** Secondary:
 
<!-- ================================================================== -->
 
<!-- ================================================================== -->
 
|- style="background:#eeeeff" valign="top"
 
|- style="background:#eeeeff" valign="top"

Revision as of 16:51, 29 January 2012

Wikis | Weekly Schedule | Main Page


Weekly Schedule

Week Topics Reading
Week 1
1/30
  • Monday
    • 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
2/6
  • Monday
  • Wednesday

Week 3
2/13
  • Monday
  • Wednesday

Week 4
2/20
  • Monday
  • Wednesday

Week 5
2/27
  • Monday
  • Wednesday

Week 6
3/5
  • Monday
  • Wednesday

Week 7
3/12


Take Home Exam Week


Week 7
3/19


Spring Break