Week 12: Nov 24 - 28th, 2014

Working on the assignment is really good practice and studying for the final exam. I couldn't solve last questions, which is a halt related question. Looking and revewing lecture slides were not helpful for myself to understand halt concept. I'm asking my friend, going to office hour, and search Google for the help. I had trouble time to understand countability, but I'm glad that it is not on the final. 

Week 10: Nov 10 - 14th, 2014

Big-Oh and Big-Omega proofs are now somewhat manageable to solve. I still have some questions that need extra time to think about it, such as limit related problems. Computability is totally different concept than I thought. 'HALT' was really hard to understand. I was expecting to learn about it during tutorial, but it was all about big-Oh proofs, even tutorial questions and quiz. 

I know its terminology and understand how they did it in lecture slides, but I still can't do it on my own when there is a question related to halt, which means that I haven't fully understand the concept. 

Week 9: Nov 3 - 7, 2014

This week, I learned how to solve and manage harder big-Oh questions. Now, I'm used to finding 'c' for the proofs. I got used to it from lots of practice and last week's lecture.

But, I found out that all the questions that I solved so far was related to polynomials. Non-polynomials, like limits, questions were really hard and different. I had to use L'Hopitals rule which I learned from MAT135/136. It was really interesting to see how you can relate all the math rule into proofs. 

Week 8: Oct 27 - 31, 2014

Assignment 2 is very confusing, because it contains some non-boolean  function proofs, which is my weakness. Now, I do get the concept of non-boolean functions, but it is still hard for me to imply it to the proof structure.

This statement and example gave me clear definition.
For the last parts of lecture slides were very confusing to me, because I didn't see the connection between big-O and algorithms.

Week 7: Oct 20 - 24, 2014

I found out that my partner and I made some silly mistakes on assignment 1. This week was just more practice on proofs which helped me more clear on proofs. Also, it gave me confidence when working on proofs. Working with proof by cases were interesting and easy. It gave me different side of views of proofs. 

Algorithms were easy, because it was review from CSC108 and CSC148. However, running time, big O, big-Omega, and analysis of worst cases were difficult. Especially big-O and big-Omega were still confusing. Tutorial questions were not helpful for understanding big-O concept, because it was more based on proofs questions. 

Week 6: Oct 13 - 17, 2014

The average of term test 1 was high, but I have expected high average, because it was very similar to last year's past test. This week's lecture material was somewhat easy and somewhat hard. The concept of non-boolean functions were hard to understand, especially "floor". Since, the structure of proof is very clear for me, implying non-boolean functions to proof was not that hard than I expected. 

Disproving part was really fun, even though I have to be extra becareful for 'not' part of the function. 

The introduction to limit proofs are still challenge for me. I need to do more practice.

Week 5: Oct 6 - 10, 2014

The term test 1 was very similar to last year's past test. The last question was very similar to assignment, so it was easy to solve. Working on the assignment was very helpful on studying for the term test. This week's material, working with contrapositive, contradiction, and negations were very confusing, but interesting. The lecture slides were very organized, so it was a big help for myself to learn proof, because proof without using numbers are pretty much new to me.

I found out myself very confident during tutorial. Practicing lots of problems and examples were very helpful.