1. The IRS is enabling taxpayers to download their tax transcripts over the internet from the Internal Revenue Service. The official secure URL for the transcripts download followed immediately after The White House fact sheet confirmed the decision. According to the Tech Crunch You Can Now Download Your Tax Returns From The IRS  article, there are some minor bug issues when registering. Given that security has long been problematic with the IRS, the best course of action for the public is to take some precautions when downloading personal information on mobile devices, pc’s and laptops. Installing disk encryption software on all your devices will protect your files reduce risk
2. Have an awesome Start-Up with products in ‘stealth or private beta” that you want like to pitch for a chance to get a table at Disrupt NY? TechCrunch is heading to Atlanta and New Orleans February 18^th and 20^th 2014 and will host a beer fest night in exchange for your thoughts and pitches. Tickets are $5, and all entrepreneurs, investors, dreamers or tech enthusiast are welcome.
3. Cloutex, a cloud computing future enabler has just secured their first round of seed funding.  Cloutex is an Estonian tech startup, which connects and syncs various web applications such as e-marketing, CRM and accounting tools under one convenient hub. The United Partners, SmartCap and EstBan business angels seeded the start-up with $6000, 000.
4. Could you get everything important that you need to know about living successfully from a computer program? Ryan Dube seems to think so. In his 6 Life Habits That Programming Could Teach You Today  he speaks in flow charts, loops and program modules, in the same breath as paying off debt or buying a house.  How can your programming skills help in life skills by modeling some of the same principles?
5. 10 Incredibly Simple Things You Can Do To Protect Your PrivacyPassword protect your devices.  Put alerts on your name in Google; simple tasks that can be significant in protecting your privacy.
6. Adobe Brings 3D Printing Support to PhotoshopAmong the latest updates in Adobe, Photoshop users have the ability to design 3D models from scratch as well as being able to toy around with color, shape and angles.

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.

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

Python programming language is general purpose open source programming language. One of its main features is flexibility and ease of use. Python has a variety of useful set of utilities and libraries for data processing and analytical tasks. Currently due to the rise in demand of big data processing python has grown in popularity because its features are easy to use which are core to the processing of huge chunks of information.

Guido Van Rossum, the pioneer of python, introduced python in the year 1980 and then implemented it in 1989. The intention behind the development of python was to make it open source language that can also be used for commercial projects. The fundamental principle of python is to write the code that is easy to use, highly readable and embrace writing fewer lines of code for achieving a particular task. One of the most popular standard libraries which have ready to use tools for performing a various work is Python Package Index. It was introduced in January 2016 and contains more than 72,000 packages for third-party software usage.

Python plays a critical role in linking data to customers. Recently python has found few entry barriers and many people have had access to have experienced the power of python in the past. So, what makes python the best language for big data analytics?

One of the reasons to choose python is that python ecosystem is very vibrant, the ratings at Redmonk are a proof of the strength python community. The Redmonk ranking is based on StackOverflow discussions and contribution made in Github to determine the popularity of programming language on the method used by users to ask questions about Python and the number of the open source projects contributions.