CSC103 Weekly Schedule Spring 2012

From dftwiki3
Revision as of 15:21, 6 February 2012 by Thiebaut (talk | contribs)
Jump to: navigation, search
Wikis | Weekly Schedule | Main Page


Weekly Schedule


Office Hours: M 1:10-3:00 p.m., W 4:00-6:00 p.m.

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.


  • Wednesday
    • Review of the binary system
    • Exercises on binary (and other) systems and Logic
    • 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

    • we stopped last week at Shannon's Master's Thesis (MIT).
    • building a 2-bit adder with logic gates.
    • Two-bit adder (verify the equations with this exercise
    • Logic Gates
    • Data sheet for the AND gate.
    • Data sheet for the NOT gate.
    • Data sheet for the OR gate.
    • Logic Design
    • Simulator
    • Lab #1
  • Wednesday

Week 3
2/13
  • Monday: Let's Take-Apart a PC lab. Ford Hall Foyer.
  • 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