Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
courses:cs101-201954:calendar [2019/02/13 09:58]
sellis
courses:cs101-201954:calendar [2019/04/30 09:08] (current)
sellis
Line 117: Line 117:
     <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-02-12_lec.txt">​Code from class</​a>​     <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-02-12_lec.txt">​Code from class</​a>​
     </​center>​     </​center>​
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+ 
 +  ​<td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​14th February</​center>​     <​center>​14th February</​center>​
     <hr>     <hr>
 +    Review of recursion. Introduction to more complex conditions with <​code>​cond</​code>​.
 +    <hr>
 +    <​center>​
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-02-14_lec.txt">​Code from class</​a>​
 +    </​center>​
 +    ​
   <td width=30% valign=top bgcolor=gray cellpadding="​8">​   <td width=30% valign=top bgcolor=gray cellpadding="​8">​
     <​center>​15th February</​center>​     <​center>​15th February</​center>​
Line 132: Line 139:
   </​b></​font>​   </​b></​font>​
   </td>   </td>
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​19th February</​center>​     <​center>​19th February</​center>​
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+    Adventures in logic: more complex conditional expressions with <​b>​boolean operators</​b>​. Introducing <​code>​and</​code>,​ <​code>​or</​code>​ and <​code>​not</​code>​. 
 +    <​hr>​ 
 +    <​center><​b>​Reading</​b></​center>​ 
 +    Chapter 13.2. 
 +    <​hr>​ 
 +    <​center><​b>​Homework</​b></​center>​ 
 +    Review the in-class functions to make sure you fully understand the boolean operators. 
 +    <​hr>​ 
 +    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-02-19_lec.txt">​Code from class</​a>​ 
 +    </​center>​ 
 +     
 +     
 +  ​<td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​
     <​center>​21st February</​center>​     <​center>​21st February</​center>​
     <hr>     <hr>
 +    Continuing with booleans. Removing <​code>​if</​code>​ or <​code>​cond</​code>​ from predicates. Simplifying expressions.
 +    <hr>
 +    <​center>​
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-02-21_lec.txt">​Code from class</​a>​
 +    </​center>​
 +    ​
   <td width=30% valign=top bgcolor=gray cellpadding="​8">​   <td width=30% valign=top bgcolor=gray cellpadding="​8">​
     <​center>​22nd February</​center>​     <​center>​22nd February</​center>​
Line 150: Line 176:
   </​b></​font>​   </​b></​font>​
   </td>   </td>
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​
     <​center>​26th February</​center>​     <​center>​26th February</​center>​
 +    Beginning <​b>​list recursion</​b>​. Accessing the contents of a list with <​code>​first</​code>​ and <​code>​rest</​code>​. Stitching
 +    lists together with <​code>​cons</​code>​. Revisiting <​code>​null?</​code>​.
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+    <​center><​b>​Reading</​b></​center>​ 
 +    Chapter 16.2. 
 +    <​hr>​ 
 +    <​b><​center>​Homework</​center></​b>​ 
 +    Solve In-Class Problems 16.2.3 and 16.2.4. 
 +    <​hr> ​   <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-02-26_lec.txt">​Code from class</​a>​ 
 +    </​center>​ 
 +  ​<td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​28th February</​center>​     <​center>​28th February</​center>​
 +    More list recursion. Using recursion to find a element of a list. Predicates with list recursion. Using comparison predicates (e.g. <​code><​=</​code>​ and <​code>​=</​code>​) as inputs to a function.
 +    <​hr> ​   <​center>​
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-02-28_lec.txt">​Code from class</​a>​
 +    </​center>​
     <hr>     <hr>
   <td width=30% valign=top bgcolor=gray cellpadding="​8">​   <td width=30% valign=top bgcolor=gray cellpadding="​8">​
Line 168: Line 208:
   </​b></​font>​   </​b></​font>​
   </td>   </td>
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​5th March</​center>​     <​center>​5th March</​center>​
     <hr>     <hr>
 +    More on list recursion. Concatenating lists. Merging lists. Merging lists with different numbers of elements.
 +    <hr>
 +    <​center>​
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-03-05_lec.txt">​Code from class</​a>​
 +    </​center>​
   <td width=30% valign=top bgcolor="​ffcc66"​ cellpadding="​8">​   <td width=30% valign=top bgcolor="​ffcc66"​ cellpadding="​8">​
     <​center>​7th March     <​center>​7th March
Line 209: Line 254:
  <​b>​Individual Reviews.</​b>​  <​b>​Individual Reviews.</​b>​
  </​center>​  </​center>​
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​28th March</​center>​     <​center>​28th March</​center>​
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+    Return to recursion. <​b>​Tail recursion</​b>​. Using <​b>​accumulators</​b>​ to store partial 
 +    results of computations. 
 +    <​hr>​ 
 +    <​center><​b>​Reading</​b></​center>​ 
 +    Chapters 14.2, 14.3. 
 +    <​hr>​ 
 +    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-03-28_lec.txt">​Code from class</​a>​ 
 +    </​center>​ 
 +  ​<td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​
     <​center>​29th March</​center>​     <​center>​29th March</​center>​
- <hr>+    ​<hr
 +    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-03-29_lec.txt">​Code from class</​a>​ 
 +    </center>
 </tr> </tr>
  
Line 224: Line 281:
   </​b></​font>​   </​b></​font>​
   </td>   </td>
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​2nd April</​center>​     <​center>​2nd April</​center>​
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+    Functions as inputs to another function. Calling one function we have written from another function we have written. <​b>​Wrapper functions.</​b>​ 
 +    <​hr>​ 
 +    <​center><​b>​Reading</​b></​center>​ 
 +    Sections 14.4, 14.5. 
 +    <​hr>​ 
 +    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-02_lec.txt">​Code from class</​a>​ 
 +    </​center>​ 
 +     
 +  ​<td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​
     <​center>​4th April</​center>​     <​center>​4th April</​center>​
     <hr>     <hr>
 +    Review of list recursion, wrapper functions and accumulators. <​b>​Mapping functions.</​b>​ Calling functions from other functions.
 +        <hr>
 +    <​center>​
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-04_lec.txt">​Code from class</​a>​
 +    </​center>​
   <td width=30% valign=top bgcolor=gray cellpadding="​8">​   <td width=30% valign=top bgcolor=gray cellpadding="​8">​
     <​center>​5th April</​center>​     <​center>​5th April</​center>​
Line 242: Line 313:
   </​b></​font>​   </​b></​font>​
   </td>   </td>
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​
     <​center>​9th April</​center>​     <​center>​9th April</​center>​
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+    <​b>​Local environments</​b>​ and <​b>​local variables</​b>​ using <​code>​let</​code>​. Random numbers and how to store them. 
 +        <​hr>​ 
 +    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-09_lec.txt">​Code from class</​a>​ 
 +    </​center>​ 
 +  ​<td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​11th April</​center>​     <​center>​11th April</​center>​
     <hr>     <hr>
 +    Local environments continued. Sequential evaluation of local variables with <​code>​let*</​code>​. Using <​code>​letrec</​code>​ to
 +    write local recursive functions.
 +    <hr>
 +    <​center>​
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-11_lec.txt">​Code from class</​a>​
 +    </​center>​
   <td width=30% valign=top bgcolor=gray cellpadding="​8">​   <td width=30% valign=top bgcolor=gray cellpadding="​8">​
     <​center>​12th April</​center>​     <​center>​12th April</​center>​
Line 260: Line 342:
   </​b></​font>​   </​b></​font>​
   </td>   </td>
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​16th April</​center>​     <​center>​16th April</​center>​
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+    A conditional with only a <​i>​true</​i>​ case: <​code>​when</​code>​. Beginning <​b>​destructive programming</​b>:​ changing values of variables with <​code>​set!</​code>​. Iteration using <​code>​while</​code>​ and <​code>​dotimes</​code>​ 
 +    <​hr>​ 
 +    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-16_lec.txt">​Code from class</​a>​ 
 +  ​<td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​
     <​center>​18th April</​center>​     <​center>​18th April</​center>​
     <hr>     <hr>
 +    Changing recursive functions to iteration-based functions.
 +    <hr>
 +    <​center>​
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-18_lec.txt">​Code from class</​a>​
   <td width=30% valign=top bgcolor=gray cellpadding="​8">​   <td width=30% valign=top bgcolor=gray cellpadding="​8">​
     <​center>​19th April</​center>​     <​center>​19th April</​center>​
Line 278: Line 368:
   </​b></​font>​   </​b></​font>​
   </td>   </td>
-  <td width=30% valign=top bgcolor=gray cellpadding="​8">​+  <td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​
     <​center>​23rd April</​center>​     <​center>​23rd April</​center>​
 +    A bit more on iteration. Looking at the <​b>​vector</​b>​. Syntax of the vector and vector creation. Accessing and changing contents.
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​+    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-23_lec.txt">​Code from class</​a>​ 
 +  ​<td width=30% valign=top bgcolor="​aaffcc" ​cellpadding="​8">​
     <​center>​25th April</​center>​     <​center>​25th April</​center>​
     <hr>     <hr>
-  ​<td width=30% valign=top bgcolor=gray cellpadding="​8">​ +    Review of Assignment 9: considering nested loops and changing values with <​code>​set!</​code>​. Using vectors to speed up programs. 
-    <​center>​16th April</​center>​ +    <​hr>​ 
- <hr>+    <​center><​b>​Reading</​b></​center>​ 
 +    Chapter 19.0--19.1. 
 +  ​<td width=30% valign=top bgcolor="​aaccff" ​cellpadding="​8">​ 
 +    <​center>​26th April</​center>​ 
 +<hr
 +    Storing information tidily using <​b>​data structures</​b>​. <​code>​make-struct</​code>​ and other associated functions. 
 +        <​hr>​ 
 +    <​center>​ 
 +    <a href="​https://​www.cs.vassar.edu/​~cs101/​ell-spr-2019/​lecs/​2019-04-26_lec.txt">​Code from class</a>
 </tr> </tr>