240716 - Week 4/Week 5 - Recover/ Data Allocation

This week I finished up the problem set “recover.” The basic premise was that a memory card was corrupt. We created a program that created JPEGs of all the memory jumbled together. This code took me about three days.

On the first day, my program created the correct amount of folders for the JPEGS, but it failed to correctly find the JPEGS. The next two days were filled with troubleshooting. I found that my code was writing to an already open file instead of creating a new one. It was a little tricky, but I eventually understood that I needed to close one file and then write to a new file.

The next two days I started watching the week 5 lectures. I’m still going through the material ( I only have so many hours/energy to go through it all), but I am trying a new approach. Before, I would watch the lecture, then the shorts, then the section, and then start the problem.

This tactic works okay, but the problem I was encountering was that by the time I started watching the section, I would have forgotten what was in the lecture. Also, because I was watching the shorts all at once, I would be so overwhelmed with information, that I would often forget what it was I had learned.

My tactic this week has been to pause mid-lecture and then watch the short that corresponds with the portion of the lecture that I had watched. I’ve found that it is a tiny bit repetitive, but as I continue to the next portion of the lecture, I have a firmer grasp of what is going on. I’m also able to stay more engaged this way.

In the future I’m going to see if there’s a way to work on the problem sets while working through the videos.

So far in the videos, I’m learning about nodes, singley-linked lists, and doubley-linked lists.