Two down, one to go. The conclusion of assignment deux signals the end of the chapter on proofs. And just as I was starting to enjoy and get the hang of it too! But I'm not greatly disheartened by that because term test 2 is just around the corner, which implies more proving. Awesome. Bazinga! Either ways, I thought that the second assignment was moderate in difficulty, and some of the questions certainly needed one to dust and then don on their thinking caps.
For now though, its on to a new topic - calculating the efficiency of a program in its worst case - or as I like to call it, determining the worst case scenario. So far, I'm enjoying this topic as it involves running through programs and finding the number of 'steps' required for any given algorithm. (This is where the Python compiler in my head earns its pay) I realize that 'steps' is an arbitrary number which varies based on the definition. No one knows for sure, or at least at our level it is impossible to determine how much work a computer does to perform any given task. For now though, I'm going to try and concentrate on the upcoming test.
For now though, its on to a new topic - calculating the efficiency of a program in its worst case - or as I like to call it, determining the worst case scenario. So far, I'm enjoying this topic as it involves running through programs and finding the number of 'steps' required for any given algorithm. (This is where the Python compiler in my head earns its pay) I realize that 'steps' is an arbitrary number which varies based on the definition. No one knows for sure, or at least at our level it is impossible to determine how much work a computer does to perform any given task. For now though, I'm going to try and concentrate on the upcoming test.
No comments:
Post a Comment