Difficult:
The last pages on the different types of continuous distributions was challenging to grasp. I will have to refer back to this chapter to see the relationship between the many variables that were introduced.
Insightful:
It is interesting how the formulas we derived for discrete probability carry over to continuous probability. I like the idea that choosing one value from a countable set of things is essentially 0 since there are so many other choices that could happen.
Tuesday, 30 October 2018
Sunday, 28 October 2018
Section 5.5: Discrete Distributions
Difficult:
The distributions were pretty straight forward. There wasn't anything behind the theory of the Poisson Distribution. I think it is really cool but how did he derive it?
Insightful:
I think it is cool that with a probability high enough you can consider certain values essentially not possible. Or on the other hand, if it is low enough, certain outcomes impossible to achieve
The distributions were pretty straight forward. There wasn't anything behind the theory of the Poisson Distribution. I think it is really cool but how did he derive it?
Insightful:
I think it is cool that with a probability high enough you can consider certain values essentially not possible. Or on the other hand, if it is low enough, certain outcomes impossible to achieve
Thursday, 25 October 2018
Section 5.4: Discrete Random Variables
Difficult:
This was not an easy read. I am not used to this notation for a random variable. What I understood is that it is a function that counts each time a desired outcome happens. The law of the Unconscious Statistician went right over my head. The set up for it was really difficult to follow.
Insightful.
I am not sure if I understood the problem for flipping a coin but I thought it was really cool that we a convergent sum we can assume that the coin will flip tails twice before it flips heads.
This was not an easy read. I am not used to this notation for a random variable. What I understood is that it is a function that counts each time a desired outcome happens. The law of the Unconscious Statistician went right over my head. The set up for it was really difficult to follow.
Insightful.
I am not sure if I understood the problem for flipping a coin but I thought it was really cool that we a convergent sum we can assume that the coin will flip tails twice before it flips heads.
Wednesday, 24 October 2018
Section 5.3: Independence, Paradoxes, and Pitfalls
Difficult:
I am not paranoid to fall for the prosecutor's fallacy. I had never worried about this in the stat class I took, mostly because we never talked about it. Everything was pretty straightforward. I know I will need some practice knowing whether a group of events are independent.
Insightful:
I like the plane example where the planes that survived did not need more armor where they had bullet holes since they survived with them. The armor should be placed where there are not that many bullet holes since that is probably the reason why others did not survive. It is also interesting that most of Harvard students got these types of questions wrong.
I am not paranoid to fall for the prosecutor's fallacy. I had never worried about this in the stat class I took, mostly because we never talked about it. Everything was pretty straightforward. I know I will need some practice knowing whether a group of events are independent.
Insightful:
I like the plane example where the planes that survived did not need more armor where they had bullet holes since they survived with them. The armor should be placed where there are not that many bullet holes since that is probably the reason why others did not survive. It is also interesting that most of Harvard students got these types of questions wrong.
Sunday, 21 October 2018
Section 5.2: Conditional Probability and Bayes' Rule
Difficult:
For the chain rule example, I don't see why it would be an intersection between two events and not the union of them. I am having a hard time with the notations of events. Maybe that's where my learning gap is.
Interesting:
We talked in class about how there is no intuitive way to build strategies for solving these problems. I am wondering if this is worth putting extra effort to get good at. I took a stats class and learned most of these methods but I forgot them since. Is this actually practical in the work place or is it a type of skill that will impress your friends? (I am very impressed when people can do these problems)
For the chain rule example, I don't see why it would be an intersection between two events and not the union of them. I am having a hard time with the notations of events. Maybe that's where my learning gap is.
Interesting:
We talked in class about how there is no intuitive way to build strategies for solving these problems. I am wondering if this is worth putting extra effort to get good at. I took a stats class and learned most of these methods but I forgot them since. Is this actually practical in the work place or is it a type of skill that will impress your friends? (I am very impressed when people can do these problems)
Thursday, 18 October 2018
Section 5.1: Probability Theory
Difficult:
I am sure I have seen these types of problems before because I took Stats 201 but the new notation is making it difficult to recall. Other than that it is pretty straight forward.
Insightful:
It is cool that Sterling's Approximation was used to figure out the probability of two people having the same birthday in a room with 'k' people. It says that 365! makes Sterling's Approximation accurate. In Chapter 2 we learned 22026 was a good amount to have a good approximation. So because 22026 < 365! we know it will be accurate?
I am sure I have seen these types of problems before because I took Stats 201 but the new notation is making it difficult to recall. Other than that it is pretty straight forward.
Insightful:
It is cool that Sterling's Approximation was used to figure out the probability of two people having the same birthday in a room with 'k' people. It says that 365! makes Sterling's Approximation accurate. In Chapter 2 we learned 22026 was a good amount to have a good approximation. So because 22026 < 365! we know it will be accurate?
Sunday, 14 October 2018
Section 4.5: Hard Problems
Difficult:
I am having a hard time keeping NP, NP-complete, and Np-hard straight. I am going to need more help than the diagram they have in the book.
Interesting:
It's interesting how what seems like simple problems (simple because as we are doing them we don't over think it and just take action) can have such complicated optimal solutions. Since the complexity increases by a lot every time you add one more option, I would just divide up the work (for example more than one salesman) to the point that it is feasible.
I am having a hard time keeping NP, NP-complete, and Np-hard straight. I am going to need more help than the diagram they have in the book.
Interesting:
It's interesting how what seems like simple problems (simple because as we are doing them we don't over think it and just take action) can have such complicated optimal solutions. Since the complexity increases by a lot every time you add one more option, I would just divide up the work (for example more than one salesman) to the point that it is feasible.
Thursday, 11 October 2018
Section 4.3: Minimum Spanning Trees
Difficult:
I am not versed in algorithm talk yet. I read one paragraph out-loud and considered myself a crazy person. A visual representation would be nice but I think the best way to understand it is by coding the algorithm.
Insightful:
I liked the application of networks and finding the path with the least cost. I am going to start thinking of ways to apply this to find the path of least resistance in life planning (most efficient)
I am not versed in algorithm talk yet. I read one paragraph out-loud and considered myself a crazy person. A visual representation would be nice but I think the best way to understand it is by coding the algorithm.
Insightful:
I liked the application of networks and finding the path with the least cost. I am going to start thinking of ways to apply this to find the path of least resistance in life planning (most efficient)
Wednesday, 10 October 2018
Section 4.2: Graph Search Algorithms
Insightful:
That comic was the insightful thought. What if humans thought as we make computer think? Can we make life more efficient? Would be want to? I am glad we have reason.
Difficult:
My brain is fried from today's homework. But out of the many things I did not understand from this chapter, I would pose the question why would BST give you the shortest path first if it could have been the longest?
That comic was the insightful thought. What if humans thought as we make computer think? Can we make life more efficient? Would be want to? I am glad we have reason.
Difficult:
My brain is fried from today's homework. But out of the many things I did not understand from this chapter, I would pose the question why would BST give you the shortest path first if it could have been the longest?
Sunday, 7 October 2018
Section 4.1: Dynamic Programming
Difficult:
I don't think I understood either section very well. Memoization conceptually made sense but I don't know how to program it. I think Bottom-up makes sense, but I get lost in the details or notation. The coin example would have been simple enough but I just couldn't see how the arguments inside the min function made sense.
Insightful:
I am excited to learn these methods and to find application for them in my concentration. It seems very practical. I think it is cool that we are getting into optimization.
I don't think I understood either section very well. Memoization conceptually made sense but I don't know how to program it. I think Bottom-up makes sense, but I get lost in the details or notation. The coin example would have been simple enough but I just couldn't see how the arguments inside the min function made sense.
Insightful:
I am excited to learn these methods and to find application for them in my concentration. It seems very practical. I think it is cool that we are getting into optimization.
Thursday, 4 October 2018
3.4 Priority Queues and Heaps
Difficult:
I am having a hard time differentiating from all the different complexities for all the different methods. Probably because there is a lot of text between the explanations. It would be useful to see a table with: method, complexity for insterting, complexity for removing, etc.
Interesting:
If I understood correctly, a binary heap is an array sorted as if it was a tree. The kth position has children in the 2k+1 and 2k+2 positions. The priority heap is the tree form of this. There are the terms that are used interchangeably but should not be. This is the reason why I can see why they should not be used interchangeably but the book implies that there are many more.
I am having a hard time differentiating from all the different complexities for all the different methods. Probably because there is a lot of text between the explanations. It would be useful to see a table with: method, complexity for insterting, complexity for removing, etc.
Interesting:
If I understood correctly, a binary heap is an array sorted as if it was a tree. The kth position has children in the 2k+1 and 2k+2 positions. The priority heap is the tree form of this. There are the terms that are used interchangeably but should not be. This is the reason why I can see why they should not be used interchangeably but the book implies that there are many more.
Wednesday, 3 October 2018
Section 3.3: Search Trees
Difficult:
I feel like the book is explaning less and less about Complexity. It could be because they are assuming we are getting the hang of it. But in reality I feel like I am losing the ability to calculate it. For example, are we still working with FLOPs?
AVL Trees went way over my head. I need to understand the unbalance numbers better (like -2 and 2)
Interesting:
I think binary trees are really cool. At first the way the "keys" are indexed might seem arbitrary but there is some logic at least for the children nodes.
I feel like the book is explaning less and less about Complexity. It could be because they are assuming we are getting the hang of it. But in reality I feel like I am losing the ability to calculate it. For example, are we still working with FLOPs?
AVL Trees went way over my head. I need to understand the unbalance numbers better (like -2 and 2)
Interesting:
I think binary trees are really cool. At first the way the "keys" are indexed might seem arbitrary but there is some logic at least for the children nodes.
Subscribe to:
Posts (Atom)