Midterms and Complexity

It's hard to believe another Midterm is already upon us, and I have made it my goal to very well on this coming midterm. It will cover binary search trees, complexity, and sorts. All of which I had no trouble understanding.

My only worry is:

1. the fact that I have been able to find very few previous midterms, to give me any kind of an idea as to what  the next exam will look like.

2. Recursion rears its head again, although I have been able to write a few recursive functions, it takes me quite some time to write it, and I fear I might run out of time on the exam.

Binary Tree Nodes and Recursion

After several visits to office hours, as well as watching a few videos on Youtube. I think I finally understand (slightly) recursion. It comes at a good time, considering, A2 is due on November 5th and I'll need to know recursion in order to do the assignment.

This Week in Review

Although its just the start of the week. I decided to write out my entry now. This week's topic is binary trees/linked lists. I found it incredibly interesting, to me one of the most interesting things we've done so far. Mainly because it is an actual structure that I can trace in my mind. When I think of a binary tree, I see the root at the top and its many children attached, it's almost a game with rules, and pieces as how you traverse, delete and push objects onto the tree.

As for my progress on recursive functions, it is slow. I will have to put more time into and take all advice into account.

OOP/Recursion

Recursion is a concept that took me some time to fully understand, the definition seems simple. A recursive function is a function that calls itself. Writing a recursive function for well defined, simple problems is easy enough however, as the function increases in difficulty learning recursive functions becomes, well, more difficult. Despite that, recursive functions are useful in that they are much neater than iterative functions, easier to debug and are optimal for situations where the object to be processed isn't too lengthy.

Assignment 1

This week's assignment was particularly challenging, although very interesting. I have sent some time, trying to work on it. I think it comes down to practicing recursion more.

Recursion, Inheritance, Exceptions and Testing

This week was all about recursion, inheritance, exceptions and testing code. Moreover, in order of difficulty (lowest to highest): Testing, Exceptions, Inheritance and Recursion. Despite, reading all that I can on recursive functions the nature of the implementation still evades me. My plan of "attack" (for lack of better words) is to search for videos online on the subject for non-programmers and then go up in difficulty from there. Once, I have watched all the online video resources available to me, I will look for recursive problem sets starting from very basic recursion to more difficult recursive functions. I will write down my progress in championing recursion in the next couple of weeks.

Introductions

So, this is a new blog. It looks a little empty, so I decided to make a quick post.

Yep, that's it.