WAP of Simpson3/8 in C

/* WAP of Simpson3/8 in C */

#include<stdio.h>
#include<conio.h>
void main()
{
 float x[100],y[100],value2,value,fx,h;
 int i,size;
 clrscr();
 printf("How many value you want to enter: ");
 scanf("%d",&size);

 for(i=0; i<size; i++)
 {
  printf("Enter elements of x[%d]:\n",i);
  scanf("%f",&x[i]);
  printf("Enter elements of y[%d]:\n",i);
  scanf("%f",&y[i]);
 }
 h = x[2]-x[1];
 printf("\nh = %f",h);
 for(i=1; i<size-1; i++)
 {
  if(i%3==0)
   value2 += 2*y[i];

  else
   value += 3*y[i];
 }
 printf("value2 = %f \n value = %f",value2, value);
 fx = ( h*3)/8 * ( y[0] + y[size-1] + value + value2 );
 printf("\nf(x)= %f",fx);
 getch();
}

WAP of Switch case in Java

/*WAP to capture the two integer values from user and perform following actions according to user Requierement
1. Addition
2. Substraction
3. Multiplication
4. Division
5. Exit
*/

import java.lang.*;
import java.io.*;
class oprations
{
 public void InputMsg()
 {System.out.println("Enter Two Integer numbers. ");}
 
 public void continueMsg()
 {System.out.println("Do you want to Continue. \n1. Yes \n0. No");}
 
 public static void main (String args[]) throws IOException
 {
  int a , b, choice = -1 ;
  
  do
  {
    System.out.println("Choose a Opration");
    System.out.println("1. Addition \n2. Substraction \n3. Multiplication \n4. Division \n5. Exit \nYour Choice: ");

    BufferedReader br = new BufferedReader(new 
         InputStreamReader(System.in));
    oprations e = new oprations();
    choice = Integer.parseInt(br.readLine());
    int repeate = -1;
    
   do
   {
    
    switch(choice)
    {
     
     case 1: e.InputMsg();
        a = Integer.parseInt(br.readLine());
        b = Integer.parseInt(br.readLine());
     System.out.println("Addition = "+(a+b));
    
     e.continueMsg();
     repeate = Integer.parseInt(br.readLine());
     break;
     case 2: e.InputMsg();
        a = Integer.parseInt(br.readLine());
        b = Integer.parseInt(br.readLine());
     System.out.println("Substraction = "+(a-b));
     
     e.continueMsg();
     repeate = Integer.parseInt(br.readLine());
     break;
     case 3: e.InputMsg();
        a = Integer.parseInt(br.readLine());
        b = Integer.parseInt(br.readLine());
     System.out.println("Multiplication = "+(a*b));
     
     e.continueMsg();
     repeate = Integer.parseInt(br.readLine());
     break;
     case 4: e.InputMsg();
        a = Integer.parseInt(br.readLine());
        b = Integer.parseInt(br.readLine());
     System.out.println("Division = "+(a/b));
     
     e.continueMsg();
     repeate = Integer.parseInt(br.readLine());
     break;
     case 5: System.out.println("BYE!"); 
     break;
     default: System.out.println("Invalid Input.");
    }
    
   }while(repeate != 0 && choice != 5);
   
  }while(choice != 5); 
 }
 
}

WAP of Bubble Short in C++

/*WAP of Bubble Short in C++*/

#include<iostream.h>
#include<conio.h>

class bubbleShort
{
 int size, a[100];
 public:
 void getdata();
 void sorting();

};
void bubbleShort :: getdata()
{
 int i;
 cout << "\nEnter total number of elements: " ;
 cin >> size;

 
 cout << "\nEnter elements: ";
 for(i=0;i<size;i++)
  cin >> a[i];

 cout << "\nEntered elements are: ";
 for(i=0;i<size;i++)
  cout << a[i] << " ";

}
void bubbleShort :: sorting()
{

 int i,j,temp;
 for(i=1;i<size;i++)
 {
  for(j=0;j<size-i;j++)
  {
   if(a[j]>a[j+1])
   {
    temp=a[j];
    a[j]=a[j+1];
    a[j+1]=temp;
   }
  }
 }
 
 cout << "\nElements After Shorting:";
 for(i=0;i<size;i++)
  cout << "\n" << a[i];

}

void main()
{
 clrscr();
 bubbleShort bsrch;
 bsrch.getdata();
 bsrch.sorting();

 getch();
}

WAP of Linear Search in C++

/*WAP of Linear Search in C++*/

#include<iostream.h>
#include<conio.h>

class linearSearch
{
 int size, a[100],item;
 public:
 void setData();
 void searchItem();

};
void linearSearch :: setData()
{
 int i;
 cout << "\nEnter total number of elements: " ;
 cin >> size;

 
 cout << "\nEnter elements: ";
 for(i=0;i> a[i];

 cout << "\nEnter Item which you want to find: ";
 cin >> item;

}
void linearSearch :: searchItem()
{
 int k=1, loc=0;
 while(loc==0 && k<=size)
 {
  if(item == a[k-1])
  {
   loc = k;
  }
  k +=1;
 }
 if(loc==0)
  cout << "\n" << item << " isn't Found.";
 else
  cout << "\n" << item << " at Location " << loc;
}

void main()
{
 clrscr();
 linearSearch bsrch;
 bsrch.setData();
 bsrch.searchItem();

 getch();
}