I will begin our blog on Java Tutorial with an incredibly important aspect of java development:  memory management.  The importance of this topic should not be minimized as an application's performance and footprint size are at stake.

From the outset, the Java Virtual Machine (JVM) manages memory via a mechanism known as Garbage Collection (GC).  The Garbage collector

• Manages the heap memory.   All obects are stored on the heap; therefore, all objects are managed.  The keyword, new, allocates the requisite memory to instantiate an object and places the newly allocated memory on the heap.  This object is marked as live until it is no longer being reference.
• Deallocates or reclaims those objects that are no longer being referened. 
• Traditionally, employs a Mark and Sweep algorithm.  In the mark phase, the collector identifies which objects are still alive.  The sweep phase identifies objects that are no longer alive.
• Deallocates the memory of objects that are not marked as live.
• Is automatically run by the JVM and not explicitely called by the Java developer.  Unlike languages such as C++, the Java developer has no explict control over memory management.
• Does not manage the stack.  Local primitive types and local object references are not managed by the GC.

So if the Java developer has no control over memory management, why even worry about the GC?  It turns out that memory management is an integral part of an application's performance, all things being equal.  The more memory that is required for the application to run, the greater the likelihood that computational efficiency suffers. To that end, the developer has to take into account the amount of memory being allocated when writing code.  This translates into the amount of heap memory being consumed.

Memory is split into two types:  stack and heap.  Stack memory is memory set aside for a thread of execution e.g. a function.  When a function is called, a block of memory is reserved for those variables local to the function, provided that they are either a type of Java primitive or an object reference.  Upon runtime completion of the function call, the reserved memory block is now available for the next thread of execution.  Heap memory, on the otherhand, is dynamically allocated.  That is, there is no set pattern for allocating or deallocating this memory.  Therefore, keeping track or managing this type of memory is a complicated process. In Java, such memory is allocated when instantiating an object:

String s = new String();  // new operator being employed
String m = "A String";    /* object instantiated by the JVM and then being set to a value.  The JVM
calls the new operator */

If you're someone who's interested in computer programming, chances are you've considered pursuing a career in it. However, being a computer programmer is definitely not for everyone, as it takes some special characteristics to succeed as a computer programmer.

Good at Math

While you don't have to be a math genius in order to be a good computer programmer, being good at math really does help. In general, as long as you know your trigonometry and advanced high school algebra, you should be set for programming.

However, in a few instances, knowledge of more advanced math ends up being necessary. For example, for shader programming, you should be familiar with integration of multiple variables, matrix algebra, and basic differentiation. You will also require considerable math skills in order to program 3D.

Excellent Problem Solver

To be a successful computer programmer, you definitely need to be an excellent problem solver. It is vital for a computer programmer to break a problem down into small parts. They must then be able to decide the best way to approach individual pieces of the problem. Computer programmers also need to know how to anticipate and prevent potential problems. While problem-solving, they also need to keep in mind things like user experience and performance.

If you're not a good problem solver, knowing a particular language and syntax will be useless if you can't even identify the problem at hand. Therefore, excellent problem solving skills are a critical foundation for computer programming.

Patience

If you are not a patient person, you will quickly become very frustrated with computer programming. Problem-solving is not always easy and fast. In fact, it may take a very long time, especially if you're either inexperienced or working on an especially hard project.

Debugging after the coding process is also very frustrating and tedious. No matter how hard you try, you will always have bugs in your coding, and these bugs, while often easy to fix, tend to be very difficult to detect. Therefore, you will end up spending a lot of your time searching for bugs that take very little time to fix.

Well-Rounded Skills

Generally, computer programmers who are very skilled in one area tend to stick around longer than jack-of-all-trades, as specialized programmers are harder to replace with outsourcing than general programmers. Therefore, it will do you well to specialize in one area of computer programming.

However, while specializing is good, you should still know at least a little about everything, especially skills that relate to the area you specialize in. For example, if you're a core Java programmer, you should know about SQL programming and ideally a scripting language or some regular expressions.

As you can see, not everyone has what it takes to pursue computer programming as a career and succeed at it. In fact, just because you love to program doesn't mean it's a good career choice for you. However, if you feel that you possess all the characteristics listed above, then you should definitely consider computer programming as a career.

Python and Ruby, each with roots going back into the 1990s, are two of the most popular interpreted programming languages today. Ruby is most widely known as the language in which the ubiquitous Ruby on Rails web application framework is written, but it also has legions of fans that use it for things that have nothing to do with the web. Python is a big hit in the numerical and scientific computing communities at the present time, rapidly displacing such longtime stalwarts as R when it comes to these applications. It too, however, is also put to a myriad of other uses, and the two languages probably vie for the title when it comes to how flexible their users find them.

A Matter of Personality...

That isn't to say that there aren't some major, immediately noticeable, differences between the two programming tongues. Ruby is famous for its flexibility and eagerness to please; it is seen by many as a cleaned-up continuation of Perl's "Do What I Mean" philosophy, whereby the interpreter does its best to figure out the meaning of evening non-canonical syntactic constructs. In fact, the language's creator, Yukihiro Matsumoto, chose his brainchild's name in homage to that earlier language's gemstone-inspired moniker.

Python, on the other hand, takes a very different tact. In a famous Python Enhancement Proposal called "The Zen of Python," longtime Pythonista Tim Peters declared it to be preferable that there should only be a single obvious way to do anything. Python enthusiasts and programmers, then, generally prize unanimity of style over syntactic flexibility compared to those who choose Ruby, and this shows in the code they create. Even Python's whitespace-sensitive parsing has a feel of lending clarity through syntactical enforcement that is very much at odds with the much fuzzier style of typical Ruby code.

For example, Python's much-admired list comprehension feature serves as the most obvious way to build up certain kinds of lists according to initial conditions:

a = [x**3 for x in range(10,20)]
b = [y for y in a if y % 2 == 0]

first builds up a list of the cubes of all of the numbers between 10 and 19 (yes, 19), assigning the result to 'a'. A second list of those elements in 'a' which are even is then stored in 'b'. One natural way to do this in Ruby is probably:

a = (10..19).map {|x| x ** 3}
b = a.select {|y| y.even?}

but there are a number of obvious alternatives, such as:

a = (10..19).collect do |x|
x ** 3
end

b = a.find_all do |y|
y % 2 == 0
end

It tends to be a little easier to come up with equally viable, but syntactically distinct, solutions in Ruby compared to Python, even for relatively simple tasks like the above. That is not to say that Ruby is a messy language, either; it is merely that it is somewhat freer and more forgiving than Python is, and many consider Python's relative purity in this regard a real advantage when it comes to writing clear, easily understandable code.

And Somewhat One of Performance