Friday was a day and a half! The day’s topics were all about adding to our understanding of time complexities by relating them to hash sets and linked lists, and further developing our understanding of those two topics by implementing an LRU cache, which uses a hash set that directly points to node within the link list. What this allows for is a data structure that has constant time for lookup, insertion and deletion.

One of the most awesome things I’m finding out about App Academy so far is the stuff I’m learning. I always had this doubt in my mind that App Academy might not prepare me correctly for the job field, just because there’s always been this stigma with bootcamps and graduates coming out with a lack of computer science knowledge. Now, this doesn’t mean that App Academy will be teaching me everything I need to know in terms of computer science concepts, but it’s extremely comforting to know that not only am I being taught the theory of the concepts to some degree, but they have set projects for it that deepen understanding by having you implement the concepts with code.

I was reading a blog article over the weekend about a developer of 15 years who studied for 8 months full time to become a Google Software Engineer, you can check it out here. It was definitely reassuring to see that a lot of the topics that he put on the study guide were and will be covered during my time here at a/A. Sorting and searching algorithms, various data types, including those of abstract data types like linked lists, all these topics are topics that I’ve learned thus far. I’m excited for what’s in store.

As of right now, I’m just practicing for the assessment on Monday, after which, we’ll be starting a week of SQL. Wish me luck! I’ll need it! That’s pretty much it today, gotta get back to studying!