View source for User:Jeffj/CS50X2/Syllabus

<!-- {{Underconstruction}} REMOVE AFTER SYLLABUS IS COMPLETE -->
{{TOCright|limit=3}}
== CS 50X2 Accelerated Programming ==
Spring 2020, Section 001, TWR 3:00pm-5:15pm, CSM 216 (6 credits)

== Instructor ==
{{User:Jeff.jenness/Contact Header|style=compact}}

== Course Descriptions ==
{{:Courses/CS 5012/Description}}
{{:Courses/CS 5022/Description}}
{{:Courses/CS 5032/Description}}

=== Course Outcomes ===
Same as outcomes in [[Courses/CS_2114/Outcomes|CS 2114]], [[Courses/CS_2124/Outcomes|CS 2124]], and [[Courses/CS_3113/Outcomes|CS 3113]]

=== Grading === 
Grades are assigned on a standard scale with the following weights:
:<table border=0><tr><th align=left>Tests (2)</th><td></td><td>50%</td></tr><tr><th align=left>Final</th><td></td><td>25%</td></tr><tr><th align=left>Programs</th><td></td><td>25%</td></tr></table>

''Note:'' programs should follow the department guidelines: [[Computer_Science_Program_Grading_Criteria|CS Program Grading Criteria]]

=== Schedule ===
<!-- 
''(subject to change)''
<table border=0>
<tr><th>Week&nbsp;&nbsp;</th><th>Topic</th><th>Reading</th><th>Assignment</th></tr>
<tr><td align=center valign=top>1</td>
    <td></td>
    <td valign=top>Chapter 1: Introduction to finite state machines</td><td valign=top></td></tr>
<tr><td align=center valign=top>2</td>
    <td></td>
    <td valign=top>Chapter 1: Formal definitions, Proofs of closure of operations</td><td valign=top></td></tr>
<tr><td align=center valign=top>3</td>
    <td></td>
    <td valign=top>Chapter 1:.Nondeterminism, proof of equivalence</td><td valign=top></td></tr>
<tr><td align=center valign=top>4</td>
    <td></td>
    <td valign=top>Chapter 1: Regular Expressions, proof of equivalence</td><td valign=top></td></tr>
<tr><td align=center valign=top>5</td>
    <td></td>
    <td valign=top>Chapter 1: Pumping Lemma and non-regular languages</td><td valign=top></td></tr>
<tr><td align=center valign=top>6</td>
    <td></td>
    <td valign=top>Chapter 1: Applications of Pumping Lemma</td><td valign=top></td></tr>
<tr><td align=center valign=top>7</td>
    <td></td>
    <td valign=top>Review and Test</td><td valign=top></td></tr>
<tr><td align=center valign=top>8</td>
    <td></td>
    <td valign=top>Chapter 2: Context-free languages, grammars and ambiguity</td><td valign=top></td></tr>
<tr><td align=center valign=top>9</td>
    <td></td>
    <td valign=top>Chapter 2: Nondeterministic Push-down Automata</td><td valign=top></td></tr>
<tr><td align=center valign=top>10</td>
    <td></td>
    <td valign=top>Chapter 2: Equivalence of CFG's and PDA's</td><td valign=top></td></tr>
<tr><td align=center valign=top>11</td>
    <td></td>
    <td valign=top>Chapter 2: Pumping Lemma and Non-context-free languages</td><td valign=top></td></tr>
<tr><td align=center valign=top>12</td>
    <td></td>
    <td valign=top>Chapter 2: Deterministic Context-free languages</td><td valign=top></td></tr>
<tr><td align=center valign=top>13</td>
    <td></td>
    <td valign=top>Review and Test</td><td valign=top></td></tr>
<tr><td align=center valign=top>14</td>
    <td></td>
    <td valign=top>Review for Final</td><td valign=top></td></tr>
</table>
-->

==== Dates to Remember ====

=== Assignments ===
==== Homework ====
== Materials ==
=== Textbook ===
{{Template:Textbook
|title=Starting Out with C++: From Control Structures Through Objects
|edition=9th
|author=Tony Gaddis
|ISBN=978-0134544847
|publisher={{link|protocol=https://|address=www.pearson.com/us/higher-education/program/Gaddis-Starting-Out-with-C-from-Control-Structures-to-Objects-Plus-My-Lab-Programming-with-Pearson-e-Text-Access-Card-Package-9th-Edition/PGM335156.html|marquee=Pearson}}
|year=2017
|Amazon=https://www.amazon.com/Starting-Control-Structures-Objects-Programming/dp/0134544846
}} ({{link|protocol=https://|address=www.pearson.com/us/higher-education/program/Gaddis-Starting-Out-with-C-from-Control-Structures-to-Objects-Plus-My-Lab-Programming-with-Pearson-e-Text-Access-Card-Package-9th-Edition/PGM335156.html|marquee=companion site}})
{{Template:Textbook
|title=Data Structures and Algorithms in C++
|edition=4th
|author=Adam Drozdek
|ISBN=978-1133608424
|publisher={{link|protocol=https://|address=www.cengage.com/c/data-structures-and-algorithms-in-c-4e-drozdek/9781133608424|marquee=Cengage Learning}}
|year=2012
|Amazon=https://www.amazon.com/Data-Structures-Algorithms-Adam-Drozdek/dp/1133608426/
}} ({{link|address=www.cengage.com/cgi-wadsworth/course_products_wp.pl?fid=M20b&product_isbn_issn=9781133613053|marquee=companion site}})

=== Resources ===
:Go to the {{link|protocol=https://|address=magichat.cs.astate.edu/d/81229e7afa/?p=/CS50X2%20Accelerated%20Programming&mode=list|marquee=online repository}}

== Course Policies ==  
See [[Department/Policies/Classroom|Department Policies]] which will be adhered to within the course.

== See Also ==
<!--
* {{link|title=Mathematical Induction|address=en.wikipedia.org/wiki/Mathematical_induction|description=Wikipedia article}}
-->

<small>[{{fullurl:{{FULLPAGENAMEE}}|action=pdfbook&format=single}} create PDF version]</small>