Functional Problem Solving (CSC 151 2015F) : EBoards

CSC151.01 2015F, Class "The Answer": Trees


Overview

Preliminaries

Admin

Upcoming Work

Extra Credit Opportunities

Academic

Peer Support

Regular Peer Support

Upcoming Peer Support

Questions

Will you penalize me for missing class next Wednesday because the idiotic College thinks that noon buses are a good idea on a day when we have classes?

No.

Will you still teach something that day that I'm expected to know?

Yes. Do the lab on your own.

I've discovered that you can seed the random number generator. If you give it the same seed, it gives you the same sequence of numbers. Can I use that idea?

I suppose so. But you should still have something other than the randomly generated numbers that is computed based on N and guarantees 1000 different images.

Do you have a good sample proposal?

No.

How detailed should the initial technical statement be?

It can be pretty high-level. Make sure you indicate the three different techniques and how you are using them. Make sure to argue for 1000 different images using something other than "predictably random".

Lab

Helper recursion will not work well for sum. Use direct recursion, using the pattern you've seen.

number-tree-largest will need a variant of tree recursion. (You'll need to think about different base cases and different recursive cases.)

Make sure to check (number-tree-largest (leaf -3)), which should be -3.

number-tree? can be written elegantly using and and or.

Writeup: Exercise 4.