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

Jeff Nelson, a former Googler and inventor of Chromebook says on Quora, “One habit I've clung to is writing small prototypes when I'm trying to learn new concepts.
For example, I'll sit down with a book or a web page, and over the course of a few hours, write 30 or 40 programs all of them only a few dozen lines long.  Each program intended to demonstrate some simple concept. This prototyping makes it very easy to try out many concepts in a short period of time.”

Miguel Paraz, Software Engineering Student habit is to “keep a log in a text file or document on my work computer. Before trying to solve a problem, I write it down first. And then I describe the details as they happen.”

The original article was posted by Michael Veksler on Quora

A very well known fact is that code is written once, but it is read many times. This means that a good developer, in any language, writes understandable code. Writing understandable code is not always easy, and takes practice. The difficult part, is that you read what you have just written and it makes perfect sense to you, but a year later you curse the idiot who wrote that code, without realizing it was you.

The best way to learn how to write readable code, is to collaborate with others. Other people will spot badly written code, faster than the author. There are plenty of open source projects, which you can start working on and learn from more experienced programmers.

Readability is a tricky thing, and involves several aspects:

1. Never surprise the reader of your code, even if it will be you a year from now. For example, don’t call a function max() when sometimes it returns the minimum().
2. Be consistent, and use the same conventions throughout your code. Not only the same naming conventions, and the same indentation, but also the same semantics. If, for example, most of your functions return a negative value for failure and a positive for success, then avoid writing functions that return false on failure.
3. Write short functions, so that they fit your screen. I hate strict rules, since there are always exceptions, but from my experience you can almost always write functions short enough to fit your screen. Throughout my carrier I had only a few cases when writing short function was either impossible, or resulted in much worse code.
4. Use descriptive names, unless this is one of those standard names, such as i or it in a loop. Don’t make the name too long, on one hand, but don’t make it cryptic on the other.
5. Define function names by what they do, not by what they are used for or how they are implemented. If you name functions by what they do, then code will be much more readable, and much more reusable.
6. Avoid global state as much as you can. Global variables, and sometimes attributes in an object, are difficult to reason about. It is difficult to understand why such global state changes, when it does, and requires a lot of debugging.
7. As Donald Knuth wrote in one of his papers: “Early optimization is the root of all evil”. Meaning, write for readability first, optimize later.
8. The opposite of the previous rule: if you have an alternative which has similar readability, but lower complexity, use it. Also, if you have a polynomial alternative to your exponential algorithm (when N > 10), you should use that.

Use standard library whenever it makes your code shorter; don’t implement everything yourself. External libraries are more problematic, and are both good and bad. With external libraries, such as boost, you can save a lot of work. You should really learn boost, with the added benefit that the c++ standard gets more and more form boost. The negative with boost is that it changes over time, and code that works today may break tomorrow. Also, if you try to combine a third-party library, which uses a specific version of boost, it may break with your current version of boost. This does not happen often, but it may.

Don’t blindly use C++ standard library without understanding what it does - learn it. You look at std::vector::push_back() documentation at it tells you that its complexity is O(1), amortized. What does that mean? How does it work? What are benefits and what are the costs? Same with std::map, and with std::unordered_map. Knowing the difference between these two maps, you’d know when to use each one of them.

Never call new or delete directly, use std::make_unique and [cost c++]std::make_shared[/code] instead. Try to implement usique_ptr, shared_ptr, weak_ptr yourself, in order to understand what they actually do. People do dumb things with these types, since they don’t understand what these pointers are.

Every time you look at a new class or function, in boost or in std, ask yourself “why is it done this way and not another?”. It will help you understand trade-offs in software development, and will help you use the right tool for your job. Don’t be afraid to peek into the source of boost and the std, and try to understand how it works. It will not be easy, at first, but you will learn a lot.

Know what complexity is, and how to calculate it. Avoid exponential and cubic complexity, unless you know your N is very low, and will always stay low.

Learn data-structures and algorithms, and know them. Many people think that it is simply a wasted time, since all data-structures are implemented in standard libraries, but this is not as simple as that. By understanding data-structures, you’d find it easier to pick the right library. Also, believe it or now, after 25 years since I learned data-structures, I still use this knowledge. Half a year ago I had to implemented a hash table, since I needed fast serialization capability which the available libraries did not provide. Now I am writing some sort of interval-btree, since using std::map, for the same purpose, turned up to be very very slow, and the performance bottleneck of my code.

Notice that you can’t just find interval-btree on Wikipedia, or stack-overflow. The closest thing you can find is Interval tree, but it has some performance drawbacks. So how can you implement an interval-btree, unless you know what a btree is and what an interval-tree is? I strongly suggest, again, that you learn and remember data-structures.

These are the most important things, which will make you a better programmer. The other things will follow.

Big data is now in an incredibly important part of how many major businesses function. Data analysis, or the finding of facts from large volumes of data, helps businesses make many of their important decisions. Companies that conduct business on a national or international scale rely on big data in order to plot the general direction of their business. The concept of big data can be very confusing due to the sheer scale of information involved.  By following a few simple guidelines, even the layman can understand big data and its impacts on everyday life.

What Exactly is Big Data?

Just about everyone can understand the concept of data. Data is information, and information is everywhere in the modern world. Anytime you use any piece of technology you are making use of data. Anytime you read a book, skim the newspaper or listen to music you are also making use of data. Your brain interprets and organizes data constantly from your senses and your thoughts.

Big data, much like its name infers, simply describes this same data on a large sale. The internet allowed the streaming, sharing and collecting of data on a scale never before imaginable and storage technology has allowed ever increasing hoards of data to be accumulated. In order for something to be considered “big data” it must be at least 10 terabytes or more of information. To put that in perspective, consider that 10 terabytes represents the entire printed collection of material in the Library of Congress. What’s even more remarkable is that many businesses work with far more than the minimum 10 terabytes of data. UPS stores over 16 petabytes of data about its packages and customers. That’s 16,000 terabytes or the equivalent to 1,600 printed libraries of congress. The sheer amount of that data is nearly impossible for a human to comprehend, and analysis of this data is only possible with computers.

How do Big Data Companies Emerge?

All of this information comes from everywhere on the internet. The majority of the useful data includes customer information, search engine logs, and entries on social media networks to name a few. This data is constantly generated by the internet at insane rates. Specified computers and software programs are created and operated by big data companies that collect and sort this information. These programs and hardware are so sophisticated and so specialized that entire companies can be dedicated to analyzing this data and then selling it to other companies. The raw data is distilled down into manageable reports that company executives can make use of when handling business decisions.

The Top Five:

These are the five biggest companies, according to Forbes, in the business of selling either raw data reports or analytics programs that help companies to compile their own reports.

1. Splunk
Splunk is currently valued at $186 million.  It is essentially a program service that allows companies to turn their own raw data collections into usable information.

2. Opera Solutions
Opera Solutions is valued at $118 million. It serves as a data science service that helps other companies to manage the raw data that pertains to them. They can offer either direct consultation or cloud-based service.

3. Mu Sigma
Mu Sigma is valued at $114 million.  It is a slightly smaller version of Opera Solutions, offering essentially the same types of services.

4. Palantir
Palantir is valued at $78 million.  It offers data analysis software to companies so they can manage their own raw data analysis.

5. Cloudera
Cloudera is valued at $61 million.  It offers services, software and training specifically related to the Apahce Hadoop-based programs.

The software and services provided by these companies impact nearly all major businesses, industries and products. They impact what business offer, where they offer them and how they advertise them to consumers. Every advertisement, new store opening or creation of a new product is at least somewhat related to big data analysis. It is the directional force of modern business.

Sources:
http://www.sas.com/en_us/insights/big-data/what-is-big-data.html

http://www.forbes.com/sites/gilpress/2013/02/22/top-ten-big-data-pure-plays/

http://www.whatsabyte.com/

Related:

How does Google use Python?

Top Innovative Open Source Projects Making Waves in The Technology World

Is the U.S. the Leading Software Development Country?

How to Keep On Top Of the Latest Trends in Information Technology