Monday, October 13, 2014

CSC165 Week 4

Hello everyone,

Week 4 is finished and again we have learned much regarding the mathematical reasoning in computer science.  During the week we continued our discussion regarding quantifiers as well as implication and disjunction in symbolic statements.  A lot of this week, us students spent working on our assignments which was due on Friday.  Personally, I found the assignment quite useful in recalling the use of a lot of the material we have been covering.

A new introduction to this course this week was our introduction to proofs and their role in computer science.  Most of out introduction this week was spent learning the structure and organization of mathematical proofs rather then proving actual arguments, however, we will be working on proving computer related proofs.  So far, proofs seem interesting but are somewhat intimidating depending on the actual material which will determine how rigorous the proof must be.

Tuesday, October 7, 2014

CSC165 Week 3

Hey everyone,

Slogging week 3 here.  Some interesting but also challenging material we worked on this week.  We learned the effects of conjunction, disjunction and standard negation on common symbolic notation.  We learned that conjunction is basically the combination of two logical statements represented by the symbol "^" such that neither part is false. Translate to english this symbol is roughly equivalent to 'and'.  We also learned it's opposite, called disjunction, represented by the "v" symbol, which in english translates roughly to 'or' and means that one of two truth values must be true. And, finally, standard negation which as you may guess means that in a conjunction of two statements both statements must be false. In english this translates to 'not'.

We also learned more about implication and how it can be manipulated through a variety of different rules and equivalencies.  On friday, however, we took a unusual break from lecture in which we partnered up with someone in class to solve a puzzle regarding the pattern of folding paper.  This was quite an interesting exercise as we had to come up with ideas in a more present manner.

For me, this week in particular was difficult as I missed a class due to sickness and was set back by the difference in knowledge.  To help myself catch up, I attended the CSC Undergraduate Help Lab in the Bahen Centre were I was able to gain the insight provided in class.







Friday, September 26, 2014

CSC165 Week 2

Hello again,

Week 2 is over and I'm starting to believe the rumours, haha.  The course material has become much more "confusing".  We learned a lot about translating rational sentences in the english language to computable sentences with symbols and logic.  We worked a bit more on quantifiers, learning the circumstances for what to look for while verifying and falsifying proofs. The Tutorial for this week was quite informing, however I am not to sure if I did well or not on the quiz.

The more difficult information in my opinion was the information on implication and negation.  I am still finding this difficult and so I intend to research some videos or other literary material on the subject and if it still doesn't come to me I will go to teachers hours or the CSC help centre.  I didn't do as well as I anticipated on the tutorial quiz from last week so I intend on researching the matter further.  Overall, however, I still feel confident in my ability to perform in this class but I will need to seek the help on the areas I find difficult.

Thursday, September 18, 2014

CSC165 Week 1

Hello Everyone,

Week 1 for CSC165 at the University of Toronto is finished.  We did quite a bit of work refreshing the brain on number notation and set theory. The main topics covered, consisted of the necessary use of precision in word and symbol notation while programming and everything else in Computer Science. The reason behind this is that computers do not understand the ambiguity that we use in our everyday communication and thus we must be very precise to ensure that our programs compute in the correct manner.

At the beginning of the week I felt slightly frustrated by certain proofs, particularly the boolean problem sets in the lecture slides and found that venn diagrams confused the matter even more. To solve this problem I did a bit of internet research which aided my understanding, and by the end of the week I felt more confident and found that completing the tutorial problems for the following week was quite a bit easier. I am interested to see how I did on the tutorial quiz and will go from there on what concepts I may need more clarity on.

To finish up the week we learned about quantifiers, universal claims and existential claims which I found quite interesting.  Oddly enough these problems caused me very little difficult and the concepts even aided me in further understanding certain tasks for CSC108.