4.1, due oct 9

Difficult:

the word 'memoization' threw me off by a lot at the beginning. I don't quite follow bottom-up dynamic programming. Why would or could this ever be faster than recursion? also, the examples only half-help me. For instance, for the fib numbers, should you store the two you need for the next value each time?

Application:

Well, clearly, optimization is in everything. I like that we're starting to learn about it. Also, approximation making algorithms better is an interesting concept.

Comments

Post a Comment

Popular posts from this blog

8.6, due Friday 12/8

Difficult: Honestly, this whole thing is a bit fuzzy to me. I'm not quite sure how it works. I feel like I won't fully understand until I do a lab on it. Application: well, the picture of the mandrill was interesting. How sure are we, though, that this is how the FBI does fingerprints?
Read more

8.7, due Monday dec 11

Difficult: I think I need to go back and review compact support. Also, much like the last section, I don't think I'll fully understand this one until I do the HW and/or code it up. Application: I feel like every section says, 'the last approximation is good for some things, but not for this new thing'. It's just interesting.
Read more

8.1, due Nov 27 17

Difficult: The hardest part was following all of the integrals going on. The idea of fourier transforms is interesting, but I don't know how well I'll actually be able to follow it. Also, how is having a basis for only a subset of F make a suitable basis for all of the functions/signals we care about? Application: I've seen some of what DFT/FFTs can do, and it's super cool. I'm excited to see how we can apply this to audio and visual conversions!
Read more