I'm uncertain on whether or not if we should've written a blog during the reading week, but I forgot anyways, and technically we didn't really 'learn' anything during the reading week, so I'm just going to let that one go.
Sorry about the lateness of this blog, my blogs are usually written on Wednesday but I was kept busy with my midterms and I kind of forgot, I promise that my next blog will be written on the Wednesday.
All non-course related materials aside, we started doing proofs that can get a bit more complicated and now we are not specifically told whether or not if the statement is valid. This requires us to do a little bit of extra work at the beginning figuring out whether or not if we want to prove, or to disprove the statement given. This is probably done by substituting in a bunch of examples, if the majority of them works then look for counter-examples that do not work.
Another thing we started this week is complexity, we actually did this on friday so if I'd written this blog on Wednesday it would not have been a part of this blog. I remember doing Complexity in CSC108 and talking about it brought back memories of that class. However, in 108 we simply talked about the program run time and how a program normally runs n times, but if you have a nested for loop the running time becomes n ** 2. We took it a 'step' further in class and talked about steps. So far it seems like the complexity stuff is not too hard, all you have to do is break everything down into subgroups and add them all together to find out the total step of the run time.
No comments:
Post a Comment