Programming For Future

class PrimeNo{ public static void main(String ar[]){ int n=50; boolean isPrime=false; for ( int i=3;i<=n;i++){ for ( int j=2;j<i;j++){ if (i%j==0){ isPrime=false; break ; } else isPrime=true; } if (isPrime) System.out.println(i+ " is prime" ); } } }

class Pattern2{ public static void main(String ar[]){ int n=20; for ( int i=1;i<=n;i++){ for ( int j=1;j<=n;j++){ if (i==1||i==n){ System.out.print( " *" ); } else if (j==1||j==n){ System.out.print( " *" ); } else { System.out.print( " " ); } } System.out.println( "" ); } } } /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ...

class Pattern1{ public static void main(String ar[]){ char []chrs={'a','b','c','d','e','f','g','h','i','j','k','l','m'}; for ( int i=0;i<chrs.length;i++){ for ( int j=0;j<2*chrs.length;j++){ if (j<=i||(2*chrs.length-j)<=i+1){ System.out.print(chrs[i]); } else { System.out.print( " " ); } } System.out.println( "" ); } } } /* OUTPUT a a bb bb ccc ccc dddd dddd eeeee eeeee ffffff ffffff ggggggg ggggggg hhhhhhhh hhhhhhhh iiiiiiiii iiiiiiiii jjjjjjjjjj jjjjjjjjjj kkkkkkkkkkk kkkkkkkkkkk llllllllllll llllllllllll mmmmmmmmmmmmmmmmmmmmmmmmmm */

class Q1iPage139{ static int a=20,b=30; public static void main(String ar[]){ int x=test(6,18); System.out.println(x); } static int test( int a, int b){ int gcd=0; int c=(a<b)?a:b; for ( int i=1;i<=c;i++){ if ((a%i==0)&&(b%i==0)){ gcd=i; } } return gcd; } }

//Program to check palindrom of string class Q4ipage154{ public static void main(String ar[]){ boolean b=pal( "nitin" ); System.out.println(b); } static boolean pal(String s) { boolean p=true; int start=0,end=s.length()-1; while (start<end){ if (!(s.charAt(start)==s.charAt(end))){ p=false; break ; } start++; end--; } return p; } }

class Q3apage246{ public static void main(String ar[]){ int n=4; int a[][]= new int [n][]; int c=0; for ( int i=0;i<n;i++){ a[i]= new int [i+1]; for ( int j=0;j<n;j++){ if (j<=i){ a[i][j]=c; c++; } } } for ( int i=0;i<n;i++){ for ( int j=0;j<n;j++){ if (j<=i){ System.out.print(a[i][j]); } } System.out.println( "" ); } } } OUTPUT 0 12 345 6789

class Fib{ static int fib( int a) { if (a==1||a==2) return 1; else { int n=fib(a-1)+fib(a-2); return n; } } public static void main(String ar[]) throws Exception { int a=10,i; for (i=1;i<=a;i++) { System.out.printf( "%5d" ,fib(i)); } } }