Saturday, 22 March 2014

Assignment 1

Perfect no

import java.io.*;
public class PerfectNo {
    public boolean isPerfectNumber(int number){
        int temp = 0;
        for(int i=1;i<=number/2;i++){
            if(number%i == 0){
                temp += i;
            }
        }
        if(temp == number){
           
            return true;
        } else {
           
            return false;
        }
    }
    
    public static void main(String a[]){
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PerfectNo ipn = new PerfectNo();
        try{
        System.out.println("Enter The Number:   ");
        int i =  Integer.parseInt(br.readLine());
        System.out.println("Is perfect number: "+ipn.isPerfectNumber(i));}
        catch(Exception e){}
    }
}



Prime No

import java.io.*;public class PrimeNo
{
    public static void main(String[] args)
    {
             try {
                int starting_number;
                int ending_number ;
                long totals = 0;
                BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                System.out.println(" Enter Starting No: ");
                starting_number = Integer.parseInt(br.readLine());
                System.out.println(" Enter Ending No: ");
                ending_number = Integer.parseInt(br.readLine());
                System.out.println("List of prime numbers between " + starting_number + " and " + ending_number);
                for (long current = starting_number; current <= ending_number; current++)
        {
                        long sqr_root = (long) Math.sqrt(current);
                        boolean is_prime = true;
                        for (long i = 2; i <= sqr_root; i++)
            {
                            if (current % i == 0)
                {
                                    is_prime = false; // Current is not prime.
                            }
                        }
                        if (is_prime) {
                        System.out.println(current);
                        totals++;
                        }
                }
            System.out.println("There are a total of "+totals+" prime numbers between "+starting_number+" and "+ending_number);
        }    
        catch (Exception e){}
    }
}


  Fibonacci Series
import java.io.*;
import java.util.*;
public class FibonacciSeries
{
    private static int[] F = new int[41];
    public static void main(String[] args)
    {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int n=0;
        do
        {
            System.out.print("Please enter a value for n: ");
            try
            {
                n = Integer.parseInt(br.readLine());
            } catch (Exception x) {
            System.out.println("Must be a whole number!");
            System.exit(1);
            }
            if (n>40) System.out.println("Number too big! Must be 40 or less");
            if (n<1) System.out.println("Number too small! Must be 1 or more");
        } while (n>40 || n<1);

        System.out.println("first n terms in the Fibonacci Series.");
        for (int i=1; i<=n; i++)
        {
            System.out.print(fib(i)+" ");
        }
    }

    public static int fib(int n)
    {
        for (int i=1; i<=n; i++)
        {
            switch(i)
            {
                case 1 :     F[i]= 0; break;
                case 2 :
                case 3 :    F[i] = 1; break;
                default :    F[i] = F[i-2] + F[i-1];
            }
        }
        return F[n];
    }
}

 
Pattern
import java.io.*;
class pattern
{
public static void main(String args[])
{
int i,j,k,l;
for(i=1;i<=5;i++)
{
    for(j=1;j<=i;j++)
    {
        System.out.print(" ");
    }
    for(j=i;j<=5;j++)
    {
        System.out.print("$");
    }
   
System.out.print("\n");

}
}
}

No comments:

Post a Comment