Skip to main content

Week 12: THIS IS THE END.

Hello my lovely lovely readers!

 This will be my concluding post for the course! (unless I fail this course, which I really am hoping will not happen...)

 Today I would just like to recount my experience throughout this course, which I would say was overall pretty bomb-tastic (my awkward way of saying this was a good time). The course was interesting, challenging, and above all a great learning experience. I felt like the little taste of different data structures and recursive coding is a great start to the rest of my time in the computer science department. 

 During this semester I definitely encountered a myriad of problems and conceptual dead-ends that I was luckily able to get through. Trees, recursive coding, linked lists, they were all a step above the level of thought that needed to go into the coding from CSC108. Every lab was a bit of a challenge, but in a good way. It kept me on top of my game and constantly reviewing 148 concepts (I can't say that I did the same for my other courses however...)

 All in all this was a very positive experience and the instructors, TAs and my fellow classmates were amazing and very helpful and engaging. I had a wonderful time and I would definitely recommend this course to others in the future.

 Thank you all for being with me on my journey, and I hope you have a great summer!
Lana :)



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