david.white@denison.edu cs109fall2014

Complete each of the following exercises by the date listed for that block of exercises. Do not look for solutions online. Assume homework is due at the beginning of class unless explicitly stated otherwise.

Finished Problems: basketball  sumUp H   compound  power  factorial  Fibonacci  sumTriplets  annualInterestAmount H   compoundInterestAmount  even  between  justone  sumprod  max3  yearsUntilDoubled  incrementTillEqual 

Optional Problem: annualInterestYears  searchBool  stars 

For Tuesday, October 21: read 6.1 and 6.2, do 6.1.1

For Wednesday, October 22, read 6.4 and 6.7 and do: piglatin  vowels  nospaces 

For Friday, October 24, read 6.3 and 6.5 and do: sentences  findall 

For Friday, October 31, read 8.1 and 8.2 and do: 6.3.1 and 6.3.3. Enter your answers into coding bat in the following two places: fun631 , fun633 

For Tuesday, November 4, read 8.3 and do: sumOdds , sumOddIndices , countOdds 

For Wednesday, November 5, do: longest , intersect , differ . By now you should have read 8.1-8.4.

For Friday, November 7, finish the lab and read Section 8.6 and Project 8.3

For Monday, November 10, read 8.5 and do: median , squares_better , swap_better , remove_better 

For Tuesday, November 11, read 11.1 on binary search and do: count_values , count_duplicates 

For Wednesday, November 12, read 11.2 on sorting and do: least_likely H  

For Friday, November 14, read 11.3, finish the lab and make your exam flashcard. Review day.

Monday, November 17 is Exam 3.

For Tuesday, November 18, read Section 12.1 and Project 12.1 in section 12.5. Do 12.1.6

For Wednesday, November 19, read 12.2 and do 12.1.3 and 12.1.4(b).

For Friday, November 21, read handout on game theory and do 12.1.8. Here are some additional references on game theory:

Handed out in class: http://msl1.mit.edu/ESD10/block4/4.4_-_Game_Theory.pdf

Handed out in class (but only the first 10 pages): http://www.cdam.lse.ac.uk/Reports/Files/cdam-2001-09.pdf

A mathematical approach (I recommend reading pages 1-13): http://econweb.ucsd.edu/~jsobel/200Cs09/Kartik_Notes.pdf

An approach from economics: http://web.stanford.edu/class/msande275/handouts/Win00-01/gametheory.pdf

Slides (similar to Friday's lecture): http://www.eurecom.fr/~loiseau/GameTheory/slides/Lecture1.pdf

More slides (with great examples, but we won't have time to cover them all): http://www.cs.umd.edu/~nau/cmsc421/game-theory.pdf

Optional (some have bugs): sieve , search , recPalindrome 

For Tuesday, December 2 read 12.1 and 12.2. There will be a quiz on 2D lists.

For Wednesday, December 3 read 12.2 and 12.3 and do (recursively): sum , selection_sort_better . You MUST solve the first recursively to get credit.

For Friday, December 5 read 12.3 and 12.4 and do (recursively): minList , recFactorial , countUpper 

For Monday, December 8 read the recursive part of 11.1 (page 517-519), read 11.4, and do (recursively): my_len , recPower , recSearch , RecFibonacci 

For Tuesday, December 9 make your note-card

Wednesday, December 10 is the exam
Authoring docs

Copyright Nick Parlante 2017 - privacy