Difference between revisions of "Matthew Pearson-Beck"
(→2nd Quarter) |
(→2nd Quarter) |
||
| Line 59: | Line 59: | ||
Goal List | Goal List | ||
<font size=1> | <font 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 | #* DUE:1/14 | ||
</font> | </font> | ||
Revision as of 09:34, 10 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
Files: (completed)
File:LinkNodes.java
Contains the final source code, can be executed in Eclipse (or other program) to perform all the functions listed above. It requires the Linked List file, which requires the Node file (provided below)
File:NodeMPB.java
File:LinkedListMPB.java
2nd 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. 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
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"
