This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
haas:fall2017:data:projects [2017/10/10 13:18] – [Break 1] wedge | haas:fall2017:data:projects [2017/11/27 18:23] (current) – [Projects] wedge | ||
---|---|---|---|
Line 21: | Line 21: | ||
| [[/ | | [[/ | ||
| [[/ | | [[/ | ||
- | | | + | | [[/ |
- | | | + | | [[/ |
- | | | + | | [[/ |
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | [[/ | ||
+ | | @lightgreen: | ||
======Class Stats====== | ======Class Stats====== | ||
* [[/ | * [[/ | ||
+ | |||
+ | ======Week 12====== | ||
+ | * We cap off our data structures explorations this semester with trees, and the dlt0 project. | ||
+ | * We'll also be unveiling the EoCE. All celebrate and cheer! | ||
+ | |||
+ | ======Week 11====== | ||
+ | * Now we're onto queues, another important data structure | ||
+ | |||
+ | ======Week 10====== | ||
+ | * And now we start to pick up the pace a bit, with dll2 and dls0, our first foray into additional data structures | ||
+ | |||
+ | ======Week 9====== | ||
+ | * We continue our list implementation with dll1. | ||
+ | |||
+ | ======Week 8====== | ||
+ | * We are now halfway through the semester. Look at how far we've come! | ||
+ | * We will now embark on our first great re-implementation of our nodes and lists, with the addition of another pointer in our node: **fro** | ||
+ | * this means each node points to TWO other nodes, the familiar one that comes after (our " | ||
+ | * there are some additional features and functionality introduced as well, in the **dln0** and **dll0** projects, kicking our great re-implementation. | ||
======Break 1====== | ======Break 1====== |