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.

Toshiba has released a new line of solid-state drives (SSD) using 19 nanometers, which is currently the industry’s smallest lithography process.

The lineup will include mini-SATA and 2.5-inch form factors along with drives in 7mm and 9.5mm heights. All drives will use the most current serial ATA 6Gbps interface protocol.

Viruses, trojans, and other malicious programs are everywhere. There's always a new threat to your computer's security, and many of these threats invade your computer without you even knowing. Most viruses aren't going to loudly announce themselves, so it's important to know the hidden ways in which your computer can become infected.


Infected Files from Other Computers

Whether you're borrowing someone's flash drive or grabbing a file from their computer, your computer can become infected if the file or device you're using already contains a virus, trojan, or other form of malware.

This is a very common issue, and you won't even know there's a problem most of the time. For example, if your computer is connected to other devices on a network, and you decide to pull an important file off of another computer on the network, your computer will become infected if the file you took has a virus attached to it.

Also, if you forgot your flash drive, and you need to use your friend or coworker's device for the day, then even plugging the device into your computer can cause the infection in the flash drive to be transmitted.


Downloading Legitimate Programs

Another way your computer can be secretly infected is when you download a legitimate program and run it. There are numerous legitimate programs on the internet that can help you in many ways. The programs themselves could be infected, though.

Also, one of the most common ways your computer can become infected is when you don't read the fine print before you download a program. Some of them may insist that you install another small program in addition to the one you initially chose. The boxes that you are supposed to click to give your consent may already be clicked.

This small extra program is the one that may carry an infection that will spread to your computer when you run the main program. You may get a lot of good use out of the legitimate program, but the virus attached to the extra hidden program can cause you a lot of trouble.


Using Vulnerable Applications

Security is a serious matter. If even one of the applications you use on your computer is vulnerable to becoming hacked or infected, then your entire computer is at risk and could become secretly infected. Anything from PDF viewing applications to your operating system can become infected if you don't download the latest security patches and keep everything up-to-date.


Not Using Antivirus Software

Antivirus software can protect your computer from a number of viruses, trojans, and other problems. Your computer can become infected in a number of ways, so you need to have good antivirus software to provide strong protection from hidden attacks.


Viruses, trojans, and other malware can infect your computer in a variety of hidden ways. To prevent infection and problems, you need to be careful about what you download, and you should keep your applications secure. Also, find reliable antivirus software to help.

Related:

How Do IT Placement Agencies Work?

5 Disruptive Technologies for the Enterprise: What are the Implications?

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.