Pages

Thursday, 5 September 2013

AVERAGE OF A SERIES



// Computes the average of a series of scores


import jpb.*;


public class AverageScores {

  public static void main(String[] args) {
    // Prompt user to enter number of scores
    SimpleIO.prompt("Enter number of scores: ");
    String userInput = SimpleIO.readLine().trim();
    int numberOfScores = Integer.parseInt(userInput);
    System.out.println();

    // Create array to hold scores

    int[] scores = new int[numberOfScores];

    // Prompt user to enter scores and store them in an array

    int i = 0;
    while (i < scores.length) {
      SimpleIO.prompt("Enter score #" + (i + 1) + ": ");
      userInput = SimpleIO.readLine().trim();
      scores[i] = Integer.parseInt(userInput);
      i++;
    }

    // Compute sum of scores

    int sum = 0;
    i = 0;
    while (i < scores.length) {
      sum += scores[i];
      i++;
    }

    // Display average score

    System.out.println("\nAverage score: " +
                       sum / scores.length);
  }
}


Thursday, 25 July 2013

SEQUENTIAL SEARCH



#include<stdio.h>

void main()
 {
  int a[100];
  int i,n,num,flag=0;
  printf("\n Enter the Limit :  ");
  scanf("%d",&n);
  printf("\n Enter the %d Elements.......\n",n);
  for(i=0;i<n;i++)
   scanf("%d",&a[i]);
  printf("\nEnter the Number which you want to search :  ");
  scanf("%d",&num);
  for(i=0;i<n;i++)
   {
    if(a[i]==num)
     {
      flag=1;
      break;
     }
   }
  if(flag==0)
   printf("\n The searching Element %d is not found in the Array   \n",num);
  else
    printf("\nThe Searching Element is in %d th position   ",i+1);

 }



Tuesday, 16 July 2013

BUBBLE SORT



#include<stdio.h>
void main()
 {
  int a[100];
  int n,i,j,temp;
  printf("\n Enter the Limit  :  ");
  scanf("%d",&n);
  printf("\n Enter %d elements.......\n",n);
  for(i=0;i<n;i++)
   scanf("%d",&a[i]);
  for(i=0;i<n-1;i++)
   {
    for(j=n-1;j>i;j--)
     {
      if(a[j-1]>a[j])
       {
        temp=a[j-1];
        a[j-1]=a[j];
        a[j]=temp;
       }
     }
   }
  printf("\n Array after Bubble Sort......\n");
   for(i=0;i<n;i++)
    printf("\t %d\t",a[i]);
 }



Sunday, 7 July 2013

SUM OF ARRAY



#include<stdio.h>
void main()
 {
  int a[100],i,n,sum=0;
  printf("\n Enter the limit   :");
  scanf("%d",&n);
  printf("\nEnter the %d Numbers.....\n",n);
  for(i=0;i<n;i++)
   {
    scanf("%d",&a[i]);
    sum+=a[i];
   }
  printf("\nThe sum is %d  :",sum);
 }


Tuesday, 23 April 2013

LINEAR SORT




#include<stdio.h>
void main()
 {
  int a[100];
  int i,j,temp,n;
  printf("\n Enter the Limit  :");
  scanf("%d",&n);
  printf("\n Enter the %d Elements.....\n",n);
  for(i=0;i<n;i++)
   scanf("%d",&a[i]);
  for(i=0;i<n-1;i++)
   {
    for(j=i+1;j<n;j++)
     {
      if(a[i]>a[j])
       {
        temp=a[i];
        a[i]=a[j];
        a[j]=temp;
       }
     }
   }
  printf("\n Array after Linear sort......\n");
   for(i=0;i<n;i++)
    printf("\t%d\t",a[i]);
 }


Monday, 4 March 2013

MATRIX ADDITION



/* matrix Addition */



# include<stdio.h>
    void main()
      {
        int a[50][50],b[50][50],i,j,m,n;
        printf("\n\n\t\tProgram to perform Matrix Addition\n");
        RETRY:
        printf("\nWARNING: Order of both Matrices must be same to perform Addition");
        printf("\nEnter the order of matrices\n");
        scanf("%d%d",&m,&n);
        printf("\nEnter the first matrix\n");
        for(i=0;i<m;i++)
           {
                for(j=0;j<n;j++)
                        scanf("%d",&a[i][j]);
           }
        printf("\nEnter the second matrix\n");
        for(i=0;i<m;i++)
           {
                for(j=0;j<n;j++)
                        scanf("%d",&b[i][j]);
           }
        printf("\n\n");
        for(i=0;i<m;i++)
           {
                printf("\n\t");
                for(j=0;j<n;j++)
                        printf(" %d",a[i][j]);
           }
        printf("\n\n\t  +\n");
        for(i=0;i<m;i++)
           {
                printf("\n\t");
                for(j=0;j<n;j++)
                        printf(" %d",b[i][j]);
           }
        printf("\n\n\t  =\n");
        for(i=0;i<m;i++)
           {
                printf("\n\t");
                for(j=0;j<n;j++)
                        printf(" %d",a[i][j]+b[i][j]);
  }
        printf("\nEnter 1 to Retry & 0 to Exit\n");
        scanf("%d",&m);
        if (m==1)
                goto RETRY;
   }

Tuesday, 25 December 2012

PROPERTIES OF A NUMBER


/* Properties Of A Number */
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
void main()
 {
  int n,c,sum=0,r,rev,flag=0,chk,i;
  printf("\n Enter the Number      :  ");
  scanf("%d",&n);
  chk=n;
 while(7)
 {
   printf("\n\n 1 Palindrome or Not\n 2 Amstrong or Not\n 3 Prime or Not  \n 4 Strange or Not \n 5 Perfect or Not \n 6 Exit  ");
   printf("\n\nEnter the choice  :  ");
   scanf("%d",&c);
   switch(c)
    {
     case 1:chk=n;
            rev=0;
            while(n>0)
             {
              r=n%10;
              rev=rev*10+r;
              n=n/10;
             }
            if(rev==chk)
             printf("\n\t Number is palindrome ");
            else
             printf("\n\t Number is not palindrome ");
             break;
    case 2:n=chk;
           rev=0;
           while(n!=0)
            {
             r=n%10;
             sum+=(r*r*r);
             n=n/10;
            }
             if(sum==chk)
             printf("\n\t Number is Amstrong");
            else
             printf("\n\t Number is not Amstrong");
             break;
     case 3:i=2;
            while(i<=n/2)
             {
              if(n%i==0)
               {
                flag=1;
                break;
                   }
              i++;
             }
            if(flag==1)
             printf("\n\t Number is not prime");
            else
             printf("\n\t Number is prime");
            break;
     case 4:n=chk;
            sum=0;
            i=0;
            while(n>0)
              {
               n=n/10;
               i++;
              }
            n=chk;
           while(n>0)
            {
             r=n%10;
             sum+=pow(r,i);
             n=n/10;
            }
             if(sum==chk)
             printf("\n\t Number is Strange");
            else
             printf("\n\t Number is not Strange ");
            break;
    case 5:n=chk;
           sum=0;
           for(i=0;i<=n/2;i++)
            {
             r=n%i;
             if(r==0)
              {
               sum+=i;
              }
             }
            if(sum==chk)
              printf("\n\t Number is perfect");
            else
              printf("\n\t Number is not perfect");
            break;
    case 6:exit(0);
    default:printf("Error in choice");
           break;
  }
 }
}