This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
haas:fall2015:data:projects [2015/11/09 11:24] – [Week 11] wedge | haas:fall2015:data:projects [2015/12/05 11:06] (current) – [Projects] wedge | ||
---|---|---|---|
Line 18: | Line 18: | ||
* [[/ | * [[/ | ||
* [[/ | * [[/ | ||
- | * [[/ | + | * [[/ |
+ | * [[/ | ||
+ | * [[/ | ||
+ | * [[/ | ||
======Class Stats====== | ======Class Stats====== | ||
* [[/ | * [[/ | ||
Line 26: | Line 28: | ||
* [[/ | * [[/ | ||
+ | ======Week 13====== | ||
+ | * End of Course Experience released! Check the bottom of your Opus. | ||
+ | * Note that you must be signed in to view/edit it. | ||
+ | * **eoce0** project, after 2 released updates, now starts to compile and operate as expected. Still likely a few more updates upcoming, but we may be at a point where you can commence implementation. | ||
+ | * mktree() functionality now provided (should be all you need to commence work on addnode() and traverse_s()). | ||
+ | * Project pages for the tree part of **eoce0** and the entirety of **eoce1** are now available. | ||
+ | * The **eoce1** project is now available. | ||
+ | * Starting next week, the IPKA (In-Person Knowledge Assessment) will be available. | ||
+ | |||
+ | ======Week 12====== | ||
+ | * **dll1** results are in- surprisingly, | ||
+ | * work on the stack project is underway, I've had some good questions already. Please, keep them coming. | ||
+ | * queues (**dlq0**) will be the new project for the week... and will be very similar to stacks. | ||
+ | * **dlq0** may be the last weekly project before the EoCE. | ||
+ | * Speaking of the EoCE: I plan to deploy it upon our return from break. | ||
+ | * Because you deserve nice things: I extended the **dls0** due date until Wednesday, December 2nd, 2015 (same as **dlq0**). Note that **dll2**' | ||
======Week 11====== | ======Week 11====== | ||
* We're nearing the end of our active list explorations. It has been a long journey, fraught with frustrating logic errors, lots of debugging experience, and a whole lot of time. I have been very pleased with the progress I see from so many.. don't just look at things at the moment, look at how far you've come. There have been some truly amazing improvements. | * We're nearing the end of our active list explorations. It has been a long journey, fraught with frustrating logic errors, lots of debugging experience, and a whole lot of time. I have been very pleased with the progress I see from so many.. don't just look at things at the moment, look at how far you've come. There have been some truly amazing improvements. | ||
Line 38: | Line 56: | ||
* all sorting does **not** require swapping. Only some sorts use swaps. For those having trouble getting swap to cooperate with your sort attempts, you can either fix swap (a worthy pursuit, if not rushed), or go about sorting in a different way. | * all sorting does **not** require swapping. Only some sorts use swaps. For those having trouble getting swap to cooperate with your sort attempts, you can either fix swap (a worthy pursuit, if not rushed), or go about sorting in a different way. | ||
* don't go and look up existing sort algorithms, that's probably how you got to this issue in the first place. Plot out how you would accomplish a sort... work through the logic. Following the algorithm someone else made vs. figuring out one on your own? The latter will produce understanding at a much higher rate. | * don't go and look up existing sort algorithms, that's probably how you got to this issue in the first place. Plot out how you would accomplish a sort... work through the logic. Following the algorithm someone else made vs. figuring out one on your own? The latter will produce understanding at a much higher rate. | ||
- | |||
======Week 10====== | ======Week 10====== | ||
* Can you believe it-- week #10! | * Can you believe it-- week #10! |