Skip to main content

3.2 due October 1

The trickiest thing for me in this section is keeping the terminology straight. I sometimes get paths and walks mixed up, which matters in proofs about cycles.

I find the various names for trees interesting. It is easy to see where many of them came from, but the way they are mixed and matched can be unexpected. The definition of leaf node right after parent and child nodes makes me laugh because it makes me imagine childless people as leaves.

Comments

Post a Comment

Popular posts from this blog

7.2 due November 19

The thing I didn't understand about this section is why we need to use a distribution Q instead of just sampling uniformly (which I guess is a distribution...) when we are trying to do rejection sampling. I think it is because it speeds things up as it will have fewer rejections than a rectangle would. This section seems like we are learning more of what we just learned. I understand most of it, but I'm not sure I would recognize when I should use any of the techniques in this section.
Post a Comment
Read more

4.2 due October 10

The hardest thing for me in this section is following all the details of actually implementing a search. The general "go here, then here, then here" makes sense, but keeping track of all the stacks and dictionaries and lists is what takes me the most time. I liked the cartoon example of what a depth first search would look like in real life. It both made me laugh and made me think.
Post a Comment
Read more