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/3rd Quarter

Project 1 - MIT OCW - 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 and problem sets from all three will be used in order to get the best information possible. Notes will be studied from the Fall and Spring 2005 class schedules. Each week has problem sets associated with it. The problem sets to be completed are from the Fall 2002 class.

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 - DONE
  2. Week 2 - DONE
  3. Week 3 - DONE
  4. Week 4 - DONE
  5. Week 5 Work - DONE

  Note: While MIT OCW is great for providing a general understanding, the notes alone are usually inadequate for solving all of the problem sets. There were obviously some portions only discussed in the classroom that are vital to full understanding.
  

Project 2 - Augmented Reality - Description
Use Actionscript 2 (with Flash CS3) to make a project that uses Augmented Reality to demonstrate marker detection, model portrayal on objects, and hit detection between objects.

Resources

Goal List

  1. Create finalized markers (2-3), save as .pat files with the Marker generator.
     Due: 1/14/11
  2. Finalize decision on model choice for the two vehicles to collide.
     Due: 1/14/11
  3. Achieve marker recognition and portrayal of model on marker.
     Due: 1/21/11
  4. Achieve multiple marker recognition at one time.
     Due: 2/4/11
  5. Finish hit detection between models (related to inital marker position) and finish end animation sequence.
     Due: 2/18/11
  

Files:

  Media:EuclidsGCDAlgorithm_6080_6089.java

  File:EuclidsGCDAlgorithm 6080 6089Recursive.java

Written on 11/8/10, these illustrate Euclid's Algorithm for finding the Greatest Common Denominator of Two Numbers, which was discussed in MIT's OpenCourseware Lecture 1 for the class "Great Ideas in Theoretical Computer Science". The first file is iterative, and the second is recursive.

  File:GuessingGameStats.java

Written on 12/2/10, this illustrates an optimal guessing algorithm for numbers between 0 and 100 (the Computer Science I exercise),