| Spring 2008 - B. Domanski - Rosters & Grades | ||||||||||||||||||||||||||
| CSC 326 9138 9138 INFO STRUCTURES 4.0 6.0 4.0 ACTIVE | ||||||||||||||||||||||||||
| TERM 02/2008 LIMIT 35 ENROLLED 33 LAST UPDATE 01/26/2008 | ||||||||||||||||||||||||||
| ID | quiz1 | quiz2 | quiz3 | min quiz | avgquiz | min lab | avgLab | Quiz+Lab | Grade | lab1 | lab2-LL | L2-comments | Lab3-pLot | L3-Comments | Lab4-Recursion | L4-Comments | L5-Bus Stop | L5 Comments | L6-Trees | L6-Comments | ||||||
| 0072 | 52 | 77 | 90 | 52 | 84 | 0 | 46 | 68 | C | 0 | 69 | Nothing was appended; no code was modified other than the main. | 0 | No show | 90 | Works great | 70 | 9 build errors | 0 | |||||||
| 0195 | 46 | 50 | 82 | 46 | 66 | 50 | 81 | 72 | C | 75 | 69 | does not work | 50 | Wrote 30-40% of it - maybe | 80 | Sequentially recursive | 90 | very good | 90 | Breaks when deleting the root from a tree | ||||||
| 0221 | 100 | 87 | 87 | 87 | 94 | 0 | 82 | 89 | A | 98 | 50 | stolen from Lei, but smart enough to change his name | 0 | No show | 79 | needed (hi+lo)/2 | 90 | fine | 95 | terrrific | ||||||
| 0440 | 100 | 87 | 0 | 0 | 94 | 90 | 98 | 95 | A | 90 | 99 | The copy they all stole from … | 99 | Simply excellent. | 95 | Very Great | 95 | excellent | 100 | Great fix on tree.h! | ||||||
| 0449 | 72 | 47 | 76 | 47 | 74 | 0 | 78 | 76 | C+ | 75 | 60 | this is a gift | 0 | No show | 75 | min=30, max=32? Seq recursive and wrong | 90 | 2 Busses - cool! | 90 | Breaks when deleting the root from a tree | ||||||
| 0816 | 100 | 97 | 0 | 0 | 99 | 90 | 97 | 98 | A | 99 | 99 | simple, elegant, excellent | 99 | outstanding-written from scratch | 95 | Superb | 95 | very original bus.h | 90 | Breaks when deleting the root from a tree | ||||||
| 0820 | 100 | 84 | 0 | 0 | 92 | 0 | 45 | 73 | C | 90 | 0 | 0 | Present, not submitted | 75 | No mid; seq recursive; 1,2 not equal | 60 | A text file was submitted that is empty | 0 | ||||||||
| 1061 | 100 | 67 | 86 | 67 | 93 | 75 | 91 | 92 | A | 99 | 75 | I don't understand how this program works; the code says one thing, the output says another | 85 | required manual input | 85 | Works good | 95 | Nice Job! | 90 | Nice, but like all the others, it breaks when the root is removed. | ||||||
| 1177 | 80 | 57 | 77 | 57 | 79 | 75 | 90 | 83 | B | 90 | 89 | Looks alot like some others, especially main | 89 | very good … questionable code | 90 | Fine | 90 | this was fine! | 75 | Works great. Leo's .h file!! | ||||||
| 1228 | 92 | 90 | 61 | 61 | 91 | 0 | 79 | 86 | A- | 98 | 89 | how come the name of your pgm is identical to some others???? | 50 | stole the code and broken anyway | 90 | Happy & correct | 70 | Not submitted as a project. | 0 | |||||||
| 1457 | 72 | 40 | 74 | 40 | 73 | 0 | 50 | 64 | D | 95 | 0 | stolen from Yeum | 75 | worked-questionable code | 80 | Close, but num broken | 0 | 0 | ||||||||
| 1498 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | F | 0 | 0 | 0 | No show | 0 | Not here | 0 | 0 | |||||||||
| 1857 | 88 | 0 | 0 | 0 | 44 | 0 | 0 | 26 | F | 0 | 0 | stolen from Lei | 0 | No show | 0 | Not here | 0 | 0 | ||||||||
| 2994 | 96 | 83 | 97 | 83 | 97 | 60 | 86 | 92 | A | 99 | 75 | I don't understand how this program works; the code says one thing, the output says another | 60 | No departs; no .h file; it does something that cant be explained | 90 | SRAND-Very Good | 75 | Submitted; not readable or executable | 90 | Breaks when deleting the root from a tree | ||||||
| 3256 | 96 | 87 | 0 | 0 | 92 | 75 | 93 | 92 | A | 99 | 75 | did not append list2 to list 1 | 95 | Original, worked fine. | 90 | looked at a 2nd time | 90 | Queue<customer> | 90 | Breaks when deleting the root from a tree | ||||||
| 3354 | 96 | 80 | 86 | 80 | 91 | 0 | 10 | 59 | D | 50 | this is my lab that you had to modify. Too bad. | 0 | Present, not submitted | 0 | Not here | 0 | 0 | |||||||||
| 3461 | 84 | 60 | 72 | 60 | 78 | 0 | 64 | 72 | C | 95 | 0 | stolen from Lei | 0 | No show | 75 | min is right; max is wrong; why did you write minmax as 2 separate functions??? | 70 | build errors | 80 | A little broken; Delete goes out to lunch; the menus stop working when doing the tree traversals | ||||||
| 3621 | 20 | 60 | 86 | 20 | 73 | 75 | 88 | 79 | B | 98 | 85 | I will not accept anything but a zip file in the future. | 85 | Good! | 99 | Because he said it was really good | 75 | no project submitted; code has bugs | 75 | had to build the project. Blew up when deleting root | ||||||
| 3659 | 96 | 88 | 0 | 0 | 92 | 0 | 86 | 90 | A | 99 | 99 | I lost it | 50 | stole the code & modified it some | 90 | Very Good! | 93 | BusQueues - great! | 0 | |||||||
| 4575 | 64 | 74 | 91 | 64 | 83 | 0 | 66 | 76 | C+ | 95 | 0 | stolen from Yeum | 65 | handed in; somewhat broken | 80 | Not assigned, no split array / Sequential/worked | 90 | ok. No .h, but good use of queue<> | 0 | |||||||
| 4961 | 88 | 54 | 91 | 54 | 90 | 0 | 64 | 79 | B | 0 | 69 | does not work; doesn’t append; no code was changed that counts. | 75 | I saw it | 85 | Sequentially recursive call function as parn | 90 | while turned into an if | 0 | |||||||
| 5082 | 100 | 77 | 0 | 0 | 89 | 94 | 97 | 92 | A | 95 | 99 | outstanding | 99 | Original and terrific | 95 | terrific | 94 | Very Very good | 98 | You spoiled me as I was expecting more! | ||||||
| 5130 | 92 | 80 | 89 | 80 | 91 | 0 | 82 | 87 | A- | 98 | 50 | stolen from Lei, but smart enough to change his name | 90 | ok | 80 | Sequentially recursive | 90 | good | 0 | |||||||
| 5191 | 100 | 80 | 0 | 0 | 90 | 0 | 53 | 75 | C+ | 95 | 0 | stolen from Lei | 0 | Present, not submitted | 80 | Sequentially recursive | 90 | good | 0 | |||||||
| 6360 | 44 | 97 | 97 | 44 | 97 | 79 | 96 | 96 | A | 99 | 99 | he did it | 95 | Very very good! | 95 | minmax struct; Really Good | 90 | Very Very good | 79 | error at end of main | ||||||
| 6596 | 60 | 34 | 76 | 34 | 68 | 0 | 56 | 63 | D | 95 | 99 | Corrected | Medical | 85 | Works fine; | 0 | 0 | |||||||||
| 6682 | 0 | 34 | 0 | 0 | 17 | 0 | 94 | 48 | F | 95 | 99 | I looked at it and it ran fine | 90 | Long Int problem resolved | 95 | Very nice / templates | 90 | Intense … but good! | 0 | |||||||
| 6802 | 96 | 0 | 0 | 0 | 48 | 0 | 20 | 37 | F | 99 | 0 | Only a .sln file submitted. I suspect nothing was written, and that this was stolen | 0 | No Show | 0 | Not here | 0 | 0 | ||||||||
| 6807 | 88 | 67 | 86 | 67 | 87 | 0 | 66 | 79 | B- | 99 | 0 | 50 | Stolen from Thiha Aung | 90 | Worked good; Amax, Bmax | 90 | Very very good | 0 | ||||||||
| 7252 | 100 | 43 | 91 | 43 | 96 | 0 | 75 | 87 | A- | 99 | 99 | fine | 0 | No Show | 90 | not quite but good enough | 89 | good, but I don't understand the output other than the average wait time | 0 | |||||||
| 7670 | 80 | 83 | 89 | 80 | 86 | 0 | 69 | 79 | B | 75 | 50 | stolen from Lei, but smart enough to change his name | 90 | Pretty good! | 70 | Works, but not recursive | 60 | many errors | 0 | |||||||
| 7711 | 88 | 43 | 87 | 43 | 88 | 0 | 90 | 88 | A- | 99 | 0 | nothing submitted | 85 | Works, but duplicate code | 95 | Wonderful & beautiful | 90 | it's real good! | 79 | broke on deleting the root; you should only have written a main, and not modified the .h given | ||||||
| 7971 | 76 | 0 | 0 | 0 | 38 | 0 | 10 | 27 | F | 0 | 50 | submitted incomplete | 0 | Not submitted | 0 | Not here | 0 | 0 | ||||||||
| 8268 | 66 | 80 | 0 | 0 | 73 | 0 | 95 | 82 | B | 99 | 95 | interesting. Good work. But part of assignment, indirectly, was to at least get familiar with templates. Still, a good job. | 0 | Present, not submitted | 95 | Nice, comments, use of a class | 95 | very nice job! | 89 | still breaks when I delete the root after a tree is formed | ||||||
| 8535 | 100 | 87 | 91 | 87 | 96 | 0 | 84 | 91 | A | 90 | 0 | stolen from Dupinder | 90 | Good, works, no counts | 80 | works; looks like all the others; and its very late | 90 | Works ok | 70 | incomplete functionality | ||||||
| 9358 | 92 | 67 | 86 | 67 | 89 | 0 | 17 | 60 | D | 0 | 0 | 0 | No Show | 85 | Works ok | 0 | 0 | |||||||||
| AVERAGE | 78.4 | 62.3 | 54.1 | 54 | 70 | 38 | 64 | 68 | C | 78.0 | 52.6 | 47.6 | 74.4 | 66.6 | 38.3 | |||||||||||