week 7

This i believe was our last week working on introduction of proofs. We covered proof by cases and reviewed some proofs. Towards the end of the lecture we started on algorithms.

At the beginning of the lecture Mr. Zhang discussed the proof of "if you have a problem in your life, then don't worry"  this was used to introduce cases. the idea was if you have a problem in your life, can you do something about it? case 1 was yes and this proved not to worry about it. case 2 was no and this also proved not to worry about it. The way this was taught was quite funny and I really like the humor that is added into these lectures, it makes it much easier to learn for three hours in a row. 

This then lead to the idea of what makes up a valid proof, which was the union of the cases covering all possibilities. We also went over proofs as a whole and discussed negation introduction and also elimination. I found that  Reviewing these concepts made it easier to tackle assignments and problems in the future.

In this lecture we also began to discuss algorithms. We began by comparing bubble sort and merge sort. This was my first time seeing programs like these and I thought this introduction was good. I learned more about computer programs in general. Like for example running time. I learned that this does not mean the actual amount of time a program takes to run, it is the number of steps taken by the algorithm.

week 6

This week we mostly just reviewed more about proofs. The tutorial this week was cancelled.

We were introduced to the topic of floors and ceilings and learned about how these worked in proofs.We also went over the idea of proving things false. To prove somethings to be false, you can disprove them and to do this you can prove the negation. This week epsilon and delta were also introduced to us and were incorporated into some of our proofs. This week I was also told that if we can't solve a proof even if we write what lines we are able to write without the proof we might still be given some marks for the question which is great to know.
Finally we also discussed a bit about a backwards search. This is starting with what you wanted to prove and working backwards to what was originally given,

week 5

Midterm week! This week was the week we did our first midterm. Although I feel I did not do as well as I would have hoped, I don't think I failed or anything so I am pretty happy about  that!

In tutorial this week we went over th previous quiz which I found to be really helpful, and we also went over proof structures. I am really happy about this since the proof structures were something I didn't really pick up on all that well in class. So I am greatful that these have been made more clear and I now have some examples to look back on in the future when I am doing other work and may need a solid example.

week 4

This week I was working a lot on the first assignment for the course. So far I am pretty confident with the work there is only one question that I am struggling with so I am hoping to make it to office hours this week for help on it. and to make the concepts more clear.
This week we learned about transitivity and bi implifications. Niether of these concepts I found particularly confident as I think they fit well into what we have learned so far. However we also began to introduce proofs this week which I am a bit nervous about as this is not my strongest subject. However I hope with effort the concept will come a little more easily to me.
Finally there is our first midterm next week, which will also be my first midterm in my university career so needless to say I am a bit nervous. I believe I should do alright since I have been going over the concepts discussed in class, and i seem to understand most things, so despite a bit of nervousness I think it should go over okay :)