Sunday, October 26, 2014

Finishing With Proofs

Hello Readers,

            Recently in CSC165, we have finished learning about proofs. And although they are quite difficult, once you finish a proof correctly, it is really rewarding. Some different types of proofs we learned about were:
  • Proving Existence (Proving that a set is non-empty)
  • Proving a Claim About a Sequence (define a sequence and then prove something about that sequence)
  • Contradiction, which is a special case of contrapositive. 
  • Non-boolean Functions, expressing a proof about a function that returns a non-boolean value (e.g: number, integer)
  • Proof By Cases (splitting you arguments to show all possibilities)
  • Proving Something False (Prove the negation of the claim)
  • Proof About Limits (you usually have to pick a certain value to make the proof work)
            There are definitely many other types of proofs but these are the main ones we have learned. Assignment 2 is all about proofs, and I hope to do well on that with the same partners I worked with last time. 

            Since finishing with proofs, we have started learning about sorting strategies. This concept is not new to me because I learned many different sorting algorithms in my grade 12 computer science class, so I'm hoping this will not be too challenging for me. I am quite confident with the different types of sorts, especially:
  • Insertion Sort:  Each iteration, insertion sort removes one element from the data, inserts it where it belongs in the list and repeats until everything is sorted.
  • Bubble Sort: Repeated checks each pair of adjacent items in the data and switches them if they are out of order, quite inefficient for big lists
  • Selection Sort: Cycles through the entire list looking for the next item in the list and once it knows which item to take, places it in the correct position.
I do not know much about mergesort and quicksort, but I do know they are very efficient so I can't wait to learn about them! 

          CSC165 is still my most challenging class, but also still my favourite class. I will keep you updated on how the unit on sorts turns out and how I will be preparing for my next term test. Thanks for reading!

Tuesday, October 14, 2014

Past Two Weeks

Dear Blog,

            I apologize that I have been slow on the blog posts. As stated in my previous blog, I've been really sick lately with the stomach flu, so sick that I could not write my first term test. In the past few weeks, Professor Heap has begun to teach us proofs. He started by teaching us proof structures then moved onto actual proof statements. I'm trying to keep up with the lectures even though I haven't been able to attend all of them. After midterms, when I am hopefully no longer sick, I hope to buckle down hard and really practice the different kinds of proofs until I know exactly what I am doing. I was prepared for the first term test, but I need to be even more prepared for the second, especially with how high it is weighted for me now. I will keep you updated with my struggles.

Thanks
- J.M

Thursday, October 9, 2014

Term Test

           This week was pretty interesting. Let me paint you a picture. It's the week of my first term test, and CSC165 being one of my relatively harder classes, I study quite hard for it and make a pretty awesome aid sheet. Now, I do not think I could have been any more prepared for this test, I was ready to ace it, but guess what happens next. I wake up with the stomach flu, but because I was so prepared I thought I would tough it out and try to write that test. So, the TA hands out the test papers and I read the first question. "Booya!", I thought in my head, I know this. I got this test in the bag. Well, the only thing in the bag that day was my vomit because I had to excuse myself for the rest of the test with an upset stomach. This is pretty frustrating because now my second term test is doubled in weight and it puts a lot of pressure on it, but I will just have to study ridiculously hard and ace it. Thanks for reading.
     -J.M.

Friday, September 26, 2014

CSC165: Third Week

            Welcome to my second blog on the course CSC165. As stated in my previous blog, this class is quite challenging but also very rewarding. Logic and reasoning is one of my favourite areas of study as it makes you think very abstractly. I was right in assuming I messed up one question in the first tutorial quiz but I know what I did incorrectly and still feel confident about the material we have covered. I feel as though I did much better in this week’s tutorial quiz.
            Throughout the third week of CSC165: Mathematical Expression and Reasoning for Computer Science, we began by learning about conjunction (“and”) and disjunction (“or”). I also learned the symbols for “and” & “or” which are an arrow pointing up and an arrow pointing down, respectively. The only frustrating thing about conjunction and disjunction is the English usage of “and” & “or” sometimes varies from the logic and mathematical usage, so it is important to note the difference. In logic, “and” will combine two statements by declaring they are both true. Using “or” will combine two statements by declaring that at least one of them is true. It is also known in English as “and/or”. After conjunction and disjunction, we went more into depth with negation. Negation is a concept that I do not find too difficult. It is pretty straightforward.
            A few things that I found really useful this week that I feel will help me immensely in this course:
  1.   During the tutorial, our TA put a list of statements that mean the same thing but use different symbols on the board. It really help me understand what the statements and symbols mean.
  2. In Monday and Wednesday’s lectures, professor Heap went over truth tables which really assist you in interpreting predicates. To me, they are much more helpful than Venn Diagrams.
  3. I learned that many laws in arithmetic also apply in logic, such as the commutative, associative and distributive properties.
  4. De Morgan’s Law is useful when trying to negate certain statements.
             This course does not relate much to all of my other courses and I feel like it will stay that way throughout the whole semester. I am enrolled in MAT135: Calculus 1 (A), but I feel like if I had chosen MAT137, it would relate to CSC165 much more. Assignment #1 has been released and is due on October 3rd. I am working with two other guys on this assignment and at this point we have pretty well all of it done. I am quite confident in our answers which is reassuring because midterms are slowly approaching, with the midterm for this class being on October 8th. It is nerve-wracking but I should be okay for it as long as I read over my notes and do many practice problems. I will keep this blog updated weekly with my frustrations, worries, achievements, and basically every other emotion. Thank you for reading.


            -J.M.

Thursday, September 18, 2014

CSC165: First Two Weeks

            Hello, welcome to my blog on CSC165: Mathematical Expression and Reasoning for Computer Science. This blog post is on the first two weeks of CSC165. The first day was a bit of an introduction, I did not learn too many new things other than what the topics this particular half year course will cover. What we mainly focused on in the first week of class was set properties, quantifiers, universal claims (i.e: all), and existential claims (i.e: some). During the first week, I learned many new symbols such as the symbols for subsets, “for all” (each), “there is” (exists), intersections, unions, and complements. Starting the second week we continued with quantifiers and learned how to verify or falsify quantified claims which I found quite interesting. Example: to verify a universal claim (for all), show at least one counter-example to the claim. Afterwards, we continued on to implication, which is a difficult concept to grasp at first but is stimulating to think about. In implication, there is an antecedent and a consequent. If A is the antecedent and B is the consequent, then we can say “If A, then B”. With implication there is also a converse and contrapositive example. If you reverse the direction of an implication, you will get the converse example of that implication. If you toggle and reverse an implication, you get its contrapositive example. This uses a new symbol as well, which negates a statement. I will continuously practice implication and try to master it by providing myself with example problems and re-reading my notes from class.
              So far this course seems like it will be really rewarding. Although I feel like I messed up one question on this week’s tutorial quiz, I still feel confident about the information we have learned thus far. Currently, I am also enrolled in CSC108: Introduction to Computer Programming. One similarity between the courses that I have already noticed is CSC165 touches upon the programming language “Python” which is the same language that is focused on in CSC108.  I realize CSC165 will be more of a challenging course, but it is actually very interesting. The logical topics that will be covered appeal to me and I hope to convey my excitements, frustrations, confusions, achievements and everything else in my upcoming blog posts. Thank you for reading.

            - J.M.