Matthew Pearson-Beck

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:
File:LinkNodes.java
File:NodeMPB.java
File:LinkedListMPB.java

LinkeNodes.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 (also provided). They have been renamed to NodeMPB and LinkedListMPB in order to avoid uploading files that have already been uploaded to the wiki. Their class names have been adjusted and they function correctly as written.

2nd Quarter

Description
Go through each lesson of the MIT Course "6.042J / 18.062J Mathematics for Computer Science", also known as "Discrete Mathematics". There are three separate OpenCourseware classes listed that cover the same material, so notes, problem sets, and tests from all three will be used in order to get the best information possible. Notes will be studied from the Fall 2005 class schedule, that has a 15-week lesson plan. Each week has problem sets associated with it. The problem sets to be completed are from the Fall 2002 class, which has 14 problem sets compared to 11 (Spring 2005), and 10 (Fall 2005). Examinations will be taken from the Fall 2005 class, because all three classes contain two quizzes and one exam, and the Fall 2005 quizzes and exam will be the most relevent, because I am learning from the Fall 2005 Notes.

Resources
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-fall-2005/
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-sma-5512-fall-2002/
http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-042j-mathematics-for-computer-science-spring-2005/

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
  

Files:
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"