Assignment for February 15^th

1. If you got an idea of how to fix one of your programs (hat didn’t get accepted or didn’t run last week) from the class presentations by your classmates, fix it and resubmit.

2. If you didn’t finish the minimum spanning tree problem (FRECKLES) please do!

3. Read chapter 2 about data structures. Pay particular attention to the dictionaries, priority queues and sets as well as to code examples.

4. Get Jolly Jumper at the end of the chapter coded, checked, submitted, and accepted.

5. Choose one other problem at the end of chapter 2 to solve.

6. Remember to post your solutions on Blackboard. You can e-mail me in advance of class (by noon on Wednesday) and tell me: who worked on the problem, which problem, which language, did it run on the pc? did you submit it? Was it accepted? If not, which error did you have.