Week 10

It is almost final exam, I am start my review this week.

We learned a new proof of big Omega this week, based on the proof last time. Instead of picking a c for upper bound, this week we proof by picking a c that is small enough for the lower bound. We also learned to proof some of the general functions of big O. 

The new chapter we started this week, I learned about the general idea of computability. A big issue we learned about computing was that the computer calculate based on algorithm. However, there are some problems that are hard or cannot be solved by algorithm. The example in the slide about halting problem has demonstrated this pretty well.

Week 9

This week learned more about big-Oh proofs, and also prove big-Oh using limit techniques. Last week we learned about the break point B. When beyond this break point, f(n) is upper-bounded  by cn².

This week we learned about picking c and B. bound relation was really important. Also in all the polynomials we have looked at, simply look at the highest-degree term. I was a little bit confused with the using limit to prove big-Oh part,

I was a little bit confused. However, after I review my notes and power points, I understand the whole prove was simply a three step proof. We need to calculate the limit as we have learned in calculus and then transfer it into big-Oh.

\Week 8

It is another week. one less week to the final exam.

This week we learned how to define O and Ω. O is the upper boundary for set of functions. For example, O(n²) is set of function that grows no faster than n². On the other hand, Ω is lower boundary for set of functions, which means Ω(n²) is set of function that grows no slower than n².

We also learn about how to analyse a sorting algorithm. Insertion sort contains is to remove an element from the unsorted part and then insert it into the correct position in the sorted part.

Week 7

It is almost winter, and here is another week of school. For the term test I received last week, I finally get rid of all the questions I had. There will be no more tests until the final, which I think is enough time to study for the final. 

This week we learned how to split the argument into different cases, and prove the conclusion for each cases. Also we learned about the two patterns of inference: introduction and elimination. Introduction was to work from a smaller statement to a larger statement, and the elimination would be opposite. And here are all the proof we have learned, and we started a new Chapter which is the algorithm, which is widely in programming. 

Week 6 Study

I got my term test back this week and the score was as expected. There were just some mistake I made. I reviewed the test and those mistakes were all self explanatory. I gain more confidence in this course.

This week, we continued to learn about proofs. More Proofs! The three new proofs this week are proof about non-boolean functions, proof something false and proof about limits. The hard part was the proof about limits. It added in some elements as we had previous learned in calculus. After read through the slide multiple times, I found out that the key to these kind of question is still searching backward, as we did in past few weeks. Proofs are all quite similar in general.

Week 5 Study

Happy thanksgiving! We got a long weekend to study more. Being productive is always good.

We completed the term exam last week, it was not as hard as I thought. I have another Math exam next week. The proof structure was explained quite clearly during the tutorial #4. As Natalie said, it was just like peeling a onion.

We learned how to proof contrapositive and contradiction. We also learned how to directly proof existential and about a sequence. I did not complete understand how the proof about sequence part. However, after studying it, I learned that it may consist several different structures.

Term text is coming

Four weeks passed so fast. I will have the first term text on Tuesday. I am so exciting and nervous about the exam.

I reviewed the slides for four weeks in this weekend. And I also reviewed the tutorial materials. We also completed the first assignment in group by Friday. We had three meeting during the weekend and we were very satisfied with our answers.

We learned implications/disjunction, mixed quantifiers and proof this week. When I reviewed the tutorial, there were several questions that I wasn't sure about the answers. I discussed within my group and will ask those questions in class.

Weather became so cold and the winter is coming. Thanksgiving day is coming. It's a good time to review the course slides.