This week we did not learn anything that is too technical, but we were introduced to Church and Turing's hypothesis that there exists problems that algorithms cannot solve. It was more of an intuitive and explanatory lecture than a technical one, I I took pleasure in learning it.
One problem we focused on this week is the halting problem, which is to determine whether a computer program will eventually stop running, or continues to run forever. It is quiet interesting to study this, as we can understand the limitations of programming.
Despite the relative easiness of the lecture, this week is actually very intense with many projects and assignments due. I am rather worried about my exams, as I have 5 exams in 3 days and it is unlikely that I will have enough time to study.
As this course approaches is end, I begin to miss the good times I had with csc165. It was a wonderful experience where I significantly improved my mathematical and reasoning skills. I would like to thank professor Danny and the TA in this course for this wonderful experience.
Saturday, November 29, 2014
week 10
In this week we did a detailed studies of Big Ohmega and Big Theta. Their concepts are very similar to that of Big Oh, so I was able to understand this lecture very well.
We also did some more work regarding how to prove a function is not in Big Oh or Big Ohmega of a function. This week we talked about this in more detail compared to last week, but overall this concept is not difficult and I was able to comprehend it well.
The difficult part of this week lies about how to prove general statements about two functions. I find it to be very confusing and in comprehensive. Like when the professor does it I can follow it and understand it, but when I am left on my own to do a prove it becomes extremely difficult.
As the course approaches its end, I become increasingly anxious about the final exam. I feel that this course will have a challenging exam due to the high average in the midterms and that worries me.
I have also began trying A3, which turned out to be extremely hard. I am very worried about it. I guess I will discuss with my partner and other friends in the class to get some ideas about A3.
Hope things go well!
We also did some more work regarding how to prove a function is not in Big Oh or Big Ohmega of a function. This week we talked about this in more detail compared to last week, but overall this concept is not difficult and I was able to comprehend it well.
The difficult part of this week lies about how to prove general statements about two functions. I find it to be very confusing and in comprehensive. Like when the professor does it I can follow it and understand it, but when I am left on my own to do a prove it becomes extremely difficult.
As the course approaches its end, I become increasingly anxious about the final exam. I feel that this course will have a challenging exam due to the high average in the midterms and that worries me.
I have also began trying A3, which turned out to be extremely hard. I am very worried about it. I guess I will discuss with my partner and other friends in the class to get some ideas about A3.
Hope things go well!
Week 9
This week we extended our knowledge of Big Oh and begin to test if certain functions falls within big Oh. This week's lecture is so much more interesting and comprehensive compared to last week. Some of the examples we did includes testing if 3n^2+n+2 is in Big Oh(n^2) or in Big Ohmega(n^2).
One challenging problem with this week is the test to see if a function is in the Big Oh of another function. The in class example given was to test if 7n^6 - 5n^4+2n^3 is in Big Oh(6n^8-4n^5+n^2). The rather complicated looking question actually had rather clear and logical proof, which I was able to fully understand.
In this week, we also did some work to prove that a function is not in Big Oh of n^2 or another function. This proof is much more difficult compared to proving a function is in Big Oh of n^2, which I believe I still need more practices to excel.
Overall, the learning experience this week is quiet excellent. Most of my misunderstanding about Big Oh is resolved and I was able to understand its implications and proves. I feel very satisfied!
One challenging problem with this week is the test to see if a function is in the Big Oh of another function. The in class example given was to test if 7n^6 - 5n^4+2n^3 is in Big Oh(6n^8-4n^5+n^2). The rather complicated looking question actually had rather clear and logical proof, which I was able to fully understand.
In this week, we also did some work to prove that a function is not in Big Oh of n^2 or another function. This proof is much more difficult compared to proving a function is in Big Oh of n^2, which I believe I still need more practices to excel.
Overall, the learning experience this week is quiet excellent. Most of my misunderstanding about Big Oh is resolved and I was able to understand its implications and proves. I feel very satisfied!
Friday, November 28, 2014
week 8
week 8
Week 8 of the course was very interesting but confusing to me. For the first time I was introduced to the concept of Big Oh of n^2, which measures the upper bound of the running time of a function. We also learned how to prove a function is in Big Oh of n^2, by finding the point that the function grows slower than a constant times n^2.
To be perfectly honest, I really don't understand the point behind this. The whole concept of whether a function grows faster or slower than the bound means very little to me. Perhaps I am still too young and inexperienced in the field of computer science.
Hopefully next week I will understand big Oh a little big better. I will be speaking with the professor to see if he can offer me an explanation.
Let's hope things gets better.
Week 8 of the course was very interesting but confusing to me. For the first time I was introduced to the concept of Big Oh of n^2, which measures the upper bound of the running time of a function. We also learned how to prove a function is in Big Oh of n^2, by finding the point that the function grows slower than a constant times n^2.
To be perfectly honest, I really don't understand the point behind this. The whole concept of whether a function grows faster or slower than the bound means very little to me. Perhaps I am still too young and inexperienced in the field of computer science.
Hopefully next week I will understand big Oh a little big better. I will be speaking with the professor to see if he can offer me an explanation.
Let's hope things gets better.
Subscribe to:
Posts (Atom)