diff --git a/Main.class b/Main.class
new file mode 100644
index 0000000..0e0fbd2
Binary files /dev/null and b/Main.class differ
diff --git a/Main.ctxt b/Main.ctxt
new file mode 100644
index 0000000..9d1e174
--- /dev/null
+++ b/Main.ctxt
@@ -0,0 +1,6 @@
+#BlueJ class context
+comment0.target=Main
+comment1.params=args
+comment1.target=void\ main(java.lang.String[])
+comment1.text=\r\n\ This\ one\ will\ have\ public\ static\ void\ main\r\n
+numComments=2
diff --git a/Main.java b/Main.java
index cb9a6c7..4860a20 100644
--- a/Main.java
+++ b/Main.java
@@ -30,17 +30,35 @@ public static void main( String[] args)
          *          call this array ar1.  Print it out below.
          */
         System.out.println("*** PRINTING ar1 *");
-        
+         int[] ar1;
+        ar1 = new int [n];
+        for (int i=0; i<ar1.length; i++)
+            ar1[i]=i;
+        for (int i=0; i<ar1.length; i++)
+        System.out.println("ar1["+i+"] = "+ar1[i] );
                 
         /*
          * Task 2.  Create a new array called ar2.
          *          Copy the elements of ar1 into ar2.
          */
-        
+        int[] ar2;
+        ar2 = new int [n];
+        for (int i=0; i<ar2.length; i++)
+            ar2[i]=i;
+        for (int i=0; i<ar2.length; i++)
+        System.out.println("ar2["+i+"] = "+ar2[i] );
         
         /* 
          * Task 3. Add 1 to each element in ar1.  Print it out below
          */
+          System.out.println("** Stask 3 **");
+        int value;
+        for (int i=0 ; i<ar1.length ; i++)
+        {
+            ar1[i] =  ar1[i] +1;
+        }
+        for (int i=0 ; i<ar1.length ; i++)
+            System.out.println("ar1[" + i + "] = "+ar1[i]);
         
 
         
@@ -52,12 +70,44 @@ public static void main( String[] args)
          *         ar1: 1 2 3
          *         ar3: 1 2 3 0 1 2 3
          */
+                System.out.println("** test 4 **");
+        int[] ar3 = new int[ ar1.length *2 ];
+        for (int i=0 ; i< ar1.length ; i++)
+        {
+            ar3[i]=ar1[i];
+        }
+        
+        for (int i=0 ; i<ar1.length ; i++)
+        {
+            ar3[i+ar1.length]=ar1[i];
+        }
         
+        for (int i=0 ; i<ar3.length ; i++)
+            System.out.println("ar3[" + i + "] = "+ar3[i]);
         
         /*
          * Task 5.  Switch the first and last element of ar1.
          *          print out the new ar1.  Then switch them back
          */
+                System.out.println("** Task 5**");
+
+        // Ye olde switcheroo
+      
+        value  = ar1[0];  // backup ar1[0] into a bitbucket
+
+        ar1[0] = ar1[ar1.length-1];  // copy last into ar1[0].  
+
+        ar1[ar1.length-1]=value;     // copy old value of ar1[0] into last
+        
+
+        // Print out the array
+        for (int i=0 ; i<ar1.length ; i++)
+            System.out.println("ar1[" + i + "] = "+ar1[i]);
+        
+        // The Restoration of the rightful heir
+        value  = ar1[0];
+        ar1[0] = ar1[ar1.length-1];
+        ar1[ar1.length-1] = value;
         
         /*
          * Task 6A. Print the 2nd to (n-1)th elements of ar1
@@ -66,6 +116,28 @@ public static void main( String[] args)
          *          the indices are multiples of 3
          *         
          */
+                System.out.println(" ** Task 6A **");
+        
+        // print 2nd to (n-1)th element
+        for (int i=1 ; i<ar1.length-1 ; i++)
+            System.out.println(ar1[i]);
+        
+            
+        System.out.println(" ** Task 6B **");
+        // print odd numbers in ar1
+        // AKA if ar1[i] is odd, print it out.
+        for (int i=0 ; i<ar1.length ; i++)
+            if (ar1[i]%2==1)
+                System.out.println(ar1[i]);
+            
+            
+        System.out.println(" ** Task 6C **");
+        // print elements if it is a multiple of 3
+        // AKA if ar1[i] is divisble by 3, print it out.
+        // AKA if ar1[2] has a zero as the remainer when divided by 3
+        for (int i=0 ; i<ar1.length ; i++)
+            if (ar1[i]%3==0)
+                System.out.println(ar1[i]);
         
         /*
          * Task 7.  For each element in ar1, 
@@ -78,6 +150,16 @@ public static void main( String[] args)
          *          ar[2]=30
          *          ar[3]=4
          */
+         System.out.println("** Task 7 **");
+        
+        for (int i=0 ; i<ar1.length ; i++)
+        {
+            if ( ar1[i]%2==1)
+                ar1[i] *=10;
+        }
+        
+        for (int i=0 ; i<ar1.length ; i++)
+            System.out.println(ar1[i]);
         
          /*
           * Task 8
@@ -89,12 +171,47 @@ public static void main( String[] args)
           *    ar2[2]=2
           *    ar2[3]=3  ->  ar2odds[1]=3
           */
+         System.out.println(" ** Task 8 **");
+           int k=0;
+           int[] ar2odds = new int[ar2.length]; // too big right now.
+           for ( int i=0 ; i<ar2.length ; i++)
+           {
+               System.out.println(ar2[i]); // Just print it out to see
+               
+               if (i%2==1)
+               {
+                   ar2odds[k]=ar2[i];
+                   k++;
+               }
+           }
+           
+           for (int i=0 ; i<k ; i++)
+               System.out.println(ar2odds[i]);
          
         /*
          * Task 9. In the array ar2, count how many odd numbers you
          * have.  Then create an ew array called ar4.  Copy just the odd
          * numbers from ar1 into ar4.  Print ar4
          */
+                 int l4=0;
+         for (int i=0 ; i<ar2.length ; i++)
+         {
+             if ( ar2[i]%2==1)
+                 l4++;
+         } 
+         int[] ar4 = new int[l4];
+         k=0;
+         for (int i=0 ; i<ar2.length ; i++)
+         {
+             if (ar2[i]%2==1)
+             {
+                 ar4[k]=ar2[i];
+                 k++;
+             }
+          }
+                   
+           for (int i=0 ; i<k ; i++)
+               System.out.println(ar4[i]);
         
         /*
          * Task 10.  Shift the elements of ar4 right by 1
@@ -102,12 +219,44 @@ public static void main( String[] args)
          * old   ar4: 1 3 5 7 9
          * new   ar4  9 1 3 5 7
          */
+          System.out.println("** Task 10 ** ");
+         System.out.println("Original ar4");
+         for (int i=0 ; i<ar4.length ; i++)
+             System.out.println(ar4[i]);
+        
+
+         int temp10=ar4[ar4.length-1];
+         
+         for (int i=ar4.length-1 ; i>0 ; i--)
+            ar4[i]=ar4[i-1];
+         
+         ar4[0]=temp10;
+
+         System.out.println("New ar4");
+         for (int i=0 ; i<ar4.length ; i++);
+             System.out.println(ar4[0]);
         
         
         /*
          * Task 11.  Reverse the order of elements in ar2
          */
-        
+                System.out.println("** Task 11 **");
+        for (int i=0 ; i<ar2.length ; i++)
+            System.out.println("ar2["+i+"] = "+ar2[i]);
+            
+        int ar2half = ar2.length/2;
+        System.out.println(ar2half);
+        int task11Temp;
+        for (int i=0 ; i<ar2half ; i++)
+        {
+            task11Temp = ar2[i];
+            System.out.println(" "+i+":"+(ar2.length-i));
+            ar2[i] = ar2[ar2.length-1-i];
+            ar2[ar2.length-1-i]=task11Temp;
+        }
+               
+        for (int i=0 ; i<ar2.length ; i++)
+            System.out.println("ar2["+i+"] = "+ar2[i]);
         
         /*
          * Task 12: 
diff --git a/nidd'/Main.class b/nidd'/Main.class
new file mode 100644
index 0000000..0e0fbd2
Binary files /dev/null and b/nidd'/Main.class differ
diff --git a/nidd'/Main.ctxt b/nidd'/Main.ctxt
new file mode 100644
index 0000000..a600d3d
--- /dev/null
+++ b/nidd'/Main.ctxt
@@ -0,0 +1,6 @@
+#BlueJ class context
+comment0.target=Main
+comment1.params=args
+comment1.target=void\ main(java.lang.String[])
+comment1.text=\r\n\ This\ one\ will\ have\ public\ static\ void\ main\r\n
+numComments=2
diff --git a/nidd'/Main.java b/nidd'/Main.java
new file mode 100644
index 0000000..4860a20
--- /dev/null
+++ b/nidd'/Main.java
@@ -0,0 +1,327 @@
+/*
+ * Example for Arrays
+ */
+
+import java.util.Scanner;
+
+class Main
+{
+    /*
+     * This one will have public static void main
+     */
+    
+    public static void main( String[] args)
+    {
+     
+     
+        
+        /*
+         * SET UP
+         * We are going to ask the user to input an integer 
+         * and we will call it
+                              n
+         */
+        Scanner s = new Scanner(System.in);
+        System.out.print(" Please type in an integer :");
+        int n = s.nextInt();
+        
+        /*
+         * Task 1.  Create an array of integers from 0 to n-1
+         *          call this array ar1.  Print it out below.
+         */
+        System.out.println("*** PRINTING ar1 *");
+         int[] ar1;
+        ar1 = new int [n];
+        for (int i=0; i<ar1.length; i++)
+            ar1[i]=i;
+        for (int i=0; i<ar1.length; i++)
+        System.out.println("ar1["+i+"] = "+ar1[i] );
+                
+        /*
+         * Task 2.  Create a new array called ar2.
+         *          Copy the elements of ar1 into ar2.
+         */
+        int[] ar2;
+        ar2 = new int [n];
+        for (int i=0; i<ar2.length; i++)
+            ar2[i]=i;
+        for (int i=0; i<ar2.length; i++)
+        System.out.println("ar2["+i+"] = "+ar2[i] );
+        
+        /* 
+         * Task 3. Add 1 to each element in ar1.  Print it out below
+         */
+          System.out.println("** Stask 3 **");
+        int value;
+        for (int i=0 ; i<ar1.length ; i++)
+        {
+            ar1[i] =  ar1[i] +1;
+        }
+        for (int i=0 ; i<ar1.length ; i++)
+            System.out.println("ar1[" + i + "] = "+ar1[i]);
+        
+
+        
+        
+        /*
+         * task 4. Create a new array called ar3.
+         *         Copy the elements of ar1 into ar3.  Then do it again
+         *         For example
+         *         ar1: 1 2 3
+         *         ar3: 1 2 3 0 1 2 3
+         */
+                System.out.println("** test 4 **");
+        int[] ar3 = new int[ ar1.length *2 ];
+        for (int i=0 ; i< ar1.length ; i++)
+        {
+            ar3[i]=ar1[i];
+        }
+        
+        for (int i=0 ; i<ar1.length ; i++)
+        {
+            ar3[i+ar1.length]=ar1[i];
+        }
+        
+        for (int i=0 ; i<ar3.length ; i++)
+            System.out.println("ar3[" + i + "] = "+ar3[i]);
+        
+        /*
+         * Task 5.  Switch the first and last element of ar1.
+         *          print out the new ar1.  Then switch them back
+         */
+                System.out.println("** Task 5**");
+
+        // Ye olde switcheroo
+      
+        value  = ar1[0];  // backup ar1[0] into a bitbucket
+
+        ar1[0] = ar1[ar1.length-1];  // copy last into ar1[0].  
+
+        ar1[ar1.length-1]=value;     // copy old value of ar1[0] into last
+        
+
+        // Print out the array
+        for (int i=0 ; i<ar1.length ; i++)
+            System.out.println("ar1[" + i + "] = "+ar1[i]);
+        
+        // The Restoration of the rightful heir
+        value  = ar1[0];
+        ar1[0] = ar1[ar1.length-1];
+        ar1[ar1.length-1] = value;
+        
+        /*
+         * Task 6A. Print the 2nd to (n-1)th elements of ar1
+         * Task 6B: Print out just the odd numbers in ar1
+         * Task 6C: Print out the elements of ar1 when
+         *          the indices are multiples of 3
+         *         
+         */
+                System.out.println(" ** Task 6A **");
+        
+        // print 2nd to (n-1)th element
+        for (int i=1 ; i<ar1.length-1 ; i++)
+            System.out.println(ar1[i]);
+        
+            
+        System.out.println(" ** Task 6B **");
+        // print odd numbers in ar1
+        // AKA if ar1[i] is odd, print it out.
+        for (int i=0 ; i<ar1.length ; i++)
+            if (ar1[i]%2==1)
+                System.out.println(ar1[i]);
+            
+            
+        System.out.println(" ** Task 6C **");
+        // print elements if it is a multiple of 3
+        // AKA if ar1[i] is divisble by 3, print it out.
+        // AKA if ar1[2] has a zero as the remainer when divided by 3
+        for (int i=0 ; i<ar1.length ; i++)
+            if (ar1[i]%3==0)
+                System.out.println(ar1[i]);
+        
+        /*
+         * Task 7.  For each element in ar1, 
+         *          If the element is even: leave alone
+         *          if the element is odd, multiply by 10
+         *          print out the new ar1
+         *          Example
+         *          ar[0]=10
+         *          ar[1]=2
+         *          ar[2]=30
+         *          ar[3]=4
+         */
+         System.out.println("** Task 7 **");
+        
+        for (int i=0 ; i<ar1.length ; i++)
+        {
+            if ( ar1[i]%2==1)
+                ar1[i] *=10;
+        }
+        
+        for (int i=0 ; i<ar1.length ; i++)
+            System.out.println(ar1[i]);
+        
+         /*
+          * Task 8
+          *    Create an array called ar2odds
+          *    If the index of ar2 is odd, copy it to ar2odds.
+          *    If not, do not
+          *    ar2[0]=0
+          *    ar2[1]=1  ->  ar2odds[0]=1
+          *    ar2[2]=2
+          *    ar2[3]=3  ->  ar2odds[1]=3
+          */
+         System.out.println(" ** Task 8 **");
+           int k=0;
+           int[] ar2odds = new int[ar2.length]; // too big right now.
+           for ( int i=0 ; i<ar2.length ; i++)
+           {
+               System.out.println(ar2[i]); // Just print it out to see
+               
+               if (i%2==1)
+               {
+                   ar2odds[k]=ar2[i];
+                   k++;
+               }
+           }
+           
+           for (int i=0 ; i<k ; i++)
+               System.out.println(ar2odds[i]);
+         
+        /*
+         * Task 9. In the array ar2, count how many odd numbers you
+         * have.  Then create an ew array called ar4.  Copy just the odd
+         * numbers from ar1 into ar4.  Print ar4
+         */
+                 int l4=0;
+         for (int i=0 ; i<ar2.length ; i++)
+         {
+             if ( ar2[i]%2==1)
+                 l4++;
+         } 
+         int[] ar4 = new int[l4];
+         k=0;
+         for (int i=0 ; i<ar2.length ; i++)
+         {
+             if (ar2[i]%2==1)
+             {
+                 ar4[k]=ar2[i];
+                 k++;
+             }
+          }
+                   
+           for (int i=0 ; i<k ; i++)
+               System.out.println(ar4[i]);
+        
+        /*
+         * Task 10.  Shift the elements of ar4 right by 1
+         * For example
+         * old   ar4: 1 3 5 7 9
+         * new   ar4  9 1 3 5 7
+         */
+          System.out.println("** Task 10 ** ");
+         System.out.println("Original ar4");
+         for (int i=0 ; i<ar4.length ; i++)
+             System.out.println(ar4[i]);
+        
+
+         int temp10=ar4[ar4.length-1];
+         
+         for (int i=ar4.length-1 ; i>0 ; i--)
+            ar4[i]=ar4[i-1];
+         
+         ar4[0]=temp10;
+
+         System.out.println("New ar4");
+         for (int i=0 ; i<ar4.length ; i++);
+             System.out.println(ar4[0]);
+        
+        
+        /*
+         * Task 11.  Reverse the order of elements in ar2
+         */
+                System.out.println("** Task 11 **");
+        for (int i=0 ; i<ar2.length ; i++)
+            System.out.println("ar2["+i+"] = "+ar2[i]);
+            
+        int ar2half = ar2.length/2;
+        System.out.println(ar2half);
+        int task11Temp;
+        for (int i=0 ; i<ar2half ; i++)
+        {
+            task11Temp = ar2[i];
+            System.out.println(" "+i+":"+(ar2.length-i));
+            ar2[i] = ar2[ar2.length-1-i];
+            ar2[ar2.length-1-i]=task11Temp;
+        }
+               
+        for (int i=0 ; i<ar2.length ; i++)
+            System.out.println("ar2["+i+"] = "+ar2[i]);
+        
+        /*
+         * Task 12: 
+         * Create an array of Strings called ar5.
+         * 
+         * Each element is a word of the following phrase
+         * 
+         * 
+         * Four score and seven years ago our fathers brought forth on
+         * this continent a new nation
+         *
+         *. ar5[0] = "Four"
+         *  ar5[1] = "score"
+         *  
+         *  Create another array of ints called ar6.  Write a for loop that
+         *  will iterate through each element in ar5 and the length of the
+         *  word is the element in ar6.
+         *  
+         *  ar5[0]= "Four"   ar6[0]=4
+         *  ar5[1]="score"   ar6[1]=5
+         *  ar5[2]="and"     ar6[2]=3
+         *  
+         *  Count how many words have more than 5 letters.
+         */
+        
+        /*
+         * Task 13
+         * Create an array called monsterArray of 5 Monsters.
+         * The name of the monsters are
+         * "Cookie"
+         * "Grover"
+         * "Oscar the Grouch"
+         * "Elmo"
+         * "Rosita"
+         * 
+         * Print out their names
+         * Use a for loop to print out the names of monster that start with
+         * a vowel
+         */
+        
+         /*
+          * Task 14
+          * Create an array of integers from 3 to 94 and call it arx
+          * Create an array of the indices of arx when the item is
+          * divisible by 3.  Call this arindex
+          *      arx[0]=94
+          *      arx[1]=95
+          *      arx[2]=96 // this is divisible.  Index is 2
+          *      arx[3]=97
+          *      arx[4]=98
+          *      arx[5]=99 // this is divisible  Index is 5
+          *      
+          *      So arindex[0]=2
+          *         arindex[1]=5
+          */
+         
+         /*
+          * Create an arrary called "fb" and calculate the
+          * first 10 fibonacci sequence.  You start with
+          * fb[0]=1
+          * fb[1]=1
+          * fb[2]=fb[0]+fb[1]
+          * fb[3]=fb[1]+fb[2]
+          * fb[4]=fb[2]+fb[3]
+          */
+        
+    }
+}
\ No newline at end of file
diff --git a/nidd'/Monster.java b/nidd'/Monster.java
new file mode 100644
index 0000000..524b0cb
--- /dev/null
+++ b/nidd'/Monster.java
@@ -0,0 +1,27 @@
+import   java.util.Scanner;
+
+class Monster
+{
+
+    // Name of monster
+    private String name;
+
+    // Constructor
+
+    /*
+     * Task 1. Create a default Constructor here
+     */
+
+    
+    /*
+     * Task 2: Create a constructor 
+     *      input parameter: String
+     *      set input equal to name
+     */
+    
+    /*
+     * Task 3 getters and setters for name
+     */
+    
+    
+}
diff --git a/nidd'/README.TXT b/nidd'/README.TXT
new file mode 100644
index 0000000..4f97f4a
--- /dev/null
+++ b/nidd'/README.TXT
@@ -0,0 +1,12 @@
+------------------------------------------------------------------------
+This is the project README file. Here, you should describe your project.
+Tell the reader (someone who does not know anything about this project)
+all he/she needs to know. The comments should usually include at least:
+------------------------------------------------------------------------
+
+PROJECT TITLE:
+PURPOSE OF PROJECT:
+VERSION or DATE:
+HOW TO START THIS PROJECT:
+AUTHORS:
+USER INSTRUCTIONS:
diff --git a/nidd'/package.bluej b/nidd'/package.bluej
new file mode 100644
index 0000000..1f0ae17
--- /dev/null
+++ b/nidd'/package.bluej
@@ -0,0 +1,39 @@
+#BlueJ package file
+editor.fx.0.height=739
+editor.fx.0.width=988
+editor.fx.0.x=290
+editor.fx.0.y=106
+objectbench.height=149
+objectbench.width=764
+package.divider.horizontal=0.6
+package.divider.vertical=0.6904761904761905
+package.editor.height=341
+package.editor.width=674
+package.editor.x=284
+package.editor.y=280
+package.frame.height=600
+package.frame.width=800
+package.numDependencies=0
+package.numTargets=2
+package.showExtends=true
+package.showUses=true
+project.charset=UTF-8
+readme.height=58
+readme.name=@README
+readme.width=47
+readme.x=10
+readme.y=10
+target1.height=50
+target1.name=Monster
+target1.showInterface=false
+target1.type=ClassTarget
+target1.width=80
+target1.x=350
+target1.y=174
+target2.height=50
+target2.name=Main
+target2.showInterface=false
+target2.type=ClassTarget
+target2.width=80
+target2.x=190
+target2.y=50
diff --git a/package.bluej b/package.bluej
index 84bdd62..1f0ae17 100644
--- a/package.bluej
+++ b/package.bluej
@@ -1,14 +1,14 @@
 #BlueJ package file
 editor.fx.0.height=739
 editor.fx.0.width=988
-editor.fx.0.x=210
-editor.fx.0.y=0
-objectbench.height=148
-objectbench.width=760
+editor.fx.0.x=290
+editor.fx.0.y=106
+objectbench.height=149
+objectbench.width=764
 package.divider.horizontal=0.6
-package.divider.vertical=0.69
-package.editor.height=338
-package.editor.width=670
+package.divider.vertical=0.6904761904761905
+package.editor.height=341
+package.editor.width=674
 package.editor.x=284
 package.editor.y=280
 package.frame.height=600