| CIS 250-01 Computer Science II Fall 2009 | ||||||||||||||||
| ID Code | Programs | Test | Current | Current | ||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 1 | 2 | 3 | % | Grade | |
| 14060 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 82.5 | 100 | 104 | A |
| 225984 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 87 | 77.5 | 100 | 88.177 | B | |||
| 331625 | 100 | 100 | 100 | 100 | 60 | 100 | 83 | 80 | 80 | 74.011 | C | |||||
| 824764 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 92 | 77.5 | 95 | 92.177 | A | ||
| 962480 | 0 | 0 | E | |||||||||||||
| 997311 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 84 | 82.5 | 100 | 88.602 | B | |||
| 998420 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 89 | 52.5 | 75 | 81.982 | B | ||
| Points-> | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 100 | 82.5 | 100 | 100 | A | |
| Due | 9/29 | 9/29 | 10/1 | 10/8 | 10/8 | 11/10 | 11/19 | 11/19 | 12/8 | 12/15 | 12/15 | 10/15 | 11/24 | 12/10 | ||
| Note, missing assignments are shown as 0. Turn them in SOON to get credit. | ||||||||||||||||
| 1 | LaFore 6.6 | |||||||||||||||
| 2 | LaFore 6.8 serial number | |||||||||||||||
| 3 | LaFore 9.7 Inheritance, add postfix for increment and decrement | |||||||||||||||
| 4 | LaFore 10.6 strcmp(s1,s2) using pointers | |||||||||||||||
| 5 | LaFore 10.11 10 arrays treated as one, overload [ ] | |||||||||||||||
| 6 | File I/O * | |||||||||||||||
| 7 | The Strange Stack * | |||||||||||||||
| 8 | The Strange Queue * | |||||||||||||||
| 9 | Circular Linked List Queue * | |||||||||||||||
| 10 | Recursive Maze Traversal * | |||||||||||||||
| 11 | Comparison of Sorting Algorithms (extra credit) * | * see web page | ||||||||||||||