<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"><channel><title>Sproutly - Latest Comments in UC Berkeley Algorithms (CS170) Textbook</title><link>http://sproutly.disqus.com/</link><description></description><language>en</language><lastBuildDate>Tue, 24 Nov 2009 12:16:27 -0000</lastBuildDate><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-23958449</link><description>nice text book.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">sjscarlet</dc:creator><pubDate>Tue, 24 Nov 2009 12:16:27 -0000</pubDate></item><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-23937363</link><description>Browsing around on Scribd, I was able to find the exact textbook we used for the class. The authors, Papadimitriou and Varizani, were actually my professors for the course. The book was surprisingly easy to read, clear and concise. Take a peak; I think you’ll appreciate the resource.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">kajdkalsj</dc:creator><pubDate>Tue, 24 Nov 2009 05:56:10 -0000</pubDate></item><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-23860625</link><description>Thanks</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">sladjlakjdkl</dc:creator><pubDate>Mon, 23 Nov 2009 04:32:56 -0000</pubDate></item><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-23175639</link><description>I was able to find the exact textbook we used for the class. The authors, Papadimitriou and Varizani, were actually my professors for the course.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">ksdjkalj</dc:creator><pubDate>Mon, 16 Nov 2009 02:40:16 -0000</pubDate></item><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-22204011</link><description>Browsing around on Scribd, I was able to find the exact textbook we used for the class. The authors, Papadimitriou and Varizani, were actually my professors for the course.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">watchmovies73</dc:creator><pubDate>Sun, 08 Nov 2009 02:23:52 -0000</pubDate></item><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-1578621</link><description>If you want to get a deal on this textbook check out &lt;a href="http://www.wecomparebooks.com" rel="nofollow"&gt;www.wecomparebooks.com&lt;/a&gt;&lt;br&gt;Here you can compare prices on this book and get the best deal on the net!</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">jon</dc:creator><pubDate>Sun, 17 Aug 2008 18:56:28 -0000</pubDate></item><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-545901</link><description>It really depends on the size of the class. If it's a small class and the teacher knows everyone by name, it's slightly different from blending in with the mass of faces in a large lecture hall. If it's a small class that's full, you might not be able to sit in. You COULD tell the professor you are auditing. Just check &lt;a href="http://schedule.berkeley.edu" rel="nofollow"&gt;http://schedule.berkeley.edu&lt;/a&gt; for class size and schedule.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jerry</dc:creator><pubDate>Wed, 28 May 2008 20:39:16 -0000</pubDate></item><item><title>Re: UC Berkeley Algorithms (CS170) Textbook</title><link>http://www.sproutly.com/2008/05/20/uc-berkeley-algorithms-cs170-textbook/#comment-539927</link><description>Original source (and more recent): &lt;a href="http://www.cs.berkeley.edu/%7Evazirani/algorithms.html" rel="nofollow"&gt;http://www.cs.berkeley.edu/~vazirani/algorithms...&lt;/a&gt;&lt;br&gt;&lt;br&gt;An aside: how easy is it to sit in a lecture without being enrolled? I'm living on/near the Berkeley campus this summer and would like to attend a few lectures in the CS dept.</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Kenny</dc:creator><pubDate>Wed, 28 May 2008 00:34:11 -0000</pubDate></item></channel></rss>