CS211 - Assignments Spring 2014

1.   Perfect Square Problem

   Due date: Monday, Feb. 3, 2014 before lecture  

2.   Equivalent Arrays

   Due date: Monday, Feb. 3, 2014 before lecture  

3.   Perfect Square Problem - part 2 - computing the time estimate

   Due date: Wenesday, Feb. 5, 2014 before lecture   

4.   Rearrange 'em

   Due date: Monday, February 10, 2014 before lecture

5. Complete the 8 queens 2 dimensional array program with backtracking that we worked on in class.

   Due date: Thursday February 20, 2014 before lecture

6. Outline of program for Dumb Eight Queens - version 1

   Due date: Thursday February 20, 2014 before lecture  
7. Complete the 8 queens 1 dimensional array program with backtracking that we worked on in class.

   Due date: Monday February 24, 2014 before lecture 

8. Redo the 8 queens 1 dimensional array program with backtracking REMOVING ALL "GOTOs"

   Due date: Wednesay February 26, 2014 before lecture

9.   Eight numbers in a cross problem

   Due date: Monday March 10, 2014 before lecturere 

10.   Stable Marraige

   Due date: Monday March 17, 2014 before lecture  

Two guys recently won the Nobel Prize for solving the Stable Marriage probelm ... (coulda been you had you taken CS211 earlier)

11.   Understanding Arrays as Pointers

   Due date: Wednesday Mach 12, 2014 before lecture 
  

12.   "Fancy" output for the eight queens problem

   Due date: Monday March 31, 2014 before lecture

13.   Integration problem using function pointers

   Due date: Wednesday March 26, 2013 before lecture 

14.  Practice problems for simple recursion

   Due date: Monday March 31, 2014 before lecture
 

15.   The n Queens Problem

   Due date: Wednesday April 2, 2014 before lecture

16.  Fibonacci via recursion

   Due date: Wednesday April 2, 2014 before lecture

17. Redo cross and stable marriage using recursion

   Due date: Monday April 7 2014, before lecture  

18. Complete recursive version of the Towers of hanoi problem.
  Your program should prompt the user for, n, the number of rings, and then
  print the instructions to move the n rings from tower a to tower b in   the minimum number of moves.

   Due date: Wednesday April 9, 2014 before lecture 

19. Non-recursive Towers of Hanoi - must work for both odd and even number of towers

     Due date: Wednesday April 23, 2014 before lecture 

20   k bishops on an nXn chessboard - see expected output in the "handouts" section

   Due date: Monday April 28, 2014 before lecture 
p> 21. Shortest Path Problem - Part 1
   Due date: Wednesday April 30, 2014 before lecture