All thing coding
Usage In Heapsort In Priority Queue Not the garbage collector storage (as provided by JVM) Definition A binary Heap is an array object. We can view that array object as a near complete binary tree. A binary tree is said to be a complete binary tree when all the nodes except possibly for the leaves... Continue Reading →
The war is almost here and people of Winterfell have to decide whom they wish to declare the king in the North. There are one million citizen in Winterfell. These one million citizens need to choose between Daenerys Targaryen and Jon Snow. But there is one man who wish to know the results before hand... Continue Reading →
Java code comprise of class and variable. Class and Variable come with different scope(private/public/static). All this takes memory. JVM has been given responsibility to run the java code. JVM gives memory for class/variables. But how does JVM manages memory? Let's imagine JVM memory as big box as it is shown in the picture below. We will... Continue Reading →
We talked about introduction to machine learning here. Let's say, we have two armies: red and blue. The black line is the border separating these two armies. The line is curved and it is drawn using visual inspection. But the kings are mad and they demand a straight line, not a curved one. To please... Continue Reading →
Before you read further, Please answer the following question: A. int a = 100; B. Integer b = new Integer(100); There are two java statements written above. What is the ratio of memory used by b to memory used by a in a 32 bit machine? The four options are: 1 1.5 2 4... Continue Reading →
Machine Learning is a kind of buzz words these days; sort of a mysterious new guy in the class whom everyone wants to be friend with. On the onset, I would like to think Machine Learning as a part of tool kit of every Software Engineer. And conceptually it's not different from the Mathematics, Algorithm,... Continue Reading →
An introduction to sentiment analysis comparing different classifiers using scikit, nltk and panda.
Introduction Decision Tree learning is used to approximate discrete valued target functions, in which the learned function is approximated by Decision Tree. To imagine, think of decision tree as if or else rules where each if-else condition leads to certain answer at the end. You might have seen many online games which asks several question and lead... Continue Reading →
Entropy is a measure of randomness. In other words, its a measure of unpredictability. Let's take an example of a coin toss. Suppose we tossed a coin 4 times, and the output of the events came as {Head, Tail, Tail, Head}. Based solely on this observation, if you have to guess what will be the... Continue Reading →
Introduction In a modern computer system, data resides and it is transported throughout a hierarchy of storage media. The highest speed memory is the most expensive and therefore available with least capacity. The lowest speed memory is offline tape storage which is available in indefinite storage capacity. The storage capacity is measured in bytes, kilobytes,... Continue Reading →
The Null Pointer Exception 