Skip to main content

First Impressions

Hello readers!

I hope your week has been going well so far! The weather recently has been fluctuating from skin hardening cold to mild shivering cold and back, so I hope none of you have gotten sick! Stay warm, kids.

So today I'd like to just talk about my experience in CSC148 these past few weeks, and boy have they been hectic. It's not all because of this course, it's just that my multiple weekly quizzes and assignments, compounded with life science labs and work-study has really been keeping me very busy. (If any of you are interested in the bioinformatics specialist, let me tell ya, it's actually a pretty intense workload due to the spread of different styles of courses you need to take)

The first few weeks were kind of an intensive review of creating our own classes, along with the teaching of inheritance and the completion of our first assignment. The first assignment was very difficult to synthesize at first, due to my own inability to not understand anything on the assignment handout, but once I got on track it was one of the most enjoyable assignments I have completed thus far (I'm in my second year).

Last week we learned about recursion and boy is it a brain exercise to trace, and currently impossible for me to come up with a working code for creating a recursive function. I shall work harder to understand this (mostly because the test is in 3 days), and I hope that you all, my fellow warriors in this midterm season, are also able to defeat this monster of a concept. (Hopefully I'm not the only one who doesn't understand this 'Inception' code... a function within a function....)

Well that's it for today folks!! Have a good week, stay safe and good luck on the test!

Lanaaaa :)
Labels:

Comments

Post a Comment

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 :)
Post a Comment
Read more

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...
Post a Comment
Read more

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 ...
Post a Comment
Read more