Difference between revisions of "CSC103 Weekly Schedule 2013"

From dftwiki3
Jump to: navigation, search
 
(33 intermediate revisions by the same user not shown)
Line 3: Line 3:
  
  
−
<!--
+
<onlydft>
−
Will be provided at a later date... please stay tuned...
 
−
 
 
−
<br />
 
−
<center>
 
−
<font size="+2">Page under construction!</font>
 
−
<br \>[[File:UnderConstruction.jpg|300px]]
 
−
</center>
 
−
-->
 
  
 
<br />
 
<br />
Line 150: Line 142:
 
*** [[CSC103 Assembly Language Lab (version 2) 2013| Lab]] on Assembly Language
 
*** [[CSC103 Assembly Language Lab (version 2) 2013| Lab]] on Assembly Language
 
----
 
----
−
* [[CSC103 Homework 2 2013 | Homework 2]] due 9/24/13 at 9:00 a.m.
+
* [[CSC103 Homework 2 2013 | Homework 2]] and [[CSC103_Homework_2_Solution_2013 | Solution]]
 
* [[CSC103 Assembly Language Lab (version 2) 2013 | Lab 2]] on Assembly Language
 
* [[CSC103 Assembly Language Lab (version 2) 2013 | Lab 2]] on Assembly Language
 
||
 
||
Line 168: Line 160:
 
----
 
----
 
----
 
----
−
* '''Thursday'''
+
* '''Thursday''' <font color="magenta">MOUNTAIN DAY!</font>
−
<br /><center>[[File:MountainDay.png|450px]]</center><br />
+
<br />
 +
<center>[[File:MountainDay.png|450px]]</center><br />
 
----
 
----
 
*  [[CSC103 Homework 3 2013 | Homework 3]] is available.  Due <strike>10/3/13</strike> 10/8/13 @ 9:00 a.m.
 
*  [[CSC103 Homework 3 2013 | Homework 3]] is available.  Due <strike>10/3/13</strike> 10/8/13 @ 9:00 a.m.
Line 182: Line 175:
 
* '''Tuesday'''
 
* '''Tuesday'''
 
** Going over the last problem of Lab 2
 
** Going over the last problem of Lab 2
−
** The Von Neumann bottleneck.
+
** The '''Von Neumann''' bottleneck.
 
<center>[[File:MooresLawProcessorMemoryGap.png|450px]]</center>
 
<center>[[File:MooresLawProcessorMemoryGap.png|450px]]</center>
 
<br />
 
<br />
 
<center>[[File:FootballField.jpg|400px]]</center>
 
<center>[[File:FootballField.jpg|400px]]</center>
 
<br />
 
<br />
−
** Moore's Law, first introduced in 1965.  The number of transistors in circuits doubles every 18 months.  What it is, what it means, how it has been extended.
+
** '''Moore's Law''', first introduced in 1965.  The number of transistors in circuits doubles every 18 months.  What it is, what it means, how it has been extended.
 
** Understanding Exponential Growth
 
** Understanding Exponential Growth
 
<center>[[Image:riceOnChessboard.jpg|400px]]</center>
 
<center>[[Image:riceOnChessboard.jpg|400px]]</center>
Line 194: Line 187:
 
<br />
 
<br />
 
<center>[[File:HockeyStick.gif|400px]]</center>
 
<center>[[File:HockeyStick.gif|400px]]</center>
 +
<br />
 +
<center>[[File:LogarithmicScale1.jpg|500px]]</center>
 +
<br />
 +
<center>[[File:CSC103_ExponentialGrowthLogarithmicScale.png|400px]]</center>
 
<br />
 
<br />
 
<center>[[File:MooresLaw.jpg|400px]]</center>
 
<center>[[File:MooresLaw.jpg|400px]]</center>
Line 206: Line 203:
 
<br />
 
<br />
 
<center>[[File:MooresLawProcessorMemoryGap.gif]]</center>
 
<center>[[File:MooresLawProcessorMemoryGap.gif]]</center>
 +
----
 +
----
 +
----
 +
----
  
 
* '''Thursday'''
 
* '''Thursday'''
 +
** What is Processing?  Ben Fry, one of the co-inventors of the language, explains.
 +
<center><videoflash>z-g-cWDnUdU</videoflash></center><br />
 +
:This is less about Processing than about data visualization, and how '''Ben Fry''', one of the co-authors of Processing uses the language to represent data.  Several of his projects are presented.
 +
<br />
 +
<center><videoflash>M5dFb2x-NcA</videoflash></center>
 +
:Ben Fry generated the computer graphics for Minority Report (start watching around Time Stamp 7 minutes 25 seconds).
 +
** Introduction to the language "Processing": [[Introduction_to_Processing | Web Page]], [http://cs.smith.edu/dftwiki/images/IntroductionToProcessing_thiebaut_CSC103.key  Keynote], [http://cs.smith.edu/dftwiki/images/IntroductionToProcessing_thiebaut_CSC103.mov Quicktime]
 +
** To download and install Processing, go to '''[http://processing.org Processing.org]'''
  
 
----
 
----
 
*  
 
*  
 
||
 
||
−
 
+
Reading:
 +
* [[CSC103:_DT%27s_Notes_1 | Instructor's Notes]]  On Von Neumann's Bottleneck and on Moore's Law.
 
<!-- ================================================================== -->
 
<!-- ================================================================== -->
 
|- style="background:#eeeeff" valign="top"
 
|- style="background:#eeeeff" valign="top"
Line 218: Line 228:
 
||
 
||
 
* '''Tuesday'''
 
* '''Tuesday'''
−
* '''Thursday''': <font color="magenta">Take-Home Exam</font>
+
** Programming in  '''[http://processing.org Processing]''': [[CSC103_Processing_Lab | Processing Lab]]
 +
**  '''[http://processing.org Processing]''' Lab (<font color="red">Please install Processing on your computer before the lab, if you are going to use your own laptop.  The directions can be found [[CSC103 Directions for Installing Processing | here]]</font>).
 +
 
 +
* '''Thursday'''
 +
[[Image:FacebookPage1013.png|right|100px|link=https://www.facebook.com/pages/Computer-Science-Smith-College/264041891883]]
 +
** [[Media:CSC103_PCDemolitionLab_2013.pdf | PC Demolition Lab]] (see the pictures on the  [https://www.facebook.com/pages/Computer-Science-Smith-College/264041891883 department Facebook page]!)
 +
** <font color="magenta">Take-Home Exam</font>
  
 
----
 
----
 +
* [[CSC103_Processing_Lab | Processing Lab]]
 
* [[CSC103 Take-Home Exam 2013| Take-Home Exam]]
 
* [[CSC103 Take-Home Exam 2013| Take-Home Exam]]
 
||
 
||
Line 230: Line 247:
 
|width="60%"|
 
|width="60%"|
 
* '''Tuesday''': <font color="magenta">Fall Break</font>
 
* '''Tuesday''': <font color="magenta">Fall Break</font>
 +
<br /><center>[[File:DancingCalving.gif]]</center><br />
 +
<br />
 +
----
 +
----
 
* '''Thursday'''
 
* '''Thursday'''
−
** Quiz
+
** [[CSC103 Quiz on Singularity 2013 | Quiz]]
 
** Discussion
 
** Discussion
 
*** [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 Machines Be Conscious?], Christof Koch and Giulio Tononi.
−
 
+
** Ray Kurzweil on the Singularity.  Bio taken from [http://en.wikipedia.org/wiki/Ray_Kurzweil Wikipedia]:
−
 
+
<blockquote>
 +
Raymond "Ray" Kurzweil (/ˈkɜrzwaɪl/ kurz-wyl; born February 12, 1948) is an American author, inventor, futurist, and a director of engineering at Google. Aside from futurology, he is involved in fields such as optical character recognition (OCR), text-to-speech synthesis, speech recognition technology, and electronic keyboard instruments. He has written books on health, artificial intelligence (AI), transhumanism, the technological singularity, and futurism. Kurzweil is a public advocate for the futurist and transhumanist movements, as has been displayed in his vast collection of public talks, wherein he has shared his primarily optimistic outlooks on life extension technologies and the future of nanotechnology, robotics, and biotechnology.
 +
</blockquote>
 +
<br />
 +
<center><videoflash>IfbOyw3CT6A</videoflash></center>
 +
<br />
 +
<center><videoflash>1uIzS1uCOcE</videoflash></center>
 +
<br />
 +
* Food for thought...
 +
** [[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.
 
----
 
----
 
*  
 
*  
Line 244: Line 275:
  
 
|}
 
|}
 +
</onlydft>
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
<br />
 +
* [[CSC103 Make-Up Homework 2013 | Optional Homework]]

Latest revision as of 09:39, 18 July 2017

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



...




































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