CSC 165 SLOG #7 (Week 8)

This week was quiet tough for me as I had to complete both assignments from CSC 108 and CSC 165. However, as I already started these last week, I was able to manage my time to study for CSC 165 term test as well. Floor function limit was a bit confusing for assignment 2 in the beginning, however, I managed to learn and was able to understand the problem clearly. One thing I am sure of is that every course at UofT has gotten more difficult compared to the beginning of the term. However, I will keep trying my best to achieve marks that I desire.

This week, I learnt about the worst case and big-oh of the case. Understanding the proof of
Wis ∈ O(n²) was the hardest proof I have seen in this course. Bounding a sort part was quiet easy to understand compared to the proof. The general proof structure was easy to understand as well since I already had much experience gained from the assignments. Then, during Wednesday's lecture, I learnt the proof of Wis ∈ Ω(n²). It was easier than the last lecture as I already previewed the lecture slide to better understand the lecture. 

Big oh can be used when the time taken for the algorithm to execute command depends on the amount of information the programming it has to read. If there is too much information, the programming will take longer time to execute. O(n²) is such that its performance depends on square of n where n represents the amount of information input we are putting through the algorithm.

What I am worried about is not assignment 2, but term-test that I have next week. Although I did practice and review the lecture slides, proving Wis ∈ O(n²) and Wis ∈ Ω(n²) are still challenges for me. Other than that, I am ready to write my test next week.