Difference between revisions of "CSC103 Weekly Schedule 2013"

From dftwiki3
Jump to: navigation, search
Line 25: Line 25:
 
|width="60%"|
 
|width="60%"|
 
* '''Tuesday'''
 
* '''Tuesday'''
−
** Introduce Syllabus
+
** Syllabus
 +
** Introduction to the class and the 1/2 semester schedule
 +
** Organization of the class
 +
** [http://www.youtube.com/watch?v=0eAk6oNBSMU a short movie] to get the discussion started...
 +
** some examples of computers:
 +
<br />
 +
<center>[[Image:AbacusWolfram.png|400px]]</center>
 +
<br />
 +
<center>[[Image:DifferenceEngine.jpg|400px]]</center>
 +
<br />
 +
<center>[[Image:DifferenceEngineDetail.jpg|400px]]</center>
 +
<br />
 +
<center>[[Image:DNAComputer.png|400px]]</center>
 +
<br />
 +
<center>[[File:Antikythera.jpg|400px]]<br />Antikythera mechanism, oldest computer</center>
 +
<br />
 +
<center><videoflash>mpkTHyfr0pM</videoflash></center>
 +
(start at 1min 47sec)
 +
<br />
 +
<center>[[Image:DoubleHelix.jpg|400px]] <br />
 +
Harvard research: [http://www.computerworld.com/s/article/9230401/Harvard_stores_70_billion_books_using_DNA 1.8 zettabytes in 4 grams of DNA]</center>
 +
<br />
 +
** Keywords:
 +
*** <font color="magenta">code</font>:  Translating from one system of values to another system.
 +
** <font color="magenta">Electricity</font>
 +
** <font color="magenta">The Binary System</font>: 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.
 +
** <font color="magenta">The Transistor</font>: A switch controlled by electricity. 
 +
** Two giants for computer science:
 +
*** <font color="magenta">George Boole</font> (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'''.
 +
 
 +
<br />
 
* '''Thursday'''
 
* '''Thursday'''
  

Revision as of 19:07, 2 September 2013

--D. Thiebaut 10:23, 1 April 2013 (EDT)



Syllabus | PIAZZA


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


AbacusWolfram.png


DifferenceEngine.jpg


DifferenceEngineDetail.jpg


DNAComputer.png


Antikythera.jpg
Antikythera mechanism, oldest computer


(start at 1min 47sec)

DoubleHelix.jpg
Harvard research: 1.8 zettabytes in 4 grams of DNA


    • 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.


  • Thursday
Week 2
9/10
  • Tuesday
  • Thursday

 


Week 3
9/17
  • Tuesday
  • Thursday
Week 4
9/24
  • Tuesday
  • Thursday

 

Week 5
10/1
  • Tuesday
  • Thursday
Week 6
10/8
  • Tuesday
  • Thursday

 

Week 7
10/15
  • Tuesday: Fall Break
  • Thursday


Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC103_Weekly_Schedule_2013&oldid=17418"