Lab 6  Solutions,  ESC101, 2004-2005 Semester-II

---

1.

class reverse
{
        static void rev(String[] arr)
        {
                int i=0, j=arr.length-1;
                String tmp;
                                                                                                                            
                while(i < j){
                        tmp = arr[i];
                        arr[i] = arr[j];
                        arr[j] = tmp;
                                                                                                                            
                        i++;
                        j--;
                }
        }
                                                                                                                            
        public static void main(String args[])
        {
                String[] arr = {"Sridhar", "Gopal", "Ravi"};
                                                                                                                            
                System.out.println("Before Reversing the Array Elements. \n");
                                                                                                                            
                for(int i=0; i<arr.length; i++)
                        System.out.println(arr[i]);
                                                                                                                            
                rev(arr);
                                                                                                                            
                System.out.println("\n After Reversing the Array Elements. \n");
                                                                                                                            
                for(int i=0; i<arr.length; i++)
                        System.out.println(arr[i]);
        }
}

---

2.

class reverse1
{
        static String[] rev(String[] arr)
        {
                String[] new_arr = new String[arr.length];
                int j=arr.length;
                                                                                                                            
                for(int i=0; i<arr.length; i++)
                        new_arr[i] = arr[j-i-1];
                                                                                                                            
                return new_arr;
        }
                                                                                                                            
        public static void main(String args[])
        {
                String[] arr = {"Sridhar", "Gopal", "Ravi"};
                String[] new_arr;
                                                                                                                            
                System.out.println("Before Reversing the Array of Strings. \n");
                                                                                                                            
                for(int i=0; i<arr.length; i++)
                        System.out.println(arr[i]);
                                                                                                                            
                new_arr = rev(arr);
                                                                                                                            
                System.out.println("\n After Reversing the Array of Strings. \n");
                                                                                                                            
                for(int i=0; i<new_arr.length; i++)
                        System.out.println(new_arr[i]);
                                                                                                                            
        }
}

---

3.

class fibonacci{
        static int[] fib(int n){
                int v1=1, v2=1, tmp, i, len=0;
                int[] fib_num = new int[n];
                                                                                                                             
                for(i=0; i<n; i++){
                        if((i == 0) || (i==1)){
                                fib_num[len++] = 1;
                                continue;
                        }
                                                                                                                             
                        tmp = v1 + v2;
                        v1 = v2;
                        v2 = tmp;
                                                                                                                             
                        fib_num[len++] = tmp;
                }
                                                                                                                             
                return fib_num;
        }
                                                                                                                             
        public static void main(String args[])
        {
                int n=10;
                int[] fib_num;
                                                                                                                             
                fib_num = fib(n);
                                                                                                                             
                System.out.println("First " + n + " Fibonacci Numbers are ");
                                                                                                                             
                for(int i=0; i<n; i++)
                        System.out.println(fib_num[i]);
        }
}

---

4.

class position
{
        static int findMinPosition(String[] arr)
        {
                String min = arr[0];
                int min_pos = 0;
                                                                                                                            
                for(int i=0; i<arr.length; i++){
                        if(arr[i].compareTo(min) < 0){
                                min = arr[i];
                                min_pos = i;
                        }
                }
                                                                                                                            
                return min_pos;
        }
                                                                                                                            
        static String findMinString(String[] arr)
        {
                return arr[findMinPosition(arr)];
        }
                                                                                                                            
        public static void main(String args[])
        {
                String[] arr = {"Sridhar", "Gopal", "Ravi"};
                                                                                                                            
                System.out.println("The Index of the Alphabetically First String is " + findMinPosition(arr));
                System.out.println("And the corresponding String is " + findMinString(arr));
        }
}

---