Sunday, 10 March 2013

SLOG 6

It's been quite some time since I've wrote a slog entry. I've been quite lazy and I've been slacking a whole lot. I'm not doing as well as I want to on the quizzes and also in some other courses that I'm taking. I'm going to need to work harder in this course as well as my other courses to make up for my mistakes. Assignment 2 is finally complete and test 2 is coming up this week. It sucks that I have a test everyday for 3 days again.

I'm not excited for this test since proofs don't really amaze me and I don't enjoy doing proofs. As well, I don't think that I'm great at doing proofs either. The test will mainly consist of multiple proof questions and so I will need to work harder. I'm also hoping that my mark for this test will be higher than my previous test.

Chapter 4 doesn't seem that interesting, but it does seem very helpful in the future. I'm still kind of confused when professor Heap is talking about the upper bound and lower bound of some function. The reason for this is possibly because of lack of attention during lectures.

The problem that I will be exploring and trying to solve is this problem called Growing Sequences. The link to this problem can be found here: https://wwwcgi.cdf.toronto.edu/~heap/cgi-bin/Solvent/wiki.pl?Problem_Solving_Home_Page/GrowingSequences

2 comments:

  1. I remember I had crazy schedule when I was taking 5 courses. Although it was pretty tough, I think it was the most fun time in my life! Chapter 4 will be very useful if you are majoring in computer science. You can basically measure efficiency of your code and so that you can be more efficient! you can basically treat upper bound and lower bound as the longest compute time and the shortest compute time.

    ReplyDelete