This week in 165 we wrapped up our introduction to proofs by looking at different introduction and elimination rules. I found them simple enough because they are some concepts we've already seen before. After that we moved on to Algorithm Analysis and Asymptotic Notation, which I enjoyed learning about. We looked at different sorting methods and why one might take longer than another, and why certain algorithms are more favourable than others because of their speed. It was nice to see something finally make sense right off the bat.
The tutorial this week was also very good, and I finally feel like I'm starting to get a grip of what we are learning. I was able to solve the simple proofs in the tutorial, or at least know where to start. The TA we have is also getting better at explaining certain concepts to us by getting a feeling for what we are confused by. It also helped that my friend and I spent that afternoon working on assignment 2 together, and working with a partner helped me understand what I was missing. So far assignment 2 is a good blend of challenging proofs and accessible proofs. I was even able to get one on my own, which really surprised me.
I think overall this course has inspired me to give math another chance academically, and probably pursue computer science to a depth I hadn't considered before. I feel like soon I'll be past an initial road block, and after that I'll grasp many new math concepts easier than before. Who knows, maybe I'll even take the next proof course after this one.
M
No comments:
Post a Comment