Difference between revisions of "CSC103 Weekly Schedule Spring 2012"

From dftwiki3
Jump to: navigation, search
(Weekly Schedule)
 
(21 intermediate revisions by the same user not shown)
Line 108: Line 108:
 
</center>
 
</center>
 
----
 
----
* [[CSC103 Lab #1 2012 | Lab #1]]: Logic Design  
+
* [[CSC103 Lab #1 2012 | Lab #1]]: Logic Design [[Image:LabLogo.png|50px|right]]
 
* [[CSC103 Homework #2 2012 | Homework #2]]: Logic Design, and [[CSC103 Homework 2 Solutions 2012| homework solution]].
 
* [[CSC103 Homework #2 2012 | Homework #2]]: Logic Design, and [[CSC103 Homework 2 Solutions 2012| homework solution]].
 
||
 
||
Line 122: Line 122:
  
 
* '''Monday''':  
 
* '''Monday''':  
** [[CSC103 PC Demolition Lab 2012| '''Let's Take-Apart a PC ''' lab]].  Ford Hall Foyer.  Pictures can be found [http://www.facebook.com/media/set/?set=a.10150543054626884.380818.264041891883&type=1 on the CS Facebook page]
+
**[[Image:LabLogo.png|50px|right]] [[CSC103 PC Demolition Lab 2012| '''Let's Take-Apart a PC ''' lab]].  Ford Hall Foyer.  Pictures can be found [http://www.facebook.com/media/set/?set=a.10150543054626884.380818.264041891883&type=1 on the CS Facebook page]
 
** How hard disks work:
 
** How hard disks work:
 
<center><videoflash>uJKxUPlhvZY</videoflash></center>
 
<center><videoflash>uJKxUPlhvZY</videoflash></center>
Line 136: Line 136:
 
** Execution of selected instructions ([[Media:CSC103InstructionsBeforeAfter.pdf|pdf]])
 
** Execution of selected instructions ([[Media:CSC103InstructionsBeforeAfter.pdf|pdf]])
 
----
 
----
* [[CSC103 Homework 3 2012 | Homework #3]]
+
* [[CSC103 Homework 3 2012 | Homework #3]] and [[CSC103 Homework3 Solutions, 2012| Solution]]
 
||
 
||
 
Reading:
 
Reading:
Line 168: Line 168:
 
<center>[[File:MultiCorePerformance.jpg|300px]]</center>
 
<center>[[File:MultiCorePerformance.jpg|300px]]</center>
 
----
 
----
* [[CSC103 Assembly Language Lab | Assembly Language Lab]]  
+
* [[CSC103 Assembly Language Lab | Assembly Language Lab]] [[Image:LabLogo.png|50px|right]]
* [[CSC103 Homework 4 2012 | Homework 4]]
+
* [[CSC103 Homework 4 2012 | Homework 4]] and [[CSC103 Homework 4 solution 2012| Solution program]]
 
||
 
||
 
*  Reading
 
*  Reading
Line 189: Line 189:
 
** [[Introduction_to_Processing | Introduction to Processing]]
 
** [[Introduction_to_Processing | Introduction to Processing]]
 
* '''Wednesday'''   
 
* '''Wednesday'''   
** Processing Lab[[CSC103 Processing Lab|.]]
+
**[[CSC103 Processing Lab| Processing Lab]] in FH 241
 
----
 
----
*
+
* [[CSC103 Processing Lab| Processing Lab]] and [[CSC103_Processing_Lab#Solutions | Solution sketches]][[CSC103_Processing_Lab | lab]]
 +
* [[CSC103 Homework 5 2012| Homework #5 ]] and [[CSC103 Homework 5 Solution 2012| solution program]]
 
||
 
||
 
'''Primary:'''
 
'''Primary:'''
* [http://en.wikipedia.org/wiki/Moore's_law Moore's Law] on [http://en.wikipedia.org/ wikipedia]
+
* [http://en.wikipedia.org/wiki/Moore's_law Moore's Law] in [http://en.wikipedia.org/ wikipedia]
 
* [http://en.wikipedia.org/wiki/Programming_language What is a programming language?] on [http://en.wikipedia.org wikipedia]
 
* [http://en.wikipedia.org/wiki/Programming_language What is a programming language?] on [http://en.wikipedia.org wikipedia]
 
* [http://hlt.media.mit.edu/dfe_readings/processing.pdf C. Reas, B. Fry, Processing: programming for the media arts, AI & Soc (2006) 20: 526–538]
 
* [http://hlt.media.mit.edu/dfe_readings/processing.pdf C. Reas, B. Fry, Processing: programming for the media arts, AI & Soc (2006) 20: 526–538]
Line 207: Line 208:
  
 
* '''Monday'''
 
* '''Monday'''
** The Singularity: Introduction
+
** Projects in Processing: Review of the [[CSC103_Processing_Lab#Solutions | solution sketches]] for the last [[CSC103_Processing_Lab | lab]].
 +
** Review of past homework assignment solutions:
 +
*** [[CSC103 Homework 4 solution 2012| Homework #4]]
 +
*** [[CSC103 Homework3 Solutions, 2012| Solution]]
 +
** The Singularity: Introduction ([http://cs.smith.edu/dftwiki/images/SingularityCSC103_2012.pdf pdf])
 
<br />
 
<br />
 
<videoflashright>1uIzS1uCOcE</videoflashright>
 
<videoflashright>1uIzS1uCOcE</videoflashright>
 +
<br />
 +
<br />
 
<br />
 
<br />
 
<videoflashright>IfbOyw3CT6A</videoflashright>
 
<videoflashright>IfbOyw3CT6A</videoflashright>
Line 233: Line 240:
 
<br />
 
<br />
 
* '''Wednesday'''
 
* '''Wednesday'''
** [[CSC103 Quiz 2011 | Quiz]]
+
** [[CSC103 Quiz 2011 | Quiz]] on two papers
** Class discussion: The singularity
+
** Class discussion: The singularity[[CSC103 Questions for Discussion on Singularity|.]]
 +
** Hod Lipson
 +
** ''Hard'' Computer Problems
 +
** ''Hard'' Computer Problems. Example "Towers of Hanoi" and [http://www.animatedrecursion.com/intermediate/towersofhanoi.html applet] (this [http://www.online-stopwatch.com/ stop-watch] can be useful to time the execution of the program).
 
[[Image:FoodForThought.jpg|right|130px]]
 
[[Image:FoodForThought.jpg|right|130px]]
* Food for thought:
+
* Food for thought...
 
** [[Information_about_the_Singularity | Additional articles]] on the issue of the Singularity (including IEEE Spectrum issue on the subject).
 
** [[Information_about_the_Singularity | Additional articles]] on the issue of the Singularity (including IEEE Spectrum issue on the subject).
 
** [http://www.ted.com/talks/susan_blackmore_on_memes_and_temes.html Susan Blackmore's] TED talk on Memes and Temes.
 
** [http://www.ted.com/talks/susan_blackmore_on_memes_and_temes.html Susan Blackmore's] TED talk on Memes and Temes.
Line 252: Line 262:
  
 
----
 
----
* [[CSC103 2011 Take-Home Final Exam| Final Exam]]
+
* [[CSC103 Take-Home Final Exam 2012| Final Exam]]
  
 
||  
 
||  
 +
* '''Primary'''
 
* [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__signs_of_the_singularity.pdf Signs of the Singularity] by Vernor Vinge.
 
* [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__signs_of_the_singularity.pdf Signs of the Singularity] by Vernor Vinge.
 
* [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__can_machines_be_conscious.pdf Can Machine Be Conscious?], Christof Koch and Giulio Tononi.
 
* [http://cs.smith.edu/~thiebaut/research/singularity/ieee_spectrum__can_machines_be_conscious.pdf Can Machine Be Conscious?], Christof Koch and Giulio Tononi.
 +
* '''Secondary'''
 +
**  [http://en.wikipedia.org/wiki/NP-hard NP-Hard] Computer-Science Problems
  
 
<!-- ================================================================== -->
 
<!-- ================================================================== -->

Latest revision as of 13:03, 23 September 2013

Wikis | Weekly Schedule | Main Page


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

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.


  • 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

    • Schematics from NASA
    • Exercise on Logic Design: a review of the process of going from a description of the function to a circuit.
    • Identifying various parts inside a computer. We want to be able to recognize:
      • The processor
      • The Crystal
      • The Random Access Memory (RAM)
      • The power supply
      • The mother board
      • The hard disk
      • The optical disk (DVD/CD player/burner)
      • The Wiring
      • Various Ports
    • Creating a wiki page on the ClassWiki system (owned by the Smith CS Department)
      • headers
      • paragraphs
      • boxes
      • lists (numbered or not)
      • images
      • links to other wiki pages in classwiki
      • links to Web pages
    • Warning: Two wikis!

DFTwiki.png

ClassWiki.png


Reading:

Week 3
2/13
    • Disassembling a PC:

Reading:

Week 4
2/20


    • the von Neumann bottleneck
      • Memory vs. processor. What do fingernails and football fields have in common?
      • Attempts to circumvent the bottleneck
        • cache memory
        • multicore architectures
MultiCorePerformance.jpg

  • Reading
    • Primary
      • Jon von Neumann, who first defined the architecture of modern computers. We are still building computers according to his original unpublished draft
    • Secondary
Week 5
2/27
  • Monday
    • Moore's Law

MooresLaw.jpg




Primary:

Secondary

Week 6
3/5

























  • Wednesday
    • Quiz on two papers
    • Class discussion: The singularity.
    • Hod Lipson
    • Hard Computer Problems
    • Hard Computer Problems. Example "Towers of Hanoi" and applet (this stop-watch can be useful to time the execution of the program).
FoodForThought.jpg













Week 7
3/12


Take Home Exam Week


Week 7
3/19


Spring Break











...