Jalen Morgan ACME blog

I read the section. The section was pretty straightforward. There were a lot of definitions and theorems. I think the thing that would most help me with this section is if we went over the intuitive idea behind some of these definitions and theorems. Help on the homework is always nice too.

I read the section. I found Bayes' rule to be pretty difficult to understand as well as the whole concept of the prosecutor's fallacy. I thought the example of the world war two ships was an interesting and intuitively sound example that helped me understand the fallacy in thinking this way. These past three sections seem to be connected well and build off each other in a smooth way.

I read the section. I think it's interesting how much detail the section goes into making probability so formal. There seems to be a lot of vocabulary associated with that. This section seems pretty easy because a lot of it is similar to what we've done before, with finding the number of possibilities of a situation. For example, finding the number of possible full houses is something we've learned to do. Now we just have to find the number of possible hands and divide the former by the latter.

I read the section. I thought it was super interesting. This is a topic I spent a lot of time learning about on my own during high school. There's a lot of problems that are classified as NP. The first problem I learned about was the Knapsack problem. The travelling salesman problem is also a common one I've learned about. I think it's nice to be learning about the formal process of trying to prove things about these equations.

I read the section and found the introduction very entertaining. This is also something that was introduced by how it can be useful which I think is nice if we're studying applied mathematics. What I thought was interesting about this chapter is that it's something different than all the other math we're doing. This has a lot to do with letters which is a new twist on math. The part where the graphs showed up, showing different representations of binary codes, I got a little lost.

3.4 Priority Queues and Heaps This is something I haven't learned about yet, and it was very interesting. I think heaps can prove to be useful, though I'm not quite sure where I'll find a problem that will need a heap format. It doesn't make much sense to me why a heap would be preferable over just sorting a list. I wish the section had the proofs for the two propositions about the process of adding and removing nodes from a heap, but they were left as exercises.

I read the section about Binary Search Trees and AVL trees. This section came relatively easily to me, and everything made a lot of sense. The definitions were straightforward, and it was easy to understand how the Binary search tree can fit into complexity O(log(n)) if it's balanced. The most difficult part of this section for me is understanding how the AVL algorithm works. It's difficult for me to visualize and understand how to do it.