Hello! I'm glad I'm doing these weekly summaries, because it's great to think of everything in relation to each other and to see the big picture. I think my favorite workshop of this week, just for content, was the ORM and Sequelize and the SQL ones. (We are still working on the ORM and Sequelize workshop). I like to think about how to use and organize data logically. Anyway, here are the rest of the topics we covered this week....
Hi, fam! I'm posting this Week One summary on *Tuesday* of Week Two, because I was trying to prioritize all of the pre-reading (see tip one) but here it is. Week One, we were given a loooooot of information. I think it was Dan or Liz who said it was like standing in a storm and holding a teaspoon. So, I'm going to go over what we learned the first week, and some tips to get through it.
What We Learned:
- Data Structures
- Sorting Algorithms
- Game of Life
- Node Introduction
- Compilers (CS Saturday)
1. Do the pre-reading! Definitely prioritize doing the pre-reading so you can go into workshops prepared.
Today is the last day of week 1, not including tomorrow, which is a CS Saturday. I can't believe the first week is over!
To start the day off, my pair coding partner, Rachel, and I continued working on the Game of Life workshop. We are almost finished, but for some reason, our step function is only running once. So we are going to meet up after the CS Saturday workshop, and fix that, so we can finish and host our project on Github pages.
My pair partner and I were discussing some ideas we had for Node projects, to get more practice. I had an idea to make an app that returns the foreign word for however the user is feeling, that doesn't exist in English. So if t...
Today we focused on sorting algorithms and re-creating Conway's Game of Life!
We analyzed different sorting algorithms to see why they had their notations. So when we traversed our binary search tree, that would have an O(N) because we traversed by splitting the tree in half, and I guess that's a linear operation, because when you add more nodes to the tree, you're still just splitting it in half. LOL, sorry I'm still working out the more complex cases of this concept, but if I keep analyzing functions I'm sure I'll get it.
Important Update Amendment: I wasn't being clear at all. :'( Searching through a BST is O(log n) because you eliminate half. (Like, th...
Wow, what a wild day! I'm so exhausted, so I'm sorry if this is hard to read, lol.
I came in a little early, and worked on an interesting Code Wars problem. The goal was to validate IP addresses. To do so, you had to get the hexadecimal value of each number that was input, to equal 32. It was cool to implement a hash function, which is something we learned yesterday.
Wait, really?! Yesterday?! I feel like I've been here for four years, but I also feel like each day is passing in hyper-speed.
Stella and I finished up our binary search tree methods. I'll miss working with her!
The second workshop was a little stressful because I was losing steam! My partner, Marina, was a...
Today was excellent! We continued learning about data structures, focusing on binary search trees and hash tables.
Stella and I were paired again, and we worked on creating a binary search tree constructor function. We were both kind of nervous when we learned that recursion would be a big part of our solution code, to make the leaves and to search, but we worked through it! I was pleased with how seamlessly we were able to visualize and map our solution on paper, then translate into actual JS.
All we have to do to finish the workshop is complete the three traversal methods. Before Immersive, I watched a few videos on binary tree traversal. I'm glad I did, eve...