A Month of Refreshing My CS Knowledge

It’s been over a month since I started refreshing my CS knowledge project. Up until this point I have focused on my C and data structure programming skills. I created a repo of basic data-structures along with C unit tests – https://github.com/danaspisak/c-refresh. I’ve covered singly-linked lists, doubly-linked lists, stack, queue, and now binary search tree. So far I’ve done several exercises for most of the structures. I just completed delete for the binary search tree and have yet to work through any exercises.

General C and pointers weren’t much of an issue. There were some standouts for being challenging. Swapping a node in a doubly-linked list was one I remember spending a lot of time on figuring out. The other was delete in a binary search tree. That prompted me to buy a small dry-erase board because I was chewing through paper trying to figure it out.

Next

I’m not 100% sure what to work on next. I’d like to do some of the BST exercises from https://geeksforgeeks.org. The library could use some refactoring. If I’m going to treat it like a library then there are duplication’s and inconsistent APIs. The unit tests are weak in a few places.

It hit me today that I’ve been working on this for a month now. I am happy that I’ve been consistent with making progress. I spend an hour on it most nights. Keep pushing forward.