User Tools

Site Tools


haas:fall2015:data:projects

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision
Previous revision
haas:fall2015:data:projects [2015/10/20 09:41] – [Break Week] wedgehaas:fall2015:data:projects [2015/12/05 11:06] (current) – [Projects] wedge
Line 14: Line 14:
   * [[/haas/fall2015/data/projects/sll3|sll3]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/sll3/metrics|metrics]]<nowiki>]</nowiki> (due 20151028)   * [[/haas/fall2015/data/projects/sll3|sll3]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/sll3/metrics|metrics]]<nowiki>]</nowiki> (due 20151028)
   * [[/haas/fall2015/data/projects/sll4|sll4]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/sll4/metrics|metrics]]<nowiki>]</nowiki> (due 20151028)   * [[/haas/fall2015/data/projects/sll4|sll4]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/sll4/metrics|metrics]]<nowiki>]</nowiki> (due 20151028)
 +  * [[/haas/fall2015/data/projects/dln0|dln0]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/dln0/metrics|metrics]]<nowiki>]</nowiki> (due 20151104) 
 +  * [[/haas/fall2015/data/projects/dll0|dll0]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/dll0/metrics|metrics]]<nowiki>]</nowiki> (due 20151104) 
 +  * [[/haas/fall2015/data/projects/dll1|dll1]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/dll1/metrics|metrics]]<nowiki>]</nowiki> (due 20151111) 
 +  * [[/haas/fall2015/data/projects/dll2|dll2]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/dll2/metrics|metrics]]<nowiki>]</nowiki> (due 20151118) 
 +  * [[/haas/fall2015/data/projects/dls0|dls0]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/dls0/metrics|metrics]]<nowiki>]</nowiki> (due 20151202) 
 +  * [[/haas/fall2015/data/projects/dlq0|dlq0]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/dlq0/metrics|metrics]]<nowiki>]</nowiki> (due 20151202) 
 +  * [[/haas/fall2015/data/projects/dlt0|eoce0]] <nowiki>[</nowiki>[[/haas/fall2015/data/projects/eoce0/metrics|metrics]]<nowiki>]</nowiki> (due 20151217) 
 +  * [[/haas/fall2015/data/projects/eoce1|eoce1]] (due 20151217)
 ======Class Stats====== ======Class Stats======
-^  DATA  ^  dsi0  ^  sln0  ^  sln1  ^  sll0  ^  sll1  ^  project  ^  participation  ^  opus  ^  total  +  * [[/haas/fall2015/data/projects/status|status]] 
- lowscore:|          0  |  4  |  11  |  18  |  49  | + 
- avgscore:|  75  |  91  |  71  |  72  |  70  |  27  |  24  |  31  |  82  | +======Project FAQs====== 
- hiscore: 100  |  100  |  100  |  100  |  100  |  37  |  28  |  36  |  101  | +  * [[/haas/fall2015/data/projects/faq|faq]] 
- median:|  79  |  100  |  81  |  96  |  84  | + 
-^  mode:|  100  |  100  |  97  |  97  |  100  | +======Week 13====== 
-^  range:|  100  |  100  |  100  |  100  |  100  | +  * End of Course Experience released! Check the bottom of your Opus. 
- passed:|  75%  |  90%  |  80%  |  80%  |  75%  | +    * Note that you must be signed in to view/edit it. 
- As:|  40%  |  85%  |  25%  |  60%  |  45%  | +  * **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. 
-^  Bs:|  10%  |  5%  |  30%  |  0%  |  10 | +    * mktree() functionality now provided (should be all you need to commence work on addnode() and traverse_s()). 
-^  Cs:|  25%  |  0%  |  25%  |  10%  |  15%  | +  * Project pages for the tree part of **eoce0** and the entirety of **eoce1** are now available. 
-^  Ds: 0%  |  0%  |  0%  |  10%  |  5%  | +  * The **eoce1** project is now available. 
-^  Fs: 25%   10%  |  20%  |  20%  |  25%  | +  * Starting next week, the IPKA (In-Person Knowledge Assessment) will be available. 
-^  submit: 90%  |  95%  |  95%  |  80%  |  80%  |+ 
 +======Week 12====== 
 +  * **dll1** results are in- surprisingly, less challenging than **dll0** (when you look at the numbers). Also, fairly on par with the fall2014 class (they have a slight but consistent edge). 
 +  * 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 EoCEI plan to deploy it upon our return from break. 
 +  * Because you deserve nice thingsI extended the **dls0** due date until Wednesday, December 2nd, 2015 (same as **dlq0**). Note that **dll2**'s due date remained unchanged (and I am not planning on adjusting the due date of **dlq0**). Hopefully this gives people the opportunity to get stacks figured out, as well as queues (both are rather important). 
 +======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, upgrade to **display()** 
 +    * **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't mean the implementation is guaranteed to be easier (especially if you're not mindful of such details). I'm not saying it is harder, merelyit isn't like the singly version. The same concept is there, so if you have an understanding, that part won't be in your way, but if you aren't drawing pictures and stepping through the logic, the extra pointer will get in your way, turning an otherwise simple operation far more complex. 
 +    * 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 dll1. 
 +    * 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!) 
 +      * rememberdraw pictures, work logic out on paper, get plenty of sleep, and use the debugger! 
 +        * I mean itdon'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, they seemed to make rather quick work of it 
 +    * 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====== 
 +  * Doubly-linked stuff is unveiled this week, and it kicks off our first rebuild (second implementation of code). 
 +    * Please strive to do a fresh implementation, a lot of the singly-linked stuff is riddled with your learning, and you should continue your learning by giving it an honest go (not to mention most of your previous code will not be compatible without heavy changes). 
 +  * Course status has been moved into its own status page, and updated. Check it out for some interesting hints at trends. 
 +  * As past trends seem to indicated, sll2 was a more challenging project than some previous. 
 +    * At the same time, we seemed to fare much better than prior semesters, and many problems were actually expected as part of the learning process (sll2 relies on past code more than previous projects, so it routed out more bugs that were previously uncaught). 
 +    * Conversely, this project was the watershed moment for a few people who achieved their enlightenment. Quite interesting results all around. 
 +    * So don't despair! Many who had trouble were doing some amazing things-- improving debugging skills, fixing sloppy code... those things only serve to improve your skills.
 ======Week 8====== ======Week 8======
   * A few people took advantage of the break and got an early start on things. I thank you for that.   * A few people took advantage of the break and got an early start on things. I thank you for that.
haas/fall2015/data/projects.1445334099.txt.gz · Last modified: 2015/10/20 09:41 by wedge