Practical – 1

 Write a Java code to implement – Class, Command

line argument and to enter the value through
keyboard.
CODE -:

class cmdla {
    public static void main(String args[]) {

        for (int i = 0; i < args.length; i++)

            System.out.println(args[i]);

  }
}

OUTPUT -:

1|Page
 Practical – 2

 Write a Java Code to implement each of the

following data types:
Arrays, Strings, Type Casting.

CODES -:
Array-
class array {

    public static void main(String args[]) {

        int a[] = { 33, 3, 4, 5 };
        for (int i = 0; i < a.length; i++)
            System.out.println(a[i]);
  }
}
Output-

2|Page
String-
class Stringex {
    public static void main(String args[]) {
        String S = "GAUTAM BUDDHA UNIVERSITY";
        System.out.println(S);
  }
}
Output-

Type Casting-
class typecasting {
    public static void main(String[] args) {
        float d = 45.78f;
        int a = (int) d;
        System.out.println(d);
        System.out.println(a);
  }
}
Output-

3|Page
 Practical – 3
 Write a separate Java Code to implement each of the
following operators:
Arithmetic operator, Assignment operator
?: operator

Arithmetic operator-
class arthmaop {
public static void main(String args[]) {
        int a = 25;
        int b = 5;
        System.out.println(a + b);
        System.out.println(a - b);
        System.out.println(a * b);
        System.out.println(a / b);
        System.out.println(a % b);
  }
}
Output-

Assignment operator-

4|Page
class assign {
public static void main(String args[]) {
        int a = 10, b = 20;
        a += 4;
        b -= 4;
        System.out.println(a);
        System.out.println(b);
  }
}
Output-

?:(Ternary) operator-
class ternaryop {
public static void main(String args[]) {
        int a = 2;
        int b = 5;
        int min = (a < b) ? a : b;
        System.out.println(min);
  }
}

5|Page
Output-

Practical – 4
 Write a separate Java Code to implement each of the
following control statements: Decision statement,
Loops statement and Branch statements

Decision statement-
import java.util.*;
public class test {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int a = n % 2;
        if (a == 0) {
            if (n >= 2 && n <= 5)
                System.out.println("Not Weird");
            else if (n >= 6 && n <= 20)
                System.out.println("Weird");
            else if (n > 21)
                System.out.println("Not Weird");
        } else
            System.out.println("Weird");
6|Page
  }
}

Output-

Loops statement-
import java.util.*;
class factorial {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int num, x = 1, i;
        num = sc.nextInt();
        for (i = 1; i <= num; i++) {
            x = x * i;
    }
        System.out.println(x);
  }
}
Output-

7|Page
Branch statements-
class breakex {
        public static void main(String[] args) {
                for (int i = 0; i <= 10; i++) {
                        System.out.println(i);
                        if (i == 5) {
                                break;
            }
        }
    }
}
Output-

8|Page
 Practical – 5
 Write a separate Java Code to implement each of the
following sorting: Bubble Sort, Selection Sort,
Insertion Sort, Merge Sort
Bubble Sort-
import java.util.Arrays;
class bubblesort {
    static void bubbleSort(int array[]) {
        int size = array.length;
        for (int i = 0; i < size - 1; i++)
            for (int j = 0; j < size - i - 1; j++)
                if (array[j] > array[j + 1]) {
                    int temp = array[j];
                    array[j] = array[j + 1];
                    array[j + 1] = temp;
        }
  }
    public static void main(String args[]) {
        int data[] = { -2, 45, 0, 11, -9 };
        bubblesort.bubbleSort(data);
        System.out.println("Sorted Array in Ascending Order:");
9|Page
        System.out.println(Arrays.toString(data));
  }
}
Output-

Selection Sort-
import java.util.Arrays;
class Selectionsort {
    void selectionsort(int array[]) {
        int size = array.length;
        for (int step = 0; step < size - 1; step++) {
            int min_idx = step;
            for (int i = step + 1; i < size; i++) {
                if (array[i] < array[min_idx]) {
                    min_idx = i;
        }
      }
            int temp = array[step];
            array[step] = array[min_idx];
            array[min_idx] = temp;
    }
  }

10 | P a g e
    public static void main(String args[]) {
        int[] data = { 20, 12, 10, 15, 2 };
        Selectionsort ss = new Selectionsort();
        ss.selectionsort(data);
        System.out.println("Sorted Array in Ascending Order: ");
        System.out.println(Arrays.toString(data));
  }
}
Output-

Insertion Sort-
import java.util.Arrays;
class InsertionSort {
    void insertionSort(int array[]) {
        int size = array.length;
        for (int step = 1; step < size; step++) {
            int key = array[step];
            int j = step - 1;
            while (j >= 0 && key < array[j]) {
                array[j + 1] = array[j];
                --j;
      }

11 | P a g e
            array[j + 1] = key;
    }
  }
    public static void main(String args[]) {
        int[] data = { 9, 5, 1, 4, 3 };
        InsertionSort is = new InsertionSort();
        is.insertionSort(data);
        System.out.println("Sorted Array in Ascending Order: ");
        System.out.println(Arrays.toString(data));
  }
}
Output-

Merge Sort-
class MergeSort {
    void merge(int arr[], int p, int q, int r) {
        int n1 = q - p + 1;
        int n2 = r - q;
        int L[] = new int[n1];
        int M[] = new int[n2];
        for (int i = 0; i < n1; i++)
            L[i] = arr[p + i];
12 | P a g e
        for (int j = 0; j < n2; j++)
            M[j] = arr[q + 1 + j];
        int i, j, k;
        i = 0;
        j = 0;
        k = p;
        while (i < n1 && j < n2) {
            if (L[i] <= M[j]) {
                arr[k] = L[i];
                i++;
            } else {
                arr[k] = M[j];
                j++;
      }
            k++;
    }
        while (i < n1) {
            arr[k] = L[i];
            i++;
            k++;
    }
        while (j < n2) {
13 | P a g e
            arr[k] = M[j];
            j++;
            k++;
    }
  }
    void mergeSort(int arr[], int l, int r) {
        if (l < r) {
            int m = (l + r) / 2;
            mergeSort(arr, l, m);
            mergeSort(arr, m + 1, r);
            merge(arr, l, m, r);
    }
  }
    static void printArray(int arr[]) {
        int n = arr.length;
        for (int i = 0; i < n; ++i)
            System.out.print(arr[i] + " ");
        System.out.println();
  }
    public static void main(String args[]) {
        int arr[] = { 6, 5, 12, 10, 9, 1 };
        MergeSort ob = new MergeSort();
14 | P a g e
        ob.mergeSort(arr, 0, arr.length - 1);

        System.out.println("Sorted array:");
        printArray(arr);
  }
}

Output-

15 | P a g e
 Practical – 6
 Write Java Code to implement each of the following:
Method Overloading and Method Overriding
Method Overloading-
class A {
    void show() {
        System.out.println("1");
  }
    void show(int a) {
        System.out.println("2");
  }
}
class overloading {
    public static void main(String args[]) {
        A t = new A();
        t.show();
        t.show(5);
  }
}
Output-

16 | P a g e
Method Overriding-
class A {
    void show() {
        System.out.println("1");
  }
}
class B extends A {
    void show() {
        System.out.println("2");
  }
}
class overriding {
    public static void main(String args[]) {
        B t = new B();
        t.show();
  }
}
Output-

17 | P a g e
 Practical – 7
 Write a separate Java Code to implement each of the
following: abstract class, abstract method.
abstract class Shape {
    abstract void draw();
}
class Rect extends Shape {
    void draw() {
        System.out.println("rectangle");
  }
}
class Sq extends Shape {
    void draw() {
        System.out.println("square");
  }
}
class abstraction {
    public static void main(String args[]) {
        Shape s = new Rect();
        s.draw();
        Shape a = new Sq();

18 | P a g e
        a.draw();
  }
}
Output-

19 | P a g e
 Practical – 8
 Write a Java Code to implement Inheritance.
class A {
    void Add() {
        System.out.println("This is ADD");
  }
}
class B extends A {
    void sum() {
        System.out.println("This is sum");
  }
}
class inheritance {
    public static void main(String[] args) {
        B c = new B();
        c.sum();
        c.Add();
  }
}
Output-

20 | P a g e
 Practical – 9
 Write a Java Code to implement each of the
following: Exception handling with Try, Catch.

public class TryCatch {

    public static void main(String[] args) {
        String text1 = "3g";
        int value1 = 0;
        try {
            value1 = Integer.parseInt(text1);
            System.out.println("Successfully parsed text1 as integer");
        } catch (NumberFormatException e) {
            System.out.println("Unable to parse text1 as integer");
        } finally {
            System.out.println("Inside finally block");
    }
  }
}
Output-

21 | P a g e
 Practical – 10
 Write a Java Code to implement the Interface
interface A {
    void ab();
}
interface B {
    void ba();
}
class abc implements A, B {
    public void ab() {
        System.out.println("interface");
  }
    public void ba() {
        System.out.println("inheritance");
  }
}
class Inter {
    public static void main(String args[]) {
        abc abo = new abc();
        abo.ab();
22 | P a g e
        abo.ba();
  }
}

Output-

23 | P a g e
 Practical – 11
 Write a Java Code to implement the Thread.
 by extending Thread class

class Thcs extends Thread {

    public void run() {
        System.out.println("Thread is creating");
  }
    public static void main(String[] args) {
        Thcs t = new Thcs();
        t.start();
  }
}

Output-

24 | P a g e
  by implementing Runnable interface

class Thrun implements Runnable {

    public void run() {
        System.out.println("Thread is creating");
  }
    public static void main(String[] args) {
        Thrun t = new Thrun();
        Thread t1 = new Thread(t);
        t1.start();
  }
}
Output-

25 | P a g e