We had our final lecture today which included the 3rd and the final term test. I dont remember much about it now though question 2 seemed a little tricky, though it was probably me procrastinating and not looking over the assignment solutions in due time. The positive to take out of this is that it was the last test of the course so its rosy days ahead... until the final comes anyway.
Looking back in this course, it has been a thoroughly entertaining one. We started off learning simple induction, proceeded to learn couple of more flavors in induction, namely complete induction and structural induction. Complete induction was particularly interesting as it was horribly difficult to understand when we first saw it in mat137 last year. Now after three months of csc236 its almost second nature to me.
We followed that by learning how to prove that a program works again by using induction techniques in our proof. This particularly caught my fancy as i would not have thought that there is a mathematical model to proving algorithms. Overall perhaps the most enjoyable part of the course.
This was followed by 3 weeks of regular expressions and languages. Unfortunately i struggle to understand what exactly could be the point of this area of computer science in fields like bioinformatics, AI etc. I do see a strong connection of it with a programmer since i have myself used a little bit of in csc207. I hope the future courses make it more clear about its real deal. It was however a good learning experience and DFSA's were in particular useful to know about.
Danny did a great job of this course overall. He was also my course instructor in csc165 and its been a great learning curve for me with him over the last one year. I was in his office today morning and expressed my wishes that he teaches csc343 again next fall. I really hope he does!
CSC236 ruleeeeeeeez!!
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment