So if anyone is actually reading these posts, you probably know by now that I'm not a 'formal' writer.
Especially since we're technically 'blogging', it's impossible for me to write in a style that suits an essay.
Now that that's out of the way..
Tracing Recursion !
Let me start by saying I have some experience in programming since I had C++ in high school.
So when we started recursion I had a mini panic attack. As far as I remember recursion is one of the tougher concepts and I wasn't so keen starting it.
Recursion is basically defining a function in such a way that it works for the simplest problem, and then calling itself so it then works for larger problems of the same kind. (Yes, it is as annoying as it sounds.)
Luckily for us recursion isn't on the midterm completely and only tracing is. I was disappointed in my lab exercise(test?) since I think I got the idea but I was too hasty and messed up. Anyhow after discussing my answers with other students after the midterm I know I did it right there so yay!
Tracing seems simple enough and one important advise that Diane gave us, that I find extremely helpful is "Don't over think". It really works !
Stacks&Queues..
As I mentioned, I've done C++ and have previous knowledge of how they work. Even though I was sick and had to miss the classes for this particular topic, I found the lab work simple enough to follow. The basic idea behind them is the same and honestly seems even easier in python.
The only thing I worry about is recursion during a test or exam. It always takes several tries (and sometimes not even then!) to get it right and I honestly don't know how we're expected to write code for it without actually running it.
I'm hoping it's a practice thing and I will eventually master the art of recursion.
Assignment 1 and Midterm 1 were sufficiently good for and I have high hopes for my GPA to survive thanks to this course!
Until next time..!
PS - Cannot wait for reading week...
No comments:
Post a Comment