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: