haas:fall2015:data:projects
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| haas:fall2015:data:projects [2015/10/31 13:25] – [Projects] wedge | haas:fall2015:data:projects [2015/12/05 11:06] (current) – [Projects] wedge | ||
|---|---|---|---|
| Line 17: | Line 17: | ||
| * [[/ | * [[/ | ||
| * [[/ | * [[/ | ||
| + | * [[/ | ||
| + | * [[/ | ||
| + | * [[/ | ||
| + | * [[/ | ||
| + | * [[/ | ||
| ======Class Stats====== | ======Class Stats====== | ||
| * [[/ | * [[/ | ||
| + | ======Project FAQs====== | ||
| + | * [[/ | ||
| + | |||
| + | ======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====== | ||
| + | * 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. | ||
| + | * Another 2 project week: | ||
| + | * **dll2**: adding **qty** to your list implementation, | ||
| + | * **dls0**: stack implementation (on top of list) | ||
| + | * I evaluated **dln0** and **dll0**. A few surprises: | ||
| + | * more than a few of you seemingly forgot to submit **dln0**. You had fully working projects, but just didn't officially submit it. I manually handled it. This time. | ||
| + | * **dll0** was simultaneously more difficult for some, yet easier for others. Those who have been doing well seemed to get hit, whereas those who have been catching up had some real breakthroughs. | ||
| + | * Some **dll1** observations: | ||
| + | * be mindful of the second (prior) pointer. Just because you've done something before in singly doesn' | ||
| + | * 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. | ||
| + | ======Week 10====== | ||
| + | * Can you believe it-- week #10! | ||
| + | * We continue our linked list reimplementation, | ||
| + | * with doubly linked nodes, your implementations should be simultaneously simpler and more complex (simpler because you don't need as many extra steps to set things up, more complex because there are twice as many pointers to connect!) | ||
| + | * remember: draw pictures, work logic out on paper, get plenty of sleep, and use the debugger! | ||
| + | * I mean it: don't pull last-minute all-nighters with this stuff- the more tired you are, the less sense things will make. Brute forcing it will not help. | ||
| + | * you are quite capable in accomplishing all that is at play, and to grow considerably as a developer (and isn't that the overall point)? | ||
| + | * sll3 and sll4 have been evaluated | ||
| + | * some seemed to have a late start on sll3, not understanding its basic premise | ||
| + | * sll4 saw some interesting trends: | ||
| + | * appeared more difficult for some (maybe they got too used to nodes as a tool and not as a concept?) | ||
| + | * for those who saw the commonality, | ||
| + | * while sll4 was a more involved project than sll3, many did better on sll4 than they did on sll2 (the next most involved project) | ||
| ======Week 9====== | ======Week 9====== | ||
| * Doubly-linked stuff is unveiled this week, and it kicks off our first rebuild (second implementation of code). | * Doubly-linked stuff is unveiled this week, and it kicks off our first rebuild (second implementation of code). | ||
haas/fall2015/data/projects.1446297915.txt.gz · Last modified: 2015/10/31 13:25 by wedge
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
