CST 370 Week 3

Week 3

This week we covered converting infix expressions to prefix (or polish notation) and postfix (reverse polish notation) using stacks. The video tutorials we are following also explained how to evaluate the expressions using stacks but we didn't practice that ourselves. We also covered queues. The basic ideas of queues are very simple and I have been impressed with the challenges provided in the assignments.

I'm excited to learn about complexity next week and really deepen my knowledge on algorithm efficiency. This is a topic that you can never have enough review of and is extremely helpful for job interviews and real-world practice.

Here is my video on the programming assignment this week:

CST 370 Week 2

Week 2

We're on to stacks this week! I'm familiar with stacks from previous experience and courses, so this week wasn't very challenging for me and that is a-okay by me. I've enjoyed the review and not feeling completely swamped in assignments. The assignments were fun to think through and get working.

I got marked off on a piece of my lab for something that I misunderstood from the assignment and did intentionally, which drives me crazy. I really try to make sure I get all of the details down and didn't even think that I would need to clarify this bit. However, I think the extra credit from my video from last week cancels out the missed points. I'm hopeful that there weren't any misunderstandings this week!

Here is my video on the programming assignment for this week:

CST 370 Week 1

Week 1

It begins! A new year and a new set of courses. I'm very rusty with C++, since it's been nearly 10 years since I last worked with it, but am hoping to get back into the swing of things soon. The topic this week, linked lists, is familiar to me. I've implemented them in both Ruby and Java previously. In both cases, I wasn't working with pointers and references! I will understand when to use which one and what (heh) by the end of this course, dang it.

We had a couple of assignments that all basically had us iterating through some nodes to accomplish things, like insertion or just printing the data that the node contains. All of the reading and videos were also related to linked lists and doubly linked lists. The primary programming assignment was to find all of the possible substrings in a string beginning with 'A' and ending with 'B' and print them to the console.

Here is my video covering how I implemented the programming assignment this week: