Tuesday, November 25, 2014

Week 11 - Halting

Dear Blog,

This week was relatively short in CSC 165 because we had a break on the Monday and Tuesday, but we were introduced to a new concept, one that I find particularly difficult, and that was halting. Basically, a program halts if it returns control to the user. If it loops infinitely, then it did not halt. An error is even considered a halt.

Professor Heap spoke about how it is impossible to create a function that is able to check whether or not another function will halt. This concept is pretty difficult for me to grasp.

Also, I got Assignment 2 back and my group did not do as well as we had hoped at all. Overall, not the best week in CSC165. We are trying to get a good head start on Assignment 3 so we can study and be prepared for the final.

Wish me luck!

J.M

Week 10

Dear Blog,

Before I was pretty confused about Big O and Big Omega but now I have a pretty good grasp of it. In week 10 we learned many different ways of proofing and disproving Big O and Big Omega statements.

It is quite simple to prove Big O statements in my opinion, because there are different ways to do it, as long as the C and B you end up choosing satisfy the equation, you are good to go. I felt that week 10 was very important for me to understand the concepts of Big O, Big Omega, lower bounds, and upper bounds.

I am happy with my midterm mark and I hope to keep improving in this course. I hope to do well on Assignment 2 and Assignment 3 so I have a very good shot at getting in the subject post next year!

Thanks,
J.M

Monday, November 3, 2014

Big-Oh

Dear Blog,

           Recently in CSC165:  Mathematical Expression and Reasoning for Computer Science, we have been learning about how to count the steps of sorting algorithms, the worst case scenarios of algorithms and the "Big-Oh". The week started off a big confusing, there were a lot of variable involved with counting steps but as we progressed, it became more clear to me. Counting steps basically involves counting the total amount of steps an algorithm takes to sort a set, usually we will count the total amount of steps it would take the worst case scenario of the algorithm to perform. For example if we wanted a set sorted from least to greatest, the worst case scenario would be if it started in order from greatest to least.

          Big-Oh of n^2 basically shows how all quadratic functions grow at roughly the same speed. The worst case scenario can be an overestimate or an underestimate. I will elaborate more when I have more time. For now, I have to focus on my term test. 

Thank you,
J.M


Preparing for the Term Test

Dear Blog,

           The second term test is approaching and I feel quite confident about it. I found last year's text pretty straightforward and after completing many examples from my notes, the course notes and lecture slides, I feel like the proof king. I am really counting on doing well as I missed the first test and now this one is worth more of my final grade. Also, my group just handed in Assignment 2 and I feel as though we performed decently on it. We struggled with claims 1.2 and 1.3 but overall I think I will be content with our mark.

Thanks for reading,
           J.M