The past week has been focused on preparing for the term test not only for CSC165 but for other classes as well. Fortunately, and the reason why I love computer science, the material is not something that must be memorized. You simply need to understand it to a point where it can be applied to any type of problem. You are not simply regurgitating information but applying what you have been taught to new problems.
The main issue with the test was simply the worry about remembering the manipulation rules. They are very similar to other properties in math so the rules were not entirely new. A cheat sheet was allowed and with the help of the summarized rules in the course notes, I wrote down all the manipulation rules on one sheet of paper organized under names of the rules.
The benefit of preparing a cheat sheet is not to have the chance to look over or spend time looking over the written material during the test. Instead, at least for me, it serves as a method to remember information. Throughout the course all lecture notes are provided so writing down notes is not necessary along with being difficult while trying to listen. However, when I write something down I tend to never forget it. Everyone has their ways to memorize material, for me that is writing it down.
Lectures throughout the past week have been covering the methods of proving statements and implications. Proofs have always been the weak point and most difficult portion of any math related course. The tutorial handout is posted and contains proof related problems. I will try my best to work through this handout and with the help provided during the tutorial, both my peers and the TA, the material should begin to seem less foreign.
The main problem with proofs is figuring out where to begin. After the first step, proofs usually move along like dominoes. I am hoping to find tips, tricks, and suggestions when going over solutions during the TA. Examples and observing how others go through proofs is the most beneficial method to learn proofs.
Our proof structure is like dominoes that fall inward. You can fill in the proof from the top, with matching conclusions at the bottom. Finally you are left with the non-automatic ... steps to find a way to fill in.
ReplyDelete