There are a lot of articles you will find on the internet that talk about the tenants of having a successful professional career. From soft-skills to job relevant skills, there is an unending list of the do’s and don’ts for establishing a great career. However, a successful career in information technology commands some specific efforts and focus. As a result, it is critical to focus on these 4 key tenants that can help you establish a promising and successful career in Information Technology.

·         Be Multi-lingual– This is the analogy of Steve Job’s famous quote ‘Stay Hungry, Stay Foolish’ as it applies to Information Technology. Gone are the days when you could train yourself on a specific programming language say Java or C++ and code your way to a successful career. The best programmers of today and tomorrow are pushing the limits and becoming experts in one of more languages. Knowing more than one programming language instantly makes you more employable since you can add value to multiple projects that require different languages. If you need proof, IT professionals knowing more than one language can attract a salary premium of £10,000 . Additionally, there is no telling how dynamic technology is and by being open to constantly learning new languages you will position yourself to get technology jobs that did not exist a few years ago

·         Go Beyond the ‘How’, Focus On ‘Why’: A common theme with most information technology professionals is their ability to figure out the HOW or, in other words, applying their technical know-how in achieving the solution to a problem. This is especially true when you are working for a service based IT organization where your key job is to develop a solution for the client’s business problem. Yes, you are and will get paid to be good at the ‘How’ but to advance a career in IT; it will help you immensely to also start focussing on the ‘Why’. This stems from a famous quote by Einsten “If I were given one hour to save the planet, I would spend 59 minutes defining the problem and one minute resolving it”. In essence, spend time in understanding ‘Why’ are your trying to solve the problem before you get down with figuring out the ‘How’ part. The reasons for developing this mindset are two-fold. One, you will instantly distinguish yourself from thousands of other IT peers who are content with the ‘How’ part. Two, there is a good chance that you want to get ahead in your career not only as a programmer but as a system architect or a business solution consultant. This is where the habit of asking the right questions pertaining to why a certain IT solution is requires will help you build the right solution.

·         Focus on the impact and results (Financial impact):This may not apply to IT professionals who are early in their careers but is paramount for senior IT professionals. For the most part, IT departments are required to make sure that the systems and the solutions function as desired and help the business run efficiently. In other words, the key metric for success for most IT professionals is being extremely good at technology, languages and Quality Assurance. However, the times are changing! No longer is the Chief Information Officer (CIO) in charge of making IT decisions. With organizations closely guarding the ROI of their investment in technology, CIOs are increasingly required to be cognizant of the financial benefits of technology so that they can justify the spending on IT. No wonder than that CFOs are increasingly pressurizing CIOs to get their act together

It’s befuddling when you think about how many ways there are to communicate in 2013. I’d say there are too many new ways to communicate – social media, phone, Skype, instant message, text message, email, it goes on and on. But do any of them outweigh the power of a good old-fashioned face-to-face meeting? Most business executives would argue no. Nothing can replace a face-to-face meeting, at least yet.

That said, face-to-face meetings are without question the most expensive kind, given the travel costs required to make them a reality, and companies around the globe have been trying to make them more financially manageable ever since the recession set in. But recession or no, face-to-face meetings are rarely in the budget cards for small businesses. So how can entrepreneurs around the globe get more out of their virtual meetings while ensuring any physical meeting is worth the cost?

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

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.