Stateless session bean - life cycle
uncreted state -> active state (setSession() from container and ejbCreate() )
active state -> destroy state (ejbRemove())
Statefull session bean - life cycle
Uncreated state -> Active state (setSession() from container and ejbCreate() )
Active...
Enterprice Java Beans on JBoss (Wildfly now)
EJBs are associated with applications and it can do application's work. It's that simple. So these applications have to be deployed on a server. For the server you have various servers to choose.
Apche
IBM websphere application server
JBoss (now called as WildFly)
OW2
Oracle GlassFish
Resin and many more.
But for now we will focus on WildFly server more particularly 9.x.
PS- If you haven't install...
EJB for noobs
Lets say we have a Java program and it has a multiply method which takes 2 arguments,multiply and send back the result. So in runtime we can just pass the references of the 2 varibles and get the result right.
What if the mutliply(arg1, arg2) method is not in the same machine. What if it is in a different...
Sorting algorithms 4 - Quick sort
Like merge sort, quick sort is also better than bubble,insertion and selection. Quick sort also uses divide and conqueror approach like merge sort. The basic idea behind in quick sort is that divide array using a pivot element and sort the sub arrays. Unlike merge sort, quick sort is memory wise efficient.
Process
In...
Sorting algorithms 4 - Merge sort
Merge sort is faster and efficient than bubble,insertion and selection sorts. But it is not efficient than quick and shell sorts. Time wise merge sort is efficient but this comes with a penalty. That is we need more additional space for merge sort. The basic of merge sort is partition the array in...
Sorting algorithms 3 - Insertion sort
Just like bubble and selection sorts, insertion sort is also a simple yet inefficient sorting algorithm on large data sets.
Process
Lets take a hypothetical moment where the unsorted array we want to sort is partially sorted.
So the left part is sorted in ascending order and right part is...
Sorting algorithms 2 - Selection sort
Selection sort is also like bubble sort. It uses another different approach for sorting comparing to bubble sort. But when it comes to sort large volumes of data it is inefficient yet good,easy,adaptive for small volume of data.
Process
Lets say we want to sort an unsorted array in ascending...
Sorting algorithms 1 - Bubble Sort
Bubble sort is one of the simplest and easiest of sorting algorithms available. But bubble sort is has almost no practical usage because it is inefficient to sort large volumes of data. Then again bubble sort is good easy solution for simple low volumes of data.
Process
Lets say we want an...