Difference between revisions of "CSC103 Weekly Schedule Fall 2012"

From dftwiki3
Jump to: navigation, search
(→‎Weekly Schedule)
(→‎Weekly Schedule)
Line 67: Line 67:
 
* '''Tuesday'''
 
* '''Tuesday'''
 
** [[CSC103_Syllabus_2012F#Overview| A note on registering for CSC102]]
 
** [[CSC103_Syllabus_2012F#Overview| A note on registering for CSC102]]
 +
** (Shameless plug for [http://www.facebook.com/pages/Computer-Science-Smith-College/264041891883 CS Facebook page])
 
** Three different "worlds":  
 
** Three different "worlds":  
 
::{|style="border-collapse: separate; border-spacing: 0; border-width: 1px; border-style: solid; border-color: #000; padding: 0"
 
::{|style="border-collapse: separate; border-spacing: 0; border-width: 1px; border-style: solid; border-color: #000; padding: 0"
Line 89: Line 90:
 
** Counting in decimal
 
** Counting in decimal
 
** Counting in base 8: 0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 20, ... 76, 77, 100, 101, ...
 
** Counting in base 8: 0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 20, ... 76, 77, 100, 101, ...
 +
** Interesting published research result: [http://www.upenn.edu/pennnews/news/penn-researchers-make-first-all-optical-nanowire-switch U. Penn designs first optical gate]
 
<br />
 
<br />
 
* '''Thursday'''  
 
* '''Thursday'''  
Line 96: Line 98:
 
** [[CSC103 Exercises on Binary System and Boolean Logic | Exercises]]
 
** [[CSC103 Exercises on Binary System and Boolean Logic | Exercises]]
 
** <font color="magenta">Claude Shannon</font> (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.
 
** <font color="magenta">Claude Shannon</font> (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.
−
** (Shameless plug for [http://www.facebook.com/pages/Computer-Science-Smith-College/264041891883 CS Facebook page])
+
 
−
** Interesting published research result: [http://www.upenn.edu/pennnews/news/penn-researchers-make-first-all-optical-nanowire-switch U. Penn designs first optical gate]
 
 
----
 
----
 
*  [[CSC103 Homework 1 2012f| Homework #1]] will be given out Thursday evening, will be due a week later.
 
*  [[CSC103 Homework 1 2012f| Homework #1]] will be given out Thursday evening, will be due a week later.

Revision as of 13:28, 11 September 2012

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

Wikis | Weekly Schedule | Main Page


Office Hours: Tu-Th: 2:00-4:00 p.m. and by appointment.

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


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.
Week 2
9/11
World 1
(Logic) 		World 2
(Technology) 		World 3
(Math)
George Boole (1779-1848)

Expressions that can be True or False
Operators to combine expressions
And, Or, Not

Electricity

Switches (transistors)
ON/OFF
The idea of a code

Number systems

Decimal: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
Binary: 0, 1

    • Counting in decimal
    • Counting in base 8: 0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 20, ... 76, 77, 100, 101, ...
    • Interesting published research result: U. Penn designs first optical gate


  • Thursday
    • Counting in base 2 (binary)
    • Adding in decimal
    • Adding in base 2
    • Exercises
    • 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.
  • Homework #1 will be given out Thursday evening, will be due a week later.
Week 3
9/18
  • Tuesday
  • Thursday
  • Reading:
Week 4
9/25
  • Reading
Week 5
10/2
  • Tuesday
  • Thursday
  • Reading
Week 6
10/9
  • Tuesday: Fall Break
  • Thursday
  • Reading
Week 7
10/16
  • Tuesday
  • Thursday: Take-home Final Exam
  • Reading
Week 8
10/23
  • Tuesday: Final Exam Q&A
  • Reading










...


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