Skip to main content

JAVA CLASSLOADER- Types, usages.

JVM loads library and classes dynamically only. Its on demand only.
A Class will be loaded only when needed and only once.

There can be system supported class loader and user supplied class loader.
When JVM starts it loads three type of class loader
1. Bootstrap loader - When system boots. Loads from jre_home/lib/
2. External class loader - Loads from jre_home/lib/ext.
3. System Class loader - Loads classes from system property CLASSPATH.


Besides this user can provide their own class loader which is pretty easy to implement in Java.
User supplied loader will work in conjunction with other loader i.e. system loader too.

Some of the examples are:

1. Load library at runtime from http resources. Example scripting classes, bean classes.
2. Can load encrypted class files with new class loader.
3. Modify the byte code.

Application Container loads classes from deployed WAR or EAR files using a tree of class loaders.

Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)

One way : Heap or Stack allocation

Took my time to find solution for this and it actually made me realize how much i have to learn. Now question is how can we enforce the creation of objects whether on heap or stack. Creating object on Heap only. Make your destructor private and create a destroy function. Class A {  ~A(){} public:  A(){} void destroy() { delete this; } } Now if you can not create your object: A a; // error: 'A::~A()' is private A  a = new A(); Great. Now all the objects will be allocated to heap only. Making destructor private a better choice than constructor as we don't know number of constructor so early in programming. Creating object on stack While i knew that it has to do something with operator new, but could not figure out how can i create object on stack and return the memory back to class initialization. Though answer was simple, i had to google for that: Overload operator new, new[], operator delete and delete[] and make them private ;) class A { pr...