AI felt that this week I was really behind in the course. Usually I am able to review the course notes at the end of the week, but because I have a midterm next week not only in this course, but other courses too, I don't have a lot of time. Nevertheless, I was still able to pick up few things during the weeks lectures. For instance, I learned that when it comes to algorithms speed is an important factor. I also learned that in order to determine the more efficient algorithm we also have to consider the specs of the computer that the algorithm is being ran on. As for Big Oh's I am still finding it challenging, mainly because I still don't know how to count the amount of steps in the program, and how many steps it takes for the worst case to occur. The one thing I picked up from the lecture was that when proving Big Oh's we have to prove it using the lower, and upper bound definition, which I also still don't understand. As a result of not reviewing, and going over the course notes I found the tutorial very confusing. I made few careless mistakes on the quiz, but after thinking about it I realized my mistakes.
After this upcoming week hopefully I will be able to review, and understand this weeks content. This upcoming week for CSC108 will also be very helpful, because we are also going over counting the amount steps for simple algorithms such as linear, and binary search.
After this upcoming week hopefully I will be able to review, and understand this weeks content. This upcoming week for CSC108 will also be very helpful, because we are also going over counting the amount steps for simple algorithms such as linear, and binary search.