1 Program.

Write a program to find factorial of list of number reading input as command line argument.
Labels: Java Lab Programs class Factorial { public static void main(String[] arg) { int[] num=new int[10]; if(arg.length==0) { System.out.println("No Command Line argument passed."); return; } for(int i=0;i<arg.length;i++) num[i]=Integer.parseInt(arg[i]); for(int i=0;i<arg.length;i++) { int fact=1; for(int j=1;j<=num[i];j++) fact *=j; System.out.println("The factorial of "+arg[i]+" is : "+fact); } } } Output C:\Users\Jaisha\Desktop\Java>javac Factorial.java C:\Users\Jaisha\Desktop\Java>java Factorial No Command Line argument passed. C:\Users\Jaisha\Desktop\Java>java Factorial 5 6 The factorial of 5 is : 120 The factorial of 6 is : 720

3. Program

Write a program to sort list of elements in ascending and descending order and show the exception handling.
Labels: Java Lab Programs import java.util.*; class SortOrder { public static void main(String[] args) { Scanner sc=new java.util.Scanner(System.in); System.out.print("Enter the array size: "); int size=sc.nextInt(); int[] arr=new int[size]; System.out.println("Enter Array elements: "); for(int i=0;i<size;i++) { System.out.print("Element No. "+(i+1)+": "); arr[i]=sc.nextInt(); } System.out.print("Before Sorting: "); for(int i=0;i<size;i++) System.out.print(" "+arr[i]); for(int i=0;i<size;i++) { int temp; for(int j=i+1;j<size;j++) { if(arr[i]>arr[j]) { temp=arr[i]; arr[i]=arr[j]; arr[j]=temp; } } } System.out.println();

System.out.print("After Sorting in ascending order: "); for(int i=0;i<size;i++) { System.out.print(" "+arr[i]); } System.out.println(); System.out.print("After Sorting in descending order: "); for(int i=size-1;i>=0;i--) { System.out.print(" "+arr[i]); } } } Output

C:\Users\Jaisha\Desktop\Java>javac SortOrder.java C:\Users\Jaisha\Desktop\Java>java SortOrder Enter the array size: 5 Enter Array elements: Element No. 1: 5 Element No. 2: 3 Element No. 3: 62 Element No. 4: 1 Element No. 5: 52 Before Sorting: 5 3 62 1 52 After Sorting in ascending order: 1 3 5 52 62 After Sorting in descending order: 62 52 5 3 1

4th Program

Write a program to implement Rhombus pattern reading the limit form user.
Labels: Java Lab Programs import java.util.*; class Rhombus { public static void main(String[] arg) { Scanner sc=new Scanner(System.in); System.out.print("Enter the pattern number: "); int pat=sc.nextInt(); System.out.print("Enter the pattern character symbol: "); String s=sc.next(); char c=s.charAt(0); for(int i=1;i<=pat;i++) { for(int j=1;j<=(pat-i);j++) System.out.print(" "); for(int k=1;k<=i;k++) System.out.print(c+" "); System.out.println(); } for(int i=pat-1;i>=0;i--) { for(int j=1;j<=(pat-i);j++) System.out.print(" "); for(int k=1;k<=i;k++) System.out.print(c+" "); System.out.println(); } } } Output

C:\Users\Jaisha\Desktop\Java>javac SortOrder.java C:\Users\Jaisha\Desktop\Java>java SortOrder Enter the array size: 5 Enter Array elements: Element No. 1: 5 Element No. 2: 3 Element No. 3: 62 Element No. 4: 1 Element No. 5: 52 Before Sorting: 5 3 62 1 52 After Sorting in ascending order: 1 3 5 52 62 After Sorting in descending order: 62 52 5 3 1

12th Program

Write a program to implement thread priorities.

Labels: Java Lab Programs class A extends Thread { public void run() { for(int i=1;i<=10;i++) { System.out.println("i="+i); } } } class B extends Thread { public void run() { for(int j=1;j<=10;j++) {

System.out.println("j="+j); } } } class C extends Thread { public void run() { for(int k=1;k<=10;k++) { System.out.println("k="+k); } } } class ThreadPrior { public static void main(String arg[]) { A thA=new A(); B thB=new B(); C thC=new C(); thA.setPriority(1); thB.setPriority(3); thC.setPriority(9); thA.start(); thB.start(); thC.start(); System.out.println("End of main"); } } Output C:\Users\Jaisha\Desktop\Java>javac ThreadPrior.java C:\Users\Jaisha\Desktop\Java>java ThreadPrior End of main j=1 i=1

k=1 i=2 j=2 i=3 k=2 i=4 j=3 i=5 k=3 i=6 j=4 i=7 k=4 i=8 j=5 i=9 k=5 i=10 j=6 k=6 j=7 k=7 j=8 k=8 j=9 k=9 j=10 k=10