Difference between revisions of "Matthew Pearson-Beck"
From WLCS
(→1st Quarter) |
(→1st Quarter) |
||
Line 11: | Line 11: | ||
Goal List | Goal List | ||
<font size=1># Research in detail the structure of nodes in Java. | <font size=1># Research in detail the structure of nodes in Java. | ||
− | + | #*DUE: 9/17 | |
− | + | #*DONE | |
− | + | # Complete 2D Graphics Tutorial. | |
− | + | #*DUE: 9/27 | |
− | + | #*DONE | |
3. Finish research, in its entirety, to make it possible to graphically represent nodes. | 3. Finish research, in its entirety, to make it possible to graphically represent nodes. | ||
DUE: 10/1 | DUE: 10/1 |
Revision as of 16:18, 9 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
# Research in detail the structure of nodes in Java. #*DUE: 9/17 #*DONE # 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
Goal List
- Week 1 Work
- DUE:11/15
- Week 2 Work
- DUE:11/19
- Week 3 Work
- DUE:11/23
- Week 4 Work
- DUE: 11/30
- Week 5 Work
- DUE:11/30
- Week 6 Work
- DUE:11/30
- Week 7 Work
- DUE:12/6
- Week 8 Work
- DUE:12/10
- Week 9 Work
- DUE:12/16
- Week 10 Work
- DUE:12/22
- Week 11 Work
- DUE:1/4
- Week 12 Work
- DUE:1/4
- Week 13 Work
- DUE:1/4
- Week 14 Work
- DUE:1/10
- Week 15 Work
- DUE:1/14
Media:EuclidsGCDAlgorithm_6080_6089.java
Written on 11/8/10, it illustrates Euclid's Algorithm for finding the Greatest Common Denominator of Two Numbers. Illustrates a concept discussed in MIT's OpenCourseware lectures for the class "Great Ideas in Theoretical Computer Science"