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 */

With an ever increasing rise in the use of employment testing, certification testing and need to get a degree, I thought I would write this basic guide on how to study for exams.  Although it was originally written with the college student in mind, the fundamentals still apply to all of us in the workforce.

There are few things that strike terror into the hearts of students more than exam day, particularly if they have inadequate study skills. Perhaps these students study for hours and hours, only to discover that by exam time they've forgotten everything they've read. Below are a few study tips to help struggling students remember the information they've reviewed for their exams. 

-Use memory tricks. There are a number of memory tricks that you can use to help you remember large amounts of information. For example, the use of acronyms (such as Roy G Biv to remember the colors of the rainbow) can be very helpful. In addition, you can use visualization techniques, similes, and songs to assist you in recalling your study material.

-Don't cram. Your brain requires time to absorb facts. If you know about a test in advance, start studying right away for a little bit every day, ramping up your efforts as the exam approaches.

-Take frequent breaks while studying. It may seem counter-intuitive that spending less time studying might actually help you remember more of what you've read. But taking appropriately timed study breaks will keep your mind fresh and make sure you don't stress too much.

-Write it out. For many people, writing information down as they read it is the best way to learn it. Don't just write exactly what you read, however; by rewording the information or even drawing a picture or diagram you commit it to your memory in more than one way, allowing you to remember it easier later.

-Teach it to a friend. To remember information, you have to understand it. And in order to teach information, you need to understand it as well. Nothing tests your ability to recall facts better than teaching them to another person. Find a friend unfamiliar with your study material and teach them a lesson in the subject.

-Get plenty of sleep the night before the exam. Finally, be sure to get a good night's rest the night before you take the exam. Falling asleep at your desk will accomplish nothing. This will help you be more alert while you are taking your test, and will allow you to retain more information.

 

In Python, the following list is considered False:

False, None, 0, 0.0, "",'',(),{},[]

In May 2012 Google Chrome hit a milestone. It kicked Microsoft's Internet Explorer into excess phone oh that oh that second place as the most used browser on planet Earth.
With Microsoft being in second place, it makes a dark hole for Firefox coming in at number three. Google likes to trumpet three key reasons: security, simplicity and speed.
Available for free on Android, Linux, Mac, and Windows. It gets its speed from the open source JavaScript engine written in C++ known as V8.
In my daily use I use Microsoft's Internet Explorer version 10, Apple's Safari (on OS X) and chrome on both Windows 8 and OS X.

Admittedly people do not know anything about Internet Explorer version 10 since you can only get it on Windows 8/RT.

I do not need a crystal ball to know that the Mother of All Browser Battles is set to begin in the fall of 2012 and beyond.

I have said this before and I'm going to say it again.