What happens when you run a Java Program?

Let suppose you run a Hello World program!
HelloWorld.java

public class HelloWorld(){
    public static void main(String[] args){
       System.out.println("Hello World!");
    }
}
 Compile Time :

Java Code(.java files) -------Compiler-------> Byte Code(.class files)


Before JVM(Java Virtual Machine) runs the program,the program needed to be converted to Byte-Code, which is platform independent.Compiler compiles and generates .class files if the program is error free.These class files are saved in Workspace/classpath specified

 Run Time :

Byte Code(.class files) -----Interpreter----->Executes the instructions


Now, JVM is invoked to run the byte-code.It searches for the .class file in the path/workspace and executes it.
In detail, JVM
>Classloader loads the compiled (.class files)  code,
>ByteCode Verifier verifies the bytecode ,
>Then interpreter comes into picture where it takes over the control of bytecode and converts it to machine readable instructions and executes them.




Comments

Post a Comment

Popular posts from this blog

Sorting Algotithms

Image
Sorting is the basic operation required in most of the programs. For this which is used in right manner, the algorithm should be efficient and optimized. We have various algorithms from low to high efficiency. Selection Sort: In place logic of selecting the minimum in each pass and putting it in its appropriate place. References: Mycodeschool channel-youtube. http://www.youtube.com/playlist?list=PL2_aWCzGMAwKedT2KfDMB9YA5DgASZb3U Merge Sort: Mergesort is a comparison-based algorithm that focuses on how to merge together two pre-sorted arrays such that the resulting array is also sorted. Insertion Sort: Insertion sort is a comparison-based algorithm that builds a final sorted array one element at a time. It iterates through an input array and removes one element per iteration, finds the place the element belongs in the array, and then places it there. Bubble Sort:   Bubble sort is a comparison​-based algorithm that compares each pair of elements in an array ...
Read more

Static In Java!

Static in dictionary means stable,unchanging or inactive. In java static is generally used in case of variables,Methods,blocks and classes. It is not associated with any instance of the class that is why you can access the static member without creating any instance of the class. 1.Static variables:  When a class has static variables,those are likely to be called class variables.They don't need instances of the class to be created and then values to be initialized seperately.These can be directly accessed by className.variableName. When you have the common data for all the objects/instances. Then you might be allocating an extra memory for the same variable for every instance you create. Ex1: When a company Xyz has its employee data stored in a class.he knew that everyone are of the same company . Here it creates an extra allocation for all the instances. public class Employee(){ String Name; String Company; long Salary; Employee(String Name,long Sa...
Read more

Program to to Merge Two sorted Linked lists in Java

package programs; import ds.linkedlists.*; //Linkedlist and Node are my internal classes which I mentioned in LinkedList Program public class Merge2SortedLL { public static void main(String[] args) { LinkedList l1 = new LinkedList(); LinkedList l2 = new LinkedList(); l1.Enqueue(4); l1.Enqueue(5); l1.Enqueue(7); l1.Enqueue(11); l1.Enqueue(12); l2.Enqueue(3); l2.Enqueue(4); l2.Enqueue(7); l2.Enqueue(18); l2.Enqueue(20); l1.head = Merge(l1,l2); l1.display(); } private static LLNode Merge(LinkedList l1, LinkedList l2) { LLNode t1= l1.head; LLNode t2= l2.head; LLNode head = null; LLNode prev = null; while(t1!=null && t2 != null){ if(head == null){ if(t1.value >t2.value){ prev = t2; t2 = t2.next; } else { prev= t1; t1 = t1.next; } head= prev; } else{ if(t1.value >t2.value){ prev.next = t2; prev = t2; t2 = t2.next; ...
Read more