<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="https://www.cs.vassar.edu/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="https://www.cs.vassar.edu/feed.php">
        <title>Computer Science | Vassar College</title>
        <description></description>
        <link>https://www.cs.vassar.edu/</link>
        <image rdf:resource="https://www.cs.vassar.edu/_media/favicon.ico" />
       <dc:date>2026-06-09T19:41:59+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="https://www.cs.vassar.edu/courses/adjuncts?rev=1354727518&amp;do=diff"/>
                <rdf:li rdf:resource="https://www.cs.vassar.edu/courses/visiting?rev=1342454746&amp;do=diff"/>
                <rdf:li rdf:resource="https://www.cs.vassar.edu/courses/cs101-2021-5657/texts?rev=1612764717&amp;do=diff"/>
                <rdf:li rdf:resource="https://www.cs.vassar.edu/courses/cs203-201602/assignments/top?rev=1493177344&amp;do=diff"/>
                <rdf:li rdf:resource="https://www.cs.vassar.edu/courses/cs325-201001/assignments/top?rev=1266429509&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="https://www.cs.vassar.edu/_media/favicon.ico">
        <title>Computer Science | Vassar College</title>
        <link>https://www.cs.vassar.edu/</link>
        <url>https://www.cs.vassar.edu/_media/favicon.ico</url>
    </image>
    <item rdf:about="https://www.cs.vassar.edu/courses/adjuncts?rev=1354727518&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2012-12-05T17:11:58+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>adjuncts</title>
        <link>https://www.cs.vassar.edu/courses/adjuncts?rev=1354727518&amp;do=diff</link>
        <description>2013 Adjunct Professor Courses

CMPU 145 - Foundations of Computer Science

Introduces the theoretical, structural and algorithmic foundations of computer science. Topics include: sets, relations, functions, recursive data structures, recursive functions, induction, structural induction, probability, logic, Boolean algebra, proving program correctness, and the lambda calculus. Concepts are reinforced in programming exercises in the laboratory.</description>
    </item>
    <item rdf:about="https://www.cs.vassar.edu/courses/visiting?rev=1342454746&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2012-07-16T16:05:46+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>visiting</title>
        <link>https://www.cs.vassar.edu/courses/visiting?rev=1342454746&amp;do=diff</link>
        <description>Visiting Professor Courses

Here are some of the courses previously taught by visiting professors.

CMPU 203 - Computer Science III: Software Design and Implementation

Develops techniques for design and implementation of complex software systems. Topics include object-oriented modeling, design patterns, component libraries, inheritance, parametric polymorphism, generic algorithms, containers, iterators, function objects and storage management. Development of a software system of significant com…</description>
    </item>
    <item rdf:about="https://www.cs.vassar.edu/courses/cs101-2021-5657/texts?rev=1612764717&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2021-02-08T06:11:57+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>texts</title>
        <link>https://www.cs.vassar.edu/courses/cs101-2021-5657/texts?rev=1612764717&amp;do=diff</link>
        <description>Supplementary Readings



On writing:

Strunk and White The Elements of Style bartelby.com, 1918

there is no better book on style in writing (anything)

On learning to program:

Friedman, Felleisen The Little Schemer: Fourth Edition MIT Press, 1996

an alternative introduction to recursive programming</description>
    </item>
    <item rdf:about="https://www.cs.vassar.edu/courses/cs203-201602/assignments/top?rev=1493177344&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2017-04-26T03:29:04+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>top</title>
        <link>https://www.cs.vassar.edu/courses/cs203-201602/assignments/top?rev=1493177344&amp;do=diff</link>
        <description>&lt;html&gt;
&lt;h2&gt;Assignments: &lt;/h2&gt;
&lt;/html&gt;

Assignment 1: Chapter 2, #6, 8, and 12 - Due Wednesday, 2/15/2017 - Please hand in your work on hardcopy (paper).


Assignment 2: Chapter 3, #26 and 27 - Due Wednesday, March 8, 2017. 

----------

&lt;html&gt;
&lt;h2&gt;Labs: &lt;/h2&gt;
&lt;/html&gt;</description>
    </item>
    <item rdf:about="https://www.cs.vassar.edu/courses/cs325-201001/assignments/top?rev=1266429509&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2010-02-17T17:58:29+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>top</title>
        <link>https://www.cs.vassar.edu/courses/cs325-201001/assignments/top?rev=1266429509&amp;do=diff</link>
        <description>&lt;html&gt;
&lt;h2&gt;Assignments: &lt;/h2&gt;
&lt;/html&gt;

Assignment 1: 

First Program: 
Write 00h to 8000h, read 8000h, compare to 0, halt if zero.
If not zero, go into an infinite loop.

Second Program: 
Write AAh to every memory byte in RAM, check every byte in RAM for AAh.
If not, go into an infinite loop.
Write 55h to every memory byte in RAM, check every byte in RAM for 55h.
If not, go into an infinite loop.</description>
    </item>
</rdf:RDF>
