I'm behind on these. Will try to keep up!
What we did today:
1. Reflective feedback session
Discussions that are held for us to complain about anything and everything. MKS(Makersquare) considers students' feedback a top priority
2. Lecture on Test-Driven-Development
3. Town hall
4. Continue pair-programming on data structures
They gave us so much time to work on the data-structure sprint. We ended early and I went on to try the "Nightmare mode" extra-credit: implementing a b-tree class.
According to wikipedia:The B-tree is a generalization of a binary search tree in that a node can have more than two children. Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. B-trees are a good example of a data structure for external memory. It is commonly used in databases and filesystems.Pretty complicated -- I called it quits after trying for an hour. However I plan on revisiting this later.
1.15.16
No comments:
Post a Comment