And this week is the last school week, while tmr is the last school day before the exams. I can't believe how fast my year 1 passes. And this week is surely the deadline for many assignments and also tests as well.
And for CSC165, we had a test on Monday. It isn't too hard, but just that the last question is a bit confusing. It asked us to prove the statement: if f ∈ Ω(h), then (f + g) ∈ Ω(h). The problem is it didn't state whether g is also in Ω(h) or not. What I thought was to create 3 cases: either f has a lower bound h, or it has an upper bound h, or it is not bounded. But I didn't really have much time, and I m so unsure if this is the right way to approach the question. I am still confused about the question till now. And it's too bad that I missed this morning's class, because of working too late at night yesterday. And I have no idea when or how we can get this test back. I want to know the correct answer for the question above so badly.
And for a conclusion for this course, I think that it is a really fun and interesting course. The tests are not too difficult for me, and the professor is nice and he teaches really well, and some concepts in this course has already appeared in my calculus textbook, which is good for me. The Big-Oh concept at first was a bit confusing to me, because of the statement: 6n is the same as 10n + 100, or something like that. But after a lecture or two, everything seems easy and not difficult to follow. For this course, if you want to understand the concepts, you just have to attend the lectures and read the lecture notes and slides, and that's it. This isn't a hard course, and I can say I really enjoy this course. This course makes me feel more confidence to go into computer science major, though I am still unsure which part of computer science I should be going to (maybe computer science and statistics? lol).
The only thing left for this course (and actually every courses) is the exam. I will work hard on it and get well-prepared for it, and hope that I can get a good result on it!
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment