Assignment 1

Please write up solutions to the problems in the form of Haskell function definitions. Turn in a .hs file containing your function definitions that work. Put the function definitions in the same order as the problems (i.e. solution for problem 1 before problem 2 before problem 3 etc). If you do not solve a particular problem put a clear comment in the code that says that you didn't succeed. Your .hs should load cleanly into ghci and give correct answers for the problems that you solved.

In a separate word-processor document, for any problem that you did NOT solve write up your attempts -- what did you try and where did you get stuck. You may (should) have multiple attempts to describe for any given problem. By "where did you get stuck" I mean tell me about type errors (if that's as far as you got), or incorrect answers, or ...? If you succeed at all of them, turn in a

You are encouraged to work in groups of 2 or 3: make sure that everyone in the group understands each answer.

Assigned 1/21/15

Writeup is due at the beginning of class 1/26/15; .hs file to be uploaded by 11:59:59PM on 1/26/15 using the course turnin page.

Do only the following problems:

• 1 through 6, 8, 9, and 10. All except #6 and #10 should be implemented as folds (I hope that you kind of get on a roll doing these as folds). Note that I gave the answer for #5 in class today, and #6 is a simple use of #5. #10 should be a map over the result provided by #9. If there is no sensible answer for a particular case you should use undefined as the value returned by your function -- for example, if asked for the last element of an empty list.
• 12 through 16. Again do all of these as folds and note that #16 can be done as a fold after zipping the original list with (cycle [1..n]). For problems 12 and 13, use the same encoding as for problem #10 (don't use the alternate encoding of problem #11 which you are not doing).
• 18 and 19: simple applications of take and drop
• 20: a fold after zipping with [1..]