
<rss version="2.0">
  <channel> 
    <title>cs105's Recent Projects</title> 
    <link>http://scratch.mit.edu/feeds/getRecentUserProjects/38260</link> 
    <description>Recent Projects Feed for cs105</description> 
    <language>en-us</language> 
    <pubDate>Sat, 28 Nov 2009 08:12:41 GMT</pubDate> 
    <docs></docs> 
    <generator>CakePHP</generator> 
    <managingEditor>Han and Andres</managingEditor> 
    <webMaster>genghisu</webMaster> 
	
     
    <item> 
      <title>fly</title> 
      <link>http://scratch.mit.edu/projects/cs105/326538</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/326538_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Demonstrates how an n-squared song can be written using a loop and if statements.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/326538_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>beeston-song</title> 
      <link>http://scratch.mit.edu/projects/cs105/324296</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/324296_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Winner of the 2008 &quot;Scratch Off&quot; competition.  CS105, Rutgers University.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/324296_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>mertens-card</title> 
      <link>http://scratch.mit.edu/projects/cs105/324292</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/324292_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Winner of the Fall 2008 &quot;Scratch Off&quot; competition in CS105, Rutgers Universty.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/324292_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>dempsey-song</title> 
      <link>http://scratch.mit.edu/projects/cs105/321903</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/321903_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Winner of the Fall 2007 CS105 &quot;Scratch Off&quot; competition at Rutgers University.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/321903_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>daftari-song</title> 
      <link>http://scratch.mit.edu/projects/cs105/321901</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/321901_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Winner of the Fall 2007 CS105 &quot;Scratch Off&quot; at Rutgers University.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/321901_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>sorts</title> 
      <link>http://scratch.mit.edu/projects/cs105/310187</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/310187_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Compares two sorting algorithms.  Set n to the number of items to sort.  Click on deck to create a random list.  Click on brown hat to sort via selection sort (O(n^2)).  Click on white hat to sort via binary search sort (O(n log n)).</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/310187_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>counter-08</title> 
      <link>http://scratch.mit.edu/projects/cs105/268255</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/268255_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Counts in binary, announcing the highest bit that changes.  Put in your own sounds for an odd binary symphony.  Sounds provided by CS105, Fall 2008.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/268255_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>not_gate_simulation</title> 
      <link>http://scratch.mit.edu/projects/cs105/263631</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/263631_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Click the A switch to watch the relay compute the logical function &quot;not A&quot;!</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/263631_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>and_gate_simulation</title> 
      <link>http://scratch.mit.edu/projects/cs105/263630</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/263630_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;flip the switches (A and B) by clicking and watch the relays work to act like an &quot;and&quot; gate.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/263630_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>righthandrule</title> 
      <link>http://scratch.mit.edu/projects/cs105/240417</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/240417_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Trying to emulate Karel the robot for Alex.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/240417_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>mysterytour</title> 
      <link>http://scratch.mit.edu/projects/cs105/43473</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/43473_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Three songs: The Beatles song demonstrates subroutines with variables.  The beer song demosntrates recursive subroutines with variables.  And the Brak song demonstrates recursion gone horribly wrong.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/43473_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>mcdonald</title> 
      <link>http://scratch.mit.edu/projects/cs105/43472</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/43472_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Sings the Old McDonald song, to show how the subroutine stack works.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/43472_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>gilligan</title> 
      <link>http://scratch.mit.edu/projects/cs105/43471</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/43471_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Sing's Gilligan's Island's theme song, one line at a time.  Then, sings Clementine, one line at a time.  Shows how some simple subroutines work.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/43471_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>counter-07b</title> 
      <link>http://scratch.mit.edu/projects/cs105/37651</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/37651_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Counts in binary, announcing the highest bit that changes.  Put in your own sounds for an odd binary symphony.Sounds effects compliments of the students of Rutgers CS105, Fall 2007.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/37651_sm.png</imagelink>
    </item> 
     
    <item> 
      <title>counter</title> 
      <link>http://scratch.mit.edu/projects/cs105/36694</link> 
      <description>&lt;img src=&quot;http://scratch.mit.edu/static/projects/cs105/36694_sm.png&quot; width=&quot;148&quot; height=&quot;111&quot; border=&quot;1&quot; alt=&quot;&quot; /&gt;Counts in binary, announcing the highest bit that changes.  Put in your own sounds for an odd binary symphony.</description> 
	  <imagelink>http://scratch.mit.edu/static/projects/cs105/36694_sm.png</imagelink>
    </item> 
     
  </channel> 
</rss>
 