Skip to main content

Week 1: Welcome to the SLOG Life

Hello readers!

You have stumbled upon a small undergraduate student's (my) courSe LOG (SLOG), where, for the next few months, I will be posting about all things CSC165. The full name of this course is Mathematical Expression and Reasoning for Computer Science. Quite a mouthful, is it not? However, so far it's been very interesting, since I have always wanted to test to what extent my own logic is capable of. Since this is my first blog post, I will be just doing some first impressions on the course and the material we've covered so far.

First off, I would like to say that I have never taken any course like this before, so this material is all very foreign to me. From the emphasis on precise wording to the mystical venn diagrams that contained the universe, not to mention the new notation that I needed to learn, this seemed all very new and uncertain. After about a week of worrying about not being able to keep up with the coursework, I decided to buckle down and just enjoy the ride.

The material shown to us during the first week was by no means difficult, it was just new. We learned about ambiguity, precision, and building sets in python, including empty sets and booleans. In order to visualize and verify sets built in python, we were introduced to a venn diagram approach. At first, I was utterly baffled and was not sure of how the circles or crosses helped the problem, or if all the parts of the diagram needed to be filled in. However, after going through class examples, along with help from a wise friend, I was starting to understand the basic concepts behind the diagrams and what it represented. 

This week, we have started material on quantifiers and I am very interested to see what we can do with this new tool.

tl;dr version: The first week of class is always hectic, but once you get into the groove of things, everything will be much better.


Have a good one! (I'll come up with a catchy end-phrase for next week)

Lana :)

Comments

Popular posts from this blog

Week 12: Halting Problem Visualized

Hello readers! I'm sure you're all hard at work trying to finish assignment 3. I just wanted to take a few minutes to share with you a video I found on the halting problem. It may be a tad overdramatic (especially with the music) and corny, but it does explain the problem quite well. Here's part 1 (which can be skipped if you want): And part 2, which is where the real explanation of the halting function starts (skip to 2:33 if you don't like corny dialogue): Hopefully this helps with your endeavors (or at least is a bit entertaining)! Good luck with the assignment! Lana :)

Week 5: Tracing Recursion

Hello readers! How have you guys been recently? I have been bombarded with a myriad of tests, labs, and assignments, as usual, but I'll holding up alright! Today's blurb is on tracing recursion! As you all know, a recursive function is basically any function that is called within itself. You'll need it any time a bigger problem can be solved by solving smaller versions of a same type of problem until you get your answer to the big one. Kind of. At least that's how I see it. Anyhow, tracing recursion is not as bad as it sounds, it takes some bit of practice, of course, but all in all it will eventually click. Tracing recursion was on the test this week went successfully I should think. The quasi-solution I came out with with involved the function we needed to trace giving the maximum length of any lists that were fed into it, including the length of the overall list. If I am correct, then my tracing would have been successful. We shall see in due time! Bu...

Week 10: How to solve a problem

Hello my good friends! This week is the coveted fall reading break, and I hope you all are doing something useful with your time, like me, who is currently writing my SLOG. Now that the course is nearing its end, I would like to take it back to the beginning and try to solve one of those logic puzzles, using the Polya method we learned in class. I am, afterall, an amateur logician now, am I not? So here is the puzzle I have found from the problem solving wiki page. So without further ado, I present to you: Walk Tilings Suppose you have tiles that are 1x2 rectangles, and you have to tile a walk that is 2x3 units long. You've got three choices: 3 vertical tiles, 1 vertical tile followed by two horizontal tiles, or two horizontal tiles followed by one vertical tiles. How many choices do you have in tiling a 2x4 walk? How about a 2xn walk, where n is some natural number? Do you have a procedure that works for any n? Understanding the Problem Ultimately ...