To the Next Step! Leapfrog Online Acceptance and Side Projects

This post will be shorter but contains a great update:

Leapfrog Online has extended an offer to me as a Test Engineer which I have accepted!  The company focuses on driving marketing and customer support solutions based on customer behavior on client websites by utilizing integrated web systems and services.  The Test Engineer position works primarily in a Python environment using tools that test the unit, system, and function of these web systems and services.

By no means does this entail that this blog will falter or cease completely.  My intention is to continue to provide at-least weekly posts on the tools and environments I will be working in, along with insights and experiences in an entry-level test engineer position.

Outside of this exciting news employment news, I am also at the beginning stages of a potentially exciting side-project with two close friends.  More on that as (and if) it develops into a notable project.

In the short-term, I know I will be working to develop my understanding and experience with the following tools in my new position:

- git
- mechanize
- selenium
- virtualenv
- pip

These tools will undoubtably serve for plenty of fodder for my future blog posts.

Another Tongue-Twister: Regex-Directed Regular Expression Engine Greediness

Last post we discussed the eagerness of regular expression (regex) engines with respect to the "|" metacharacter.  Today we will look at another personification of the operation of regex engines, namely that of "greediness".

As a disclaimer, keep in mind that this post is covering regex-directed engines, not text-directed engines.

Regex-directed engines are "greedy" in that they will return the largest-possible regex match any given regex can afford the engine to return.  In other words, the engine is "greedy" to provide us with the largest-possible match that a regex provided.  The way this works out in practice, is that the right-most valid match for a token will be returned whenever greedy metacharacters are involved.  Take for example the regex

".+"

that is matched to the String 'I said, "Hello."  In return, she said "Hi!"'.  The returned match will be '"Hello." In return, she said "Hi!"', even though it would appear that the intention would have been to return either '"Hello."' or '"Hi!"'.  The engine was greedy to return the largest match the supplied regex could muster given the provided String, therefore, moving left-to-right, as soon as the engine found a proper match of the second """regex token, the engine attempted to go even farther along the String in order to find yet another """ match.  Only when the engine could not find another instance of """ in the String did it back-track in order to return the most recent (and greediest) match.

The above example is one of "repetition", or the use of the "+" character, informing the regex engine to match the preceding token one or more times.  The preceding token was the "." special character, which means "any character except \n".  Given this context, the "+" metacharacter will greedily match the largest String that is contained within two double-quote characters, including the double-quote characters.

Other repetition metacharacters include "*" and "?".  The "*" metacharacter informs the regex engine to match the preceding token zero or more times.  Notice the slight nuance between "*" and "+"; one will match zero or more times while the other will match one or more times, respectively.  Meanwhile the "?" metacharacter will match the preceding token one time or not at all.  While this is sometimes referred to as an optional character, it is technically still a form of repetition.  

There are a number of ways to defeat the greedy nature of "*", "+", and "?".

1. A "?" after a greedy metacharacter will override the greediness of the operator
1. ".+?" will evaluate ""Hello."" before returning the initial evaluation
2. Modify the token preceding the repetition metacharacter to be the negation of the intended stopping point
1. "[^"]+" will also evaluate as ""Hello""

We have now covered the eager and greedy metacharacters of regex-directed regular expression engines.  These personified characteristics of regex engines are important to keep in mind when a regex is matching too little or too much when eagerness and greediness, respectively, are concerned.

Regex-Directed Regular Expression Engine Eagerness (say that 5 times fast)

We may not typically think of our computer software as "eager", however the personification is very useful in understanding how regular expression (regex) engines process regular expressions (regexes).  For a very brief introduction to regex, see my previous post on the underpinnings of "$" and "^" metacharacters.

As a disclaimer, keep in mind that this post is covering regex-directed engines, not text-directed engines.

Regex-directed engines are "eager" in that they will return the first possible regex match any given regex can afford the engine to return.  In other words, the engine is "eager" to provide us with the first possible match that a regex provided.  The way this works out in practice, is that the left-most tokens in a regex that constitute a valid match will be returned before any other tokens of that regex are considered.  Take for example the regex

Ok|Okay

that is matched to the String "Okay".  The returned match will be "Ok", even though it would appear that the second token of the regex, Okay, would have been a better fit.  The engine was eager to match the regex to the provided String, therefore, moving left-to-right, as soon as the engine found a proper match of the regex token Ok with the first two letters of "Okay", the engine returned a match!

The above example is one of "alternation", or the use of the "|" character, informing the regex engine that one alternative or the other is an acceptable match for the regex.  In the case of alternation, there are two ways to protect against the engine being "overly eager" with your matches.

1. Order your alternatives in such a way that defeats the engines eager nature
1. Okay|Ok will evaluate "Okay" before ever evaluating "Ok"
2. Utilize the "optional item" metacharacter "?", with grouping as necessary
1. Ok(ay)? will first evaluate "Okay", and if it is not found, evaluate a match for "Ok" next.

As an important side-note with utilizing the alternation metacharacter, it is often helpful to consider that Strings outside of our alternatives may still match a given String.  For the above example, "Okaydokay" will still match "Okay".  To protect against this, it is useful to implement the word boundary operator, \b in such a way so as to protect our alternatives, such as: \bOk(ay)?\b

With eagerness covered, in my next post, I will turn my attention to another personification of regex-directed regular expression engines: greediness.

"^", "$" and Regular Expressions

My work in edX's Software as a Service (Saas) CS169.1x has required my investigation into Regular Expressions (regex or regexp for short).  Unfortunately the course does not cover regular expressions very extensively, so I have taken to the interwebs in order to grasp a deeper understanding of these finicky expressions.  My understanding is based off of the online resource regular-expressions.info.

First off, what is a regex? A regex is a pattern that describes a certain amount of text.  This pattern is formulated off of a series of rules and symbols that are an entire study unto itself.  At a basic level, a regex is composed of "tokens".  Each token describes the characteristics for a character or set of characters that are a subset (or the entirety) of the full text.  Regexes attempt to match a sequence of tokens to a set of text and returns the matches within the text, if any.

Tokens come in many shapes, sizes, and flavors that I will almost certainly touch base on in future blog posts.  Today I will be focusing on the "^" (or caret) and "$" tokens, or more specifically "special characters" or "metacharacters".

Although many are used to the "^" in the context of expressing exponents in mathematics (e.g. 10^2 representing ten to the second power), the "^" in the context of regex represents "before the first character of a string of text".  Therefore, given the string of text,

Hello, World!

the "^" position would be just before the "H".

Even more prevalent than the caret's contextual meaning in mathematics, the "$" is most commonly understood as the dollar-sign representation of money in text (e.g. $100.00).  However the "$" in the context of regex represents "after the last character of a string of text".  Again, visiting our string of text,

Hello, World!

the "$" position would be just after the "!".

To better understand how the regex engine is able to work on the text in this way, let us consider how a computer understands a string of text.  A string of text contains not only the characters in the text (e.g. the characters: "H","e","l","l","o"," ","W","o","r","l","d","!" from our previous example), but also include the INDEXES of those characters.

An index is an integer value representing the placement of any given character in a string.  For almost all computer languages, a string's starting point is the 0 index, and that index is before the first character.  The indexes then increment upwards from there (i.e. index 0, first character, then index 1, second character, the index 2, third character, and so on).  So a more accurate viewpoint to understand our example phrase, with the indexes included, is:

0H1e2l3l4o5,6 7W8o9r10l11d12!

 Given this understanding of the fundamental nature of strings of text as understood by a computer program, we can have a greater appreciation for what is happening as a regex is evaluating "^" and "$".  As we learned earlier, "^" refers to the position before the first character in a string of text.  We can understand the "^" of our example phrase as the zeroth index of the string.  Similarly, we can understand the "$", which refers to the position after the last character in a string of text, as the void index after the "!".

Let us now attempt to apply this understanding to evaluating regular expressions.  The regular expression ^H will attempt to match the character "H" at the beginning of a string of text.  Given the "Hello, World!" example string of text we have been working with, the regex ^H will match the "H" at the beginning of the string of text!  Alternatively, the regex ^e will attempt to match the character "e" at the beginning of a string of text.  Given our example, the regex will not return a match.  Although an "e" character exists in the string of text "Hello World!", the "e" is not found at the BEGINNING of the string.

We can apply this understanding similarly with the "$" metacharacter.  The regex !$ will attempt to match the character "!" at the end of a string of text.  Given the "Hello, World!" example string of text we have been working with, the regex !$ will match the "!" at the end of the string of text!  Alternatively, the regex d$ will attempt to match the character "d" a tthe end of the string of text.  Given our example, the regex will not return a match.  Although a "d" character exists in the string of text "Hello World!", the "d" is not found at the END of the string.

Many more thorough and overly verbose explanations of regular expression inner workings, special characters, and applications to follow.

Udacity Introduction to Java Programming Complete: Complete Cheat Sheet

Yesterday I completed Udacity's Introduction to Programming course, which had a specific focus on the Java language.  Throughout the course, I kept notes for very specific concepts and language keywords that I believed would assist me on key understanding and on the completion of course assignments.  The below is a transcript of those notes as a reference and cheat sheet.

NOTE: These are my definitions and understanding.  My understanding may not be completely correct or complete.

Class - a set of objects that have the same properties
Object - a data structure with defined variables and methods
Variable - a defined data instance
Declaration - the initialization of a variable
Assignment - the process of declaring or changing a variable's value
Constructor - a specific method used when initializing a new object from a Class
Accessor - a method that leaves an object's variables unchanged
Mutator - a method that changes an object's variables
private - a method or variable accessible by the object only
public - a method or variable accessible through interfacing with the object
Instance Variable - the variables within each instance of an object
this - an undeclared variable reference to an object
Local Variable - the variables declared within the body of a method
final - used to define constants
Scanner: - a predefined class within Java, requires the import java.util.scanner;statement
               - declaration: Scanner var = new Scanner(System.in);
               - example method: int i = var.nextInt() //returns the next int input by user
               - double d = var.nextDouble() //returns the next double input by user
Sentinel Value - a value that is intended to terminate a user input loop (i.e. "-1" or "done")
NaN - "Not A Number", i.e. an undefined result sometimes thrown at runtime
Double.MIN_VALUE - the smallest positive number a double can represent
-Double.MAX_VALUE - the largest (vector) negative number a double can represent
Reading From Files: - File declaration: File inputFile = new File("input.txt");
                                 - Scanner declaration: Scanner in = new Scanner(inputFile);
ArrayLists: - declaration: ArrayList<TYPE> varName = new ArrayList<TYPE>();
                   - example method: varName.add(varPointingToTYPE);
                   - example method: varName.set(index,varPointingToTYPE);
                   - example method: TYPE foo = varName.get(index);
                   - example method: int size = varName.size();
                   - example method: TYPE foo = varName.remove(index);
                   - for loop on each object in ArrayList: for (TYPE foo : varName) {...}
Properties - instance variables that have get/set methods
Static Methods: - a method that is not called on any object
                         - Class definition:

public class Foo
{
     public static int addition (int a, int b)
         {
              return a+b;
         }
}

                         - call: Foo.addition(int1,int2); //requires Foo Class to be imported in file
Static Variables: - a variable that is not called on any object, used best for constants
                           - Class definition:

public class Foo {     public static final int ONE = 1; }

                           - variable call: int a = Foo.ONE; //requires Foo Class be imported in file
Coupling: - the concept that one Class's compilation and execution is dependent upon another Class
                 - example: Class A is coupled to Class B if Class A instantiates an instance of Class B
Interface Type: - a type of structure that specifies behavior for any Class that implements it
                         - declaration: public interface Drawable { void draw(); }
                         - implementation:

public class Picture implements Drawable{     //Constructor...
     public void draw() {...} //MUST implement draw method from Drawable}

                          - use case: if Picture and Class Photo both implement Drawable, then
ArrayList<Drawable> elements = new ArrayList<Drawable>();
element.add(new Picture());
element.add(new Photo());
for (Drawable obj : elements) { obj.draw(); }
Polymorphism - the Object Oriented Programming concept that a single method call on a generic object variable can handle many different Object types (i.e. interfaces)
Encapsulation - the Object Oriented Programming concept that objects can inherit variables and methods from parent Classes
instanceof: - keyword to determine if an element is an instance of a given Class
                  - example: if (stringVar instanceof String) {..} else {...}
Inheritance: - a Class may extend the behavior of only one parent class
                   - Example:

public class Mammal
{
    private String name;
    public Mammal ()
    {
         name = "";
    }
}
public class Dog extends Mammal
{
    private int legs;
    public Dog ()
    {
         super();
         legs = 0;
    }
}

Superclass - the parent of a Class (e.g. Mammal is Dog's superclass)
Subclass - the child of a Class (e.g. Dog is Mammal's subclass)
Overloading - when two or more methods have the same name but different parameter types
Overriding - when a subclass has a different implementation of a method that is also in its superclass

Approach to Understanding Legal vs Illegal Class-Type Variable Assignments to Subclasses and Superclasses

Whew, what a jargon-filled post title!

Before getting started in this post, let us understand the post title in greater detail so that we are all on the same page:

Approach to Understanding Legal vs Illegal Class-Type Variable Assignments to Subclasses and Superclasses

Focusing on "Class-Type Variable Assignments": this is the assignment of a variable that is of some object-type defined by a class, i.e.

Foo foo1 = new Foo();

In the above code segment, the variable foo1 is defined as having Class-type Foo and is assigned a new object instance of Class-type Foo. 

Moving back to the post title, we will now focus on the idea of "Class-Type Variable Assignments" -that we just covered- "to Subclasses and Superclasses".  To understand this, let's focus again on our example:


Foo foo1 = new Foo();

Here our Class-type variable (which is of type Foo) matches the instance assigned to it (again, it is of type Foo).  Since the Class-type variable and the instance share the same Class, as opposed to subclass or superclass to one-another, let's consider a different example.  In the following example, assume that Class Dog is a subclass of Class Mammal.

Mammal animal1 = new Dog();

In the above example, we see that the Class-type variable animal1 of type Mammal is being assigned to an instance of the Dog Class, which is a subclass of Mammal (i.e. Mammal is the superclass of Dog).  This happens to be a legal assignment, but I am getting ahead of myself.  Consider the converse example:

Dog animal2 = new Mammal();

In the above example, we see that the Class-type variable animal2 of type Dog is being assigned to an instance of the Mammal Class, which is a superclass of Dog.  This happens to be an illegal assignment, but again I am getting ahead of myself.  The take-away at this point we should now understand what is meant by "Class-Type Variable Assignments to Subclasses and Superclasses".

As already noted, some of these assignments are legal, and some are illegal.  Therefore, putting it all together, this post is intended to explain my approach to understanding which of these assignments are legal and which are illegal.  After that verbose intro, let's get started!


In order to explain my approach, we'll keep with my previous example of Dog and Mammal: Class Mammal is a superclass of Dog, i.e. Class Dog extends Mammal, i.e. Dog is a subclass of Mammal.

Given this hierarchy of inheretance, I was able to come up with the following approach that makes a lot of sense to me, and can hopefully assist others:

• When creating an instance of the Mammal class, the resultant Object knows everything there is to know about being a Mammal and expects to point to one.
• When creating an instance of the Dog class, the resultant Object knows everything there is to know about being a Dog AND a Mammal and expects to point to both.
• This behavior is due to the Dog being a subclass of the Mammal Class (Dog extends Mammal)

Keeping these ideas in mind,

Given:
Mammal animal1 = new Mammal();
Dog animal2 = new Dog();

consider the following cases:

• animal1 = animal2;
• animal2 = animal1;
• animal2 = new Mammal();
• animal1 = new Dog();

Case: animal1 = animal2;

Here, we are assigning a Dog (animal2) to a Mammal (animal1), i.e. we are pointing the Mammal to an object that knows everything there is to know about being a Mammal AND a Dog. For animal1, it is satisfied because its expectation to point to a Mammal is fulfilled! Therefore, the operation is legal.

Case: animal2 = animal1;

Here, we are assigning a Mammal to a Dog, i.e. we are pointing the Dog to an object that knows everything there is to know about being a Mammal ONLY. For animal2, it is unsatisfied because its expectation to point to a Mammal AND a Dog is unfulfilled! Therefore, the operation is illegal.

Case: animal2 = new Mammal();

Here, we are assigning a Mammal to a Dog, i.e. we are pointing the Dog to an object that knows everything there is to know about being a Mammal ONLY. For animal2, it is unsatisfied because its expectation to point to a Mammal AND a Dog is unfulfilled! Therefore, the operation is illegal.

Case: animal1 = new Dog();

Here, we are assigning a Dog to a Mammal, i.e. we are pointing the Mammal to an object that knows everything there is to know about being a Mammal AND a Dog. For animal1, it is satisfied because its expectation to point to a Mammal is fulfilled! Therefore, the operation is legal.

In Summary:

To ensure a variable assignment to an instance of a Class is legal, ensure the Class-type of the variable is of the same Class or some superclass of the instance's Class.

An exception to this rule is in the case of the Class-type being an Interface, in which assignment legality is a function of whether or not the instance Class implements the given Interface.

Building Classes from Scratch Based on Known Inputs and Desired Outputs

Today I had the privilege to undertake a challenge on Udacity.com's Introduction to Programming course that was extremely well designed to put my knowledge and abilities of Classes to the test.  The challenge was optional, however I was determined to stretch my knowledge in order to deepen my understanding, as well as intuit ways to solve OOD problems.

The problem was loosely stated as follows:

The program would take in as input a "story" of a photography company's business processes.  Namely, these processes consisted of:

• Hiring new photographers
• Taking in new assignments from clients
• Allocating photographers for each assignment
• Reviewing the portfolio of the company's work

The "story" took on the format as follows:

Photographer Danny //hire a new photographer named "Danny"

Photographer Leslie

5 a parrot //top priority assignment to take a photo of a parrot

2 a waterfall

4 a mountain

3 Paris

GiveOutAssignments //assign each photographer with 1 assignment, 

4 a pony           //top priority first

GiveOutAssignments

GiveOutAssignments

1 the forest

2 a flower shop

GiveOutAssignments

3 a butterfly

4 a sprout in the rain

GiveOutAssignments //after the last line, review portfolio

Udacity gave some "cheat" code that read in the file, parsed, and provided the following information:

• For "hire new photographer" lines, the following code is executed:
• manager.hire(photographer)
• i.e. the "hire" method is called on an instance of the Manager Class passing the parameter "photographer" of type String
• For "new assignment" lines, the following code is executed:
• manager.newAssignment(priority, description)
• i.e. the "newAssignment" method is called on an instance of the Manager Class passing the parameters "priority" of type int and "description" of type String
• For "give out assignments" lines, the following code is executed:
• manager.giveOutAssignments()
• i.e. the "giveOutAssignments" method is called on an instance of the Manager Class
• When the end of the "story" file is reached, the following code is executed:
• manager.reviewPortfolio()
• i.e. the "reviewPortfolio" method is called on an instance of the Manager Class

Other than the code necessary to parse the file and call methods of an instance of Manager "manager" which was contained within a Class called Simulation which contained the "main" method, the construction of the rest of the solution was left up to the students.

My approach can be summarized as follows:

1. Determine the tasks involved in the solution
2. Flesh out the inner-workings of those tasks
1. Determine other Classes that could assist in the solution
2. Determine instance variables that would also be necessary
3. Loosely consider the public methods that would be required to exchange information between classes
3. Start writing methods for each task
1. Write accessor methods to other Classes as if those methods already existed
2. Keep a list of accessor methods required to implement in other Classes.
4. Debug
5. Test

In detail, my method went as follows:

1) Determine the tasks involved in the solution:

• hire photographer
• create assignments
• give out assignments
• display portfolio

Already I had a keen sense that I would require the following helper Classes at minimum:

• Photographer (would contain the photographer's name, "take pictures")
• Assignment (would contain the assignment's priority, along with description)
• Portfolio (would contain the pictures taken by all photographers)

2) Flesh out the inner-workings of those tasks:

Hire photographer:

• needs to create a new Photographer object (pass String "name" to Photographer's Constructor
• Manager Class would contain an ArrayList of Photographers, add() Photographer
• Photographer Class would have a Constructor that passes the "name" to the Photographer object

Create Assignments:

• needs to create a new Assignment object (pass int "priority" and String "description to Assignment's Constructor)
• Manager Class would contain an ArrayList of Assignments, add() Assignment
• Assignment Class would have a Constructor that passes the "priority" and "description" to the Assignment object
• In order to ease the "pain" of keeping track of where the highest priority Assignments are in the assignments ArrayList, each new Assignment will be added by descending priority

Give out assignments:

• For each Photographer, give out the next highest priority Assignment (first item in sorted ArrayList)
• Do this by calling Photographer's "take photo" method
• Pass photo to Portfolio, along with the photographer's name

Display portfolio:

• Call the portfolio's draw method

At this point I got a sense that the Portfolio Class would contain an ArrayList of Pictures.  More specifically, I would want those Pictures to have the photographer's name displayed along with the picture.  From this, I gleaned that I would require another Class I would dub FinishedPhoto, which would contain both a Picture and Text object containing the photo and the photographer's name, respectively.

3. Start writing methods for each task:

As already included in the summary, I went about this by first constructing the various Constructors of my Manager and helper Classes, followed by fleshing out the methods of the Manager class.  I kept my perspective completely locked on the Manager Class while writing Manager methods, assuming I had complete access to the other helper classes via methods that I assumed were already fully implemented. 

After completing each Manager method, I would review the code to determine which public methods I needed to write for my various helper methods which I wrote on a piece of paper.  After writing all of those down, I switched my focus over to the helper Classes and wrote the methods that the Manager Class would need for the Manager methods, fleshing out instance variables as needed along the way.

Rinse and repeat until I implemented all of the Manager Class methods, along with the corresponding helper Class methods.  I made some anticipated syntax mistakes that threw the compiler for a loop, however I was very pleased when the test case passed on the first try!  See my completed code here.

Refactoring: Variable Renaming Approach and Methods

Recently I watched a segment from Udacity.com's Introduction to Programming course that focused on the software development term "refactoring".  Refactoring is the process of updating existing code in order to make that code more efficient, more readable, more compatible with new technologies, and many more reasons.  This concept was also recently addressed at a Geekfest meetup by Chris Powers on the refactoring of Javascript (Speaker Deck slides available here).

As an introduction to this concept, let's consider the following code:

String[] array = {Joe, Sam, Dave, Charley};
int end = array.length;
for (int i = 0, i < end; i++)
{
    array[i] = "Mr. " + array[i];
}

From reading this code, we come to the understanding that an array of String objects are each concatenated with the String "Mr. ".  Although that is fairly clear, our variable names do not help a programmer understand the object's purpose (i.e. "array", although good at describing that the object is an array, does not do very well to expound on the fact that this is an array of String objects, much less that the String objects are all names of (presumably) men.  We therefore have a good opportunity to refactor this code in order to rename more sensical variables.

From Udacity's course, there are a couple of approaches to refactoring variable names.

• Create test cases with expected results prior to refactoring code
• Fully implement refactored variable names BEFORE removing any current code

Creating test cases for the above code is fairly simple:

for (String name : array)
{
    System.out.print(name + ", ");
}
println();
System.out.println("Expected result: Mr. Joe, Mr. Sam, Mr. Dave, Mr. Charley");
The above code will suffice in printing the contents of array after the for loop completes execution.  Now we are ready to refactor the code.

Per the above example, we would like to rename "array" to a more appropriate name that will denote that the contents of the variable.  Therefore, instead of

String[] array = {Joe, Sam, Dave, Charley);

the more descriptive

String[] arrayOfMaleNames = {Joe, Sam, Dave, Charley);

will be more readable for future programmers who come upon this code.  Before removing the old representation of array, per Udacity's approach and method, we should find all representations of array throughout the current code prior to removing.  Therefore, we get

 String[] array = {Joe, Sam, Dave, Charley};
 String[] arrayOfMaleNames = {Joe, Sam, Dave, Charley};
int end = array.length;
int end = arrayOfMaleNames.length;
for (int i = 0, i < end; i++)
{
    array[i] = "Mr. " + array[i];
    arrayOfMaleNames[i] = "Mr. " + arrayOfMaleNames[i];
}

This modification must also be made to our tester


for (String name : array)
for (String name : arrayOfMaleNames)
{
    System.out.print(name + ", ");
}
println();
System.out.println("Expected result: Mr. Joe, Mr. Sam, Mr. Dave, Mr. Charley");

Now that the modification has is ubiquitous, we are ready to remove all instances of array, yielding:


//Main code
String[] arrayOfMaleNames = {Joe, Sam, Dave, Charley};
int end = arrayOfMaleNames.length;
for (int i = 0, i < end; i++)
{
    arrayOfMaleNames[i] = "Mr. " + arrayOfMaleNames[i];
}


//tester
for (String name : arrayOfMaleNames)
{
    System.out.print(name + ", ");
}
println();
System.out.println("Expected result: Mr. Joe, Mr. Sam, Mr. Dave, Mr. Charley");

Next, we will modify the for loop.  Because all indexes in the array will be accessed, there is no use in creating a separate index to go through all of the array values.  This would be a different case if the array had been instantiated with, say, 100 indexes of which only the first 4 were utilized.  Instead, since the array is fully implemented with the four strings "Joe, Sam, Dave, Charley" for the array's four indexes, we are ok implementing the for loop as follows:

int end = arrayOfMaleNames.length;
for (int i = 0, i < end; i++)
{
    arrayOfMaleNames[i] = "Mr. " + arrayOfMaleNames[i];
}
for (String name : arrayOfMaleNames)
{
    name = "Mr. " + name;
}

After writing the refactored for loop we are ready to remove the old code, yielding:

//Main code
String[] arrayOfMaleNames = {Joe, Sam, Dave, Charley};
for (String name : arrayOfMaleNames)
{
    name = "Mr. " + name;
}


//tester
for (String name : arrayOfMaleNames)
{
    System.out.print(name + ", ");
}
println();
System.out.println("Expected result: Mr. Joe, Mr. Sam, Mr. Dave, Mr. Charley");

Finally, we still have a 'magic' String "Mr. " to deal with.  This is considered a 'magic' String, or object in general, because there is no precedence for why this particular String was chosen, and if it exists in several places throughout the code, it could be very tedious to replace (what if instead of "Mr. " we wanted to implement "Dr. " for example?).  It is better to declare this value in a separate variable, then replace the 'magic' String with that variable.  After writing our refactored code:


String[] arrayOfMaleNames = {Joe, Sam, Dave, Charley};
String abbreviation = "Mr. ";
for (String name : arrayOfMaleNames)
{
    name = "Mr. " + name;
    name = abbreviation + name;
}

Removing the old code yields:


//Main code
String[] arrayOfMaleNames = {Joe, Sam, Dave, Charley};
String abbreviation = "Mr. ";
for (String name : arrayOfMaleNames)
{
    name = abbreviation + name;
}


//tester
for (String name : arrayOfMaleNames)
{
    System.out.print(name + ", ");
}
println();
System.out.println("Expected result: Mr. Joe, Mr. Sam, Mr. Dave, Mr. Charley");

After comparing the test result prior to refactoring to the result after refactoring, we see that the results are the same, and our refactoring is complete (for now)!

Novel Approach to Nested Loops

Yesterday my Udacity.com Introduction to Programming course introduced the following nested loop problem:

Write a nested-loop that creates a triangle pattern based on the number of rows input by the user such that the nth row has n ASCII-art boxes.
Examples: 

 if n = 1
[]
if n = 3
[]
[][]
[][][]
if n = 8
[]
[][]
[][][]
[][][][]
[][][][][]
[][][][][][]
[][][][][][][]
[][][][][][][][]

My initial approach to this problem was that it would be fairly easy to keep track of each row, however the number of "[]" would be less simple to track due to their inflating nature by row.  Since the number of "[]" per row would be dependent upon row number, I chose to implement a while loop that compared some integer i counting up from 0 until it reached the given row as dictated by a for loop, seen below:

for (int row = 1; row <= userInput; row++)
{
    int i = 1;
    while (i <= row)
    {
        System.out.print("[]");
    }
    System.out.println();
}

While the above code works, the solution provided by the professor took me as more elegant, and the approach the professor used was far more intuitive as well.  The summary of the approach is as follows:

1. Determine the for loop solution to writing the first row of "[]"
2. Determine the for loop solution to writing the second row of "[]"
3. Intuit from the similarity/dissimilarity of the for loops from 1 & 2 the nested for loop solution
4. Write the code necessary for the final solution

The above approach applies to the stated triangle pattern problem as follows:

1. for (int i = 1; i <= 1; i++) { System.out.print("[]") } //code necessary to print row 1
2. for (int i = 1; i <= 2; i++) { System.out.print("[]") } //code necessary to print row 2
3. The only difference between 1 & 2 is the comparison expression of the for loop.  The intuition is that the non-i value of the comparison expression can be replaced by the row value.  Therefore the solution involves replacing the comparison terminating value with row and nesting the above loop in another for loop that steps through all of the possible values of row.
4.  

for (int row = 1; row <= userInput; row++)

{

    for (int i=1; i <= row; i++)

    {

        System.out.print("[]");

    }

    System.out.println();

}

I am certain this approach will provide a more cohesive and logical approach to determining correct and efficient nested for loop solutions in the future.

Day 0: Checking in, Status

"Today is the first day of the rest of your life..."

As an EE with a specialization in digital design, I was somewhat familiar with the principals of programming on a very small sense given that HDLs like VHDL and Verilog were part of my college curriculum.  However nothing could have prepared me for the enjoyment I would soon experience as I entered my first role out of college with Cisco Systems as an ASIC Design and Verification engineer.  Although my old friend Verilog was there with me at the onset, part of my role had me verifying my colleagues and my own work with a proprietary C++ environment.  This was my first taste of programming in a purer form, and one in which I became increasingly interested in developing my skills and abilities.

This interest took a three year hiatus as I moved to Columbus, Ohio to pursue my now-wife, Emily.  As thrilling and enriching an experience as that was, my employment over that period focused purely on hardware development in my new role at Honda Research & Development.  When my wife landed a great opportunity in her career as a dentist in Chicago, IL, I knew that my opportunity to delve deeply into the world of CS and programming had finally come.

So here I am today!

No longer working for Honda Research and Development, I will be devoting myself fully to my self initialized and led education into the world of programming and development with the final goal to master the skills and arts necessary to the extent necessary to land a role in the blooming tech-scene of Chicago.

What I have done so far:

• Initialized classwork on Udacity.com
• Introduction to CS (~45% complete)
• Introduction to Programming (~65% complete)
• Algorithms (~10% complete)
• Begun networking in Chicago
• Attended TechWeek Chicago 2013
• Attended Udacity.com 2nd Annual Global Meetup
• Combed the work opportunities in Chicago
• Learned the various technologies implemented by companies in Chicago
• ASP.NET
• Mobile Technologies
• Java
• Front-end (HTML, CSS, JavaScript)
• C#
• Learned the location of technology companies around Chicago

What I have planned to do:

• Continue Udacity.com coursework
• Complete Introduction to CS
• Complete Introduction to Programming
• Complete Algorithms
• Start Software Testing
• Start Software Debugging
• Start Programming Languages
• Start Web Development
• Start Introduction to Theoretical Computer Science
• Start "Hello, Android!"
• A re-start of sorts, get through the book "Hello, Android!"
• Start "Chooser" Android App
• Flesh out the idea for "Chooser"
• Develop the application for Android utilizing the knowledge learned from "Hello, Android!"
• Determine if it is possible to publish the app
• If possible to publish: publish, then learn how to roll out an application update

This will be an interesting adventure, and I am glad to have the opportunity to be on it!

Twitter: @shiggiddie
Google Calendar: sean.dennison.osu@gmail.com