Difference between revisions of "Matthew Pearson-Beck"
From WLCS
(→2nd Quarter) |
(→2nd Quarter) |
||
| Line 42: | Line 42: | ||
== 2nd Quarter == | == 2nd Quarter == | ||
| − | 1. Week 1 Work<br> | + | <size=1>1. Week 1 Work<br> |
| − | DUE:11/15<br> | + | DUE:11/15<br> |
2. Week 2 Work<br> | 2. Week 2 Work<br> | ||
| − | DUE:11/19<br> | + | DUE:11/19<br> |
3. Week 3 Work<br> | 3. Week 3 Work<br> | ||
| − | DUE:11/23<br> | + | DUE:11/23<br> |
4. Week 4 Work<br> | 4. Week 4 Work<br> | ||
| − | DUE:11/30<br> | + | DUE:11/30<br> |
5. Week 5 Work<br> | 5. Week 5 Work<br> | ||
| − | DUE:11/30<br> | + | DUE:11/30<br> |
6. Week 6 Work<br> | 6. Week 6 Work<br> | ||
| − | DUE:11/30<br> | + | DUE:11/30<br> |
7. Week 7 Work<br> | 7. Week 7 Work<br> | ||
| − | DUE:12/6<br> | + | DUE:12/6<br> |
8. Week 8 Work<br> | 8. Week 8 Work<br> | ||
| − | DUE:12/10<br> | + | DUE:12/10<br> |
9. Week 9 Work<br> | 9. Week 9 Work<br> | ||
| − | DUE:12/16<br> | + | DUE:12/16<br> |
10. Week 10 Work<br> | 10. Week 10 Work<br> | ||
| − | DUE:12/22<br> | + | DUE:12/22<br> |
11. Week 11 Work<br> | 11. Week 11 Work<br> | ||
| − | DUE:1/4<br> | + | DUE:1/4<br> |
12. Week 12 Work<br> | 12. Week 12 Work<br> | ||
| − | DUE:1/4<br> | + | DUE:1/4<br> |
13. Week 13 Work<br> | 13. Week 13 Work<br> | ||
| − | DUE:1/4<br> | + | DUE:1/4<br> |
14. Week 14 Work<br> | 14. Week 14 Work<br> | ||
| − | DUE:1/10<br> | + | DUE:1/10<br> |
15. Week 15 Work<br> | 15. Week 15 Work<br> | ||
| − | DUE:1/14<br> | + | DUE:1/14<br></size> |
== 3rd Quarter == | == 3rd Quarter == | ||
== 4th Quarter == | == 4th Quarter == | ||
Revision as of 15:48, 8 November 2010
1st Quarter
Description
Create a class in Java that diagrams the formation and structure of Nodes, as they are created. Used to help introduce Nodes to students learning Java.
Resources
http://zetcode.com/tutorials/java2dtutorial/
http://www.sourcecodesworld.com/articles/java/java-data-structures/Nodes.asp
http://www.vias.org/javacourse/chap14_02.html
Goal List
1. Research in detail the structure of nodes in Java.
DUE: 9/17
DONE
2. Complete 2D Graphics Tutorial.
DUE: 9/27
DONE
3. Finish research, in its entirety, to make it possible to graphically represent nodes.
DUE: 10/1
DONE
4. Graphically represent a single empty node.
DUE: 10/5
DONE
5. Graphically link together empty nodes.
DUE: 10/12
DONE
6. Control the layout of nodes based on the dimensions of the window they are in.
DUE: 10/14
DONE
7. Graphically link together a set of empty nodes within the bounds of the window.
DUE: 10/18
DONE
8. Graphically display the information a node contains.
DUE: 10/22
DONE
9. Graphically display a given set of nodes, including the data they contain, inside the bounds of the window.
DUE: 10/28
DONE
10. Organize all methods into a file that can be used to illustrate how nodes work. This file can be used by any student as they create their own nodes.
DUE: 11/1
DONE
2nd Quarter
<size=1>1. Week 1 Work
DUE:11/15
2. Week 2 Work
DUE:11/19
3. Week 3 Work
DUE:11/23
4. Week 4 Work
DUE:11/30
5. Week 5 Work
DUE:11/30
6. Week 6 Work
DUE:11/30
7. Week 7 Work
DUE:12/6
8. Week 8 Work
DUE:12/10
9. Week 9 Work
DUE:12/16
10. Week 10 Work
DUE:12/22
11. Week 11 Work
DUE:1/4
12. Week 12 Work
DUE:1/4
13. Week 13 Work
DUE:1/4
14. Week 14 Work
DUE:1/10
15. Week 15 Work
DUE:1/14
</size>
