O create the remote interface o provide the

o Create the remote interface.
o Provide the implementation of the remote interface.
o Compile the implementation class and create the stub and skeleton objects using
the rmic tool.
o Start the registry service by the rmiregistry tool.
o Create and start the remote application.
o Create and start the client application.
245) What is the use of HTTP-tunneling in RMI?
HTTP tunneling can be defined as the method which doesn't need any setup to work
within the firewall environment. It handles the HTTP connections through the proxy
servers. However, it does not allow outbound TCP connections.

246) What is JRMP?
JRMP (Java Remote Method Protocol) can be defined as the Java-specific, stream-based
protocol which looks up and refers to the remote objects. It requires both client and
server to use Java objects. It is wire level protocol which runs under RMI and over TCP/IP.
247) Can RMI and CORBA based applications interact?
Yes, they can. RMI is available with IIOP as the transport protocol instead of JRMP.
Core Java: Data Structure interview questions
248) How to perform Bubble Sort in Java?
Consider the following program to perform Bubble sort in Java.
1. public class BubbleSort {
2. public static void main(String[] args) {
3. int [] a = { 10 , 9 , 7 , 101 , 23 , 44 , 12 , 78 , 34 , 23 };
4. for ( int i= 0 ;i< 10 ;i++)
5. {
6. for ( int j= 0 ;j< 10 ;j++)
7. {
8. if (a[i]<a[j])
9. {
10. int temp = a[i];
11. a[i]=a[j];
12. a[j] = temp;
13. }
14. }
15. }
16. System.out.println( "Printing Sorted List ..." );
17. for ( int i= 0 ;i< 10 ;i++)
18. {
19. System.out.println(a[i]);
20. }
21. }
22. }

Output:
Printing Sorted List . . .
7
9
10
12
23
34
34
44
78
101
249) How to perform Binary Search in Java?
Consider the following program to perform the binary search in Java.
1. import java.util.*;
2. public class BinarySearch {
3. public static void main(String[] args) {
4. int [] arr = { 16 , 19 , 20 , 23 , 45 , 56 , 78 , 90 , 96 , 100 };
5. int item, location = - 1 ;
6. System.out.println( "Enter the item which you want to search" );
7. Scanner sc = new Scanner(System.in);
8. item = sc.nextInt();
9. location = binarySearch(arr, 0 , 9 ,item);
10. if (location != - 1 )
11. System.out.println( "the location of the item is " +location);
12. else
13. System.out.println( "Item not found" );
14. }
15. public static int binarySearch( int [] a, int beg, int end, int item)
16. {
17. int mid;
18. if (end >= beg)
19. {
20. mid = (beg + end)/ 2 ;
21. if (a[mid] == item)
22. {
23. return mid+ 1 ;
24. }
25. else if (a[mid] < item)
26. {
27. return binarySearch(a,mid+ 1 ,end,item);
28. }
29. else

30. {
31. return binarySearch(a,beg,mid- 1 ,item);
32. }
33. }
34. return - 1 ;
35. }
36. }
Output:
Enter the item which you want to search
45
the location of the item is 5
250) How to perform Selection Sort in Java?
Consider the following program to perform selection sort in Java.
1. public class SelectionSort {
2. public static void main(String[] args) {
3. int [] a = { 10 , 9 , 7 , 101 , 23 , 44 , 12 , 78 , 34 , 23 };
4. int i,j,k,pos,temp;
5. for (i= 0 ;i< 10 ;i++)
6. {
7. pos = smallest(a, 10 ,i);
8. temp = a[i];
9. a[i]=a[pos];
10. a[pos] = temp;
11. }
12. System.out.println( "\nprinting sorted elements...\n" );
13. for (i= 0 ;i< 10 ;i++)
14. {
15. System.out.println(a[i]);
16. }
17. }
18. public static int smallest( int a[], int n, int i)
19. {
20. int small,pos,j;
21. small = a[i];
22. pos = i;
23. for (j=i+ 1 ;j< 10 ;j++)
24. {
25. if (a[j]<small)
26. {
27. small = a[j];

28. pos=j;
29. }
30. }
31. return pos;
32. }
33. }
Output:
printing sorted elements...