Week 7

~~~~~~WEEK 7~~~~~~

Today’s outline:

•  Proof by cases
•  Review of proofs
•  Algorithms

We started this class off by learning about proof by cases. I learned that we have to split our argument into different cases and prove the conclusion for each case. As always, a funny slide to lighten the mood:

We were then given a question involving constant ‘n’. We found the possible cases to prove the statement true and we showed its proof. I learned the proof after reading it a second time because it was all too much for one class. We did more examples and I got a better understanding of what we were doing. We then went onto learning about uniqueness. The concept of uniqueness was easy and simple. We learned about introduction and elimination which were easier than expected.

We then started learning about algorithms. We used the website http://www.sorting-algorithms.com/ to get a demo on algorithms. We observed that merge is faster than bubble and with larger input size, the advantage of merge over bubble becomes larger. When the professor was talking about running time I thought it was the time it took for the operation to finish, but it turned out it meant the steps that were taken by the algorithm. I also learned that the running time is independent of hardware on which we run the algorithm, it depends on the algorithm itself. After algorithms we learned about asymptotic notations which I did not understand so I was left confused until the end of the class. I will need to study this because we will be studying more about asymptotic notations for our next class.

I understood the linear search slides because I have used python visualizer in CSC108 which counts the number of steps taken for the code.

This week’s tutorial was a bit complicated but I managed to understand it by asking the TA questions and participating in class. I did the quiz well and manage to prove the statement. I received my marks from the past 2 weeks which were both 2/2.

Assignment 2 is out and I should get to it because I have a lot of due dates in that time. Must use my time efficiently.