Monday, September 3, 2012

area under a curve in Java Program code :: C Program Code ::Answer :: Aspiration 2020 :: Question number 3 :: 2012

area under a curve in C Program Code :: Answer :: Aspiration 2020 :: Question number 3 :: 2012
Solution :
// hackerx sasi kamaraj college of engineering and technology 2910007 C Program
#include <stdio.h>
float    start_point,            /* GLOBAL VARIABLES */
    end_point,
    total_area;
int    numtraps;
main( )
{
   void    input(void);
   float    find_area(float a,float b,int n); /* prototype */
   print("AREA UNDER A CURVE");
   input( );
   total_area = find_area(start_point, end_point, numtraps);
   printf("TOTAL AREA = %f", total_area);
}
void input(void)
{
   printf("\n Enter lower limit:");
   scanf("%f", &start_point);
   printf("Enter upper limit:");
   scanf("%f", &end_point);
   printf("Enter number of trapezoids:");
   scanf("%d", &numtraps);
}
float find_area(float a, float b, int n)
{
      floatbase, lower, h1, h2;    /* LOCAL VARIABLES */float function_x(float x);    /* prototype */float trap_area(float h1,float h2,floatbase);/*prototype*/base = (b-1)/n;
         lower = a;
       for(lower =a; lower <= b-base; lower = lower + base)
    {
    h1  =  function_x(lower);
             h1  =  function_x(lower + base);
             total_area += trap_area(h1, h2, base);
    }
return(total_area);
    float trap_area(float height_1,float height_2,floatbase)
        {
       float area;    /* LOCAL VARIABLE */
       area = 0.5 * (height_1 + height_2) * base;
         return(area);
    }
    float function_x(float x)
    {
         /* F(X) = X * X + 1 */return(x*x + 1);
    }
   
Output
    AREA UNDER A CURVE
    Enter lower limit: 0
    Enter upper limit:  3
    Enter number of trapezoids: 30
    TOTAL AREA   =  12.005000
    AREA UNDER A CURVE
    Enter lower limit: 0
    Enter upper limit: 3
    Enter number of trapezoids: 100
    TOTAL AREA = 12.000438

Solution in java ::

// hackerx sasi kamaraj college of engineering and technology 2910007 java Program


//The answer to be precise... although the type was a double, it rounds off the answer. Any help would be //appreciated...
//java code:  1. :: try this or the another one below this one
//Program code ::

public class Reimann 
 { 
     private static double integral(String s, double[] descriptors, double lb, double ub) 
     { 
   
         double area = 0; // Area of the rectangle 
         double sumOfArea = 0; // Sum of the area of the rectangles 
         double oldSumOfArea = 0; 
         double width = ub - lb;  
         boolean firstPass = true; 
           
         while ( (Math.abs((oldSumOfArea - sumOfArea) / sumOfArea) > .0001) || firstPass ) 
         { 
               
             System.out.println((Math.abs((oldSumOfArea - sumOfArea) / sumOfArea) > .0001) || firstPass); 
             if (s.equals("poly")) 
            { 
                 for (int i = 1; i <= ((ub - lb) / width); i++) // represents # of rectangles 
                 { 
                     for (int j = 0; j < descriptors.length; j++) // Goes through all the coefficients 
                     {    
                         area = width * descriptors[j] * Math.pow ( (double)( (i * width + lb + (i -1.0) * width + lb) / 2.0 ), j);  
                         /*Above code computes area of each rectangle */
   
                         sumOfArea += area; 
  
                     } 
                 } 
             } 
             width = width / 2; 
             firstPass = false; 
             oldSumOfArea = sumOfArea;        
         } 
         return sumOfArea; 
     } 
       
     /*private static void runMyTests() 
     { 
         assert ( integral() <= 48.00001 ) && ( integral() >= 47.99999 ); 
     }*/
   
     public static void main (String [] args) 
     { 

         double lb = Double.parseDouble(args[args.length -2]); 
         double ub = Double.parseDouble(args[args.length -1]); 
   
         double[] coefficients = new double[args.length - 3]; 
   
         if (args[0].equals("poly")) 
        { 
             for (int i = 1; i < args.length - 2; i++) 
             { 
                coefficients[i-1] = Double.parseDouble(args[i]); 
            } 
   
             System.out.println(integral("poly", coefficients, lb, ub)); 
         } 
     } 
 }



Java  Program 2  ::

public class Riemann 
 { 
     private static double integral(String s, double[] descriptors, double lb, double ub) 
     { 
   
         double area = 0; // Area of the rectangle 
         double sumOfArea = 0; // Sum of the area of the rectangles 
         double oldSumOfArea = 0; 
         double width = ub - lb;  
         boolean firstPass = true; 
           
         while ( (Math.abs((oldSumOfArea - sumOfArea) / sumOfArea) > .0001) || firstPass ) 
         { 
               
             System.out.println((Math.abs((oldSumOfArea - sumOfArea) / sumOfArea) > .0001) || firstPass); 
             if (s.equals("poly")) // Statement for polynomial 
             { 
                 for (int i = 1; i <= ((ub - lb) / width); i++) // represents # of rectangles 
                 { 
                     for (int j = 0; j < descriptors.length; j++) // Goes through all the coefficients 
                     {    
                         area = width * descriptors[j] * Math.pow ( (double)( (i * width + lb + (i -1.0) * width + lb) / 2.0 ), j);   
                         /*Above code computes area of each rectangle */
   
                         sumOfArea += area; 
   
                     } 
                } 
            } 
   
             else if (s.equals("sin")) // Statement for sin 
             { 
                 for (int i = 1; i <= ((ub - lb) / width); i++) // represents # of rectangles 
                 { 
                     for (int j = 0; j < descriptors.length; j++) // Goes through all the coefficients 
                     {    
                         area = width * descriptors[j] * Math.sin(Math.toRadians(( (double)( (i * width + lb + (i -1.0) * width + lb) / 2.0 ))));   
                         /*Above code computes area of each rectangle */
   
                         sumOfArea += area; 
   
                     } 
                 } 
             } 
   
             else if (s.equals("cos")) // Statement for cos 
             { 
                 for (int i = 1; i <= ((ub - lb) / width); i++) // represents # of rectangles 
                 { 
                     for (int j = 0; j < descriptors.length; j++) // Goes through all the coefficients 
                     {    
                         area = width * descriptors[j] * Math.cos(Math.toRadians(( (double)( (i * width + lb + (i -1.0) * width + lb) / 2.0 ))));   
                         /*Above code computes area of each rectangle */
   
                         sumOfArea += area; 
   
                     } 
                } 
             } 
   
             width = width / 2; 
             firstPass = false; 
             oldSumOfArea = sumOfArea;        
         } 
   
         return sumOfArea; 
     } 
       
     /*private static void runMyTests() 
     { 
         assert ( integral() <= 48.00001 ) && ( integral() >= 47.99999 ); 
     }*/
   
     public static void main (String [] args) 
     { 
         double lb = Double.parseDouble(args[args.length -2]); 
         double ub = Double.parseDouble(args[args.length -1]); 
   
         double[] coefficients = new double[args.length - 3]; 
   
         if (args[0].equals("poly")) 
         { 
             for (int i = 1; i < args.length - 2; i++) 
             { 
                coefficients[i-1] = Double.parseDouble(args[i]); 
             } 
   
            System.out.println(integral("poly", coefficients, lb, ub)); 
         } 
   
         else if (args[0].equals("sin")) 
         { 
             for (int i = 1; i < args.length - 2; i++) 
             { 
                 coefficients[i-1] = Double.parseDouble(args[i]); 
             } 
   
             System.out.println(integral("sin", coefficients, lb, ub)); 
         } 
   
         else if (args[0].equals("cos")) 
        { 
             for (int i = 1; i < args.length - 2; i++) 
            { 
                 coefficients[i-1] = Double.parseDouble(args[i]); 
             } 
  
             System.out.println(integral("cos", coefficients, lb, ub)); 
         } 
     } 
 }



Question ::

Area Under Curve

Write a program to find the area under the curve y = f(x) between x = a and x = b, integrate y = f(x) between the limits of a and b.
The area under a curve between two points can be found by doing a definite integral between the two points.

Instructions to work with Open PBT Client:

  1. Specify the work directory path in the 'Work Directory Path' field. The path should correspond to your solution project directory.
  2. Download the support files by clicking the Get Dev Files.
  3. You will find the following three folders:
    • bin
    • src
    • lib
    in your work directory.
  4. Code the solution in  . java file inside the src folder
  5. All required files will be downloaded to your work directory. Creating additional files is strongly discouraged.
The Prototype of the Function is :
public double getAreaUnderCurve(Term[] equation, int limit1, int limit2)
  • Where equation represents number of Term in a equation with x_pow and coeff of X
  • Where limit1 and limit2 are the 2 given points to find the area.
  • The function getAreaUnderCurve() return the area of type double corrected to 4 decimal places.(eg : 5.2704. )
Example 1
Input :

    Term[] equation = x + 3(x^2);     int limit1 = 4;     int limit2 = 8;
    where, Term[] equation = new Term[2]
    func[0] = new Term(1,1)
    func[1] = new Term(2,3)
Output :

The function getAreaUnderCurve() returns 472.0.
Explanation :

Example 2
Input :

    Term[] equation = x;     int limit1 = 1;     int limit2 = 1;
Output :

The function getAreaUnderCurve() returns 0.0
Example 3
Input :

    Term[] equation = x;     int limit1 = 2;     int limit2 = 1;
Output :

The function getAreaUnderCurve() returns 1.5
For Java solutions
Package Name - test.areaundercurve
File Name - AreaUnderCurve.java
Class Name - AreaUnderCurve
Function Name - public double getAreaUnderCurve(Term[] equation, int limit1, int limit2)

General Instructions

    
The package names, class names, method signatures are to be used as mentioned in the problem statement. Do not use your own names or change the method signatures and fields. You can add any number of additional methods.
    
The function(s) defined above would be the only functions that would be tested. If you add a main() function for your own testing, that would not be tested.
    
Command line options for the main() function are not supported currently.


--
Hackerx Sasi
Don't ever give up.
Even when it seems impossible,
Something will always
pull you through.
The hardest times get even
worse when you lose hope.
As long as you believe you can do it, You can.

But When you give up,
You lose !
I DONT GIVE UP.....!!!


In three words I can sum up everything I've learned about life - it goes on......
with regards
prem sasi kumar arivukalanjiam

No comments:

Post a Comment

Slider

Image Slider By engineerportal.blogspot.in The slide is a linking image  Welcome to Engineer Portal... #htmlcaption

Tamil Short Film Laptaap

Tamil Short Film Laptaap
Laptapp

Labels

About Blogging (1) Advance Data Structure (2) ADVANCED COMPUTER ARCHITECTURE (4) Advanced Database (4) ADVANCED DATABASE TECHNOLOGY (4) ADVANCED JAVA PROGRAMMING (1) ADVANCED OPERATING SYSTEMS (3) ADVANCED OPERATING SYSTEMS LAB (2) Agriculture and Technology (1) Analag and Digital Communication (1) Android (1) Applet (1) ARTIFICIAL INTELLIGENCE (3) aspiration 2020 (3) assignment cse (12) AT (1) AT - key (1) Attacker World (6) Basic Electrical Engineering (1) C (1) C Aptitude (20) C Program (87) C# AND .NET FRAMEWORK (11) C++ (1) Calculator (1) Chemistry (1) Cloud Computing Lab (1) Compiler Design (8) Computer Graphics Lab (31) COMPUTER GRAPHICS LABORATORY (1) COMPUTER GRAPHICS Theory (1) COMPUTER NETWORKS (3) computer organisation and architecture (1) Course Plan (2) Cricket (1) cryptography and network security (3) CS 810 (2) cse syllabus (29) Cyberoam (1) Data Mining Techniques (5) Data structures (3) DATA WAREHOUSING AND DATA MINING (4) DATABASE MANAGEMENT SYSTEMS (8) DBMS Lab (11) Design and Analysis Algorithm CS 41 (1) Design and Management of Computer Networks (2) Development in Transportation (1) Digital Principles and System Design (1) Digital Signal Processing (15) DISCRETE MATHEMATICS (1) dos box (1) Download (1) ebooks (11) electronic circuits and electron devices (1) Embedded Software Development (4) Embedded systems lab (4) Embedded systems theory (1) Engineer Portal (1) ENGINEERING ECONOMICS AND FINANCIAL ACCOUNTING (5) ENGINEERING PHYSICS (1) english lab (7) Entertainment (1) Facebook (2) fact (31) FUNDAMENTALS OF COMPUTING AND PROGRAMMING (3) Gate (3) General (3) gitlab (1) Global warming (1) GRAPH THEORY (1) Grid Computing (11) hacking (4) HIGH SPEED NETWORKS (1) Horizon (1) III year (1) INFORMATION SECURITY (1) Installation (1) INTELLECTUAL PROPERTY RIGHTS (IPR) (1) Internal Test (13) internet programming lab (20) IPL (1) Java (38) java lab (1) Java Programs (28) jdbc (1) jsp (1) KNOWLEDGE MANAGEMENT (1) lab syllabus (4) MATHEMATICS (3) Mechanical Engineering (1) Microprocessor and Microcontroller (1) Microprocessor and Microcontroller lab (11) migration (1) Mini Projects (1) MOBILE AND PERVASIVE COMPUTING (15) MOBILE COMPUTING (1) Multicore Architecute (1) MULTICORE PROGRAMMING (2) Multiprocessor Programming (2) NANOTECHNOLOGY (1) NATURAL LANGUAGE PROCESSING (1) NETWORK PROGRAMMING AND MANAGEMENT (1) NETWORKPROGNMGMNT (1) networks lab (16) News (14) Nova (1) NUMERICAL METHODS (2) Object Oriented Programming (1) ooad lab (6) ooad theory (9) OPEN SOURCE LAB (22) openGL (10) Openstack (1) Operating System CS45 (2) operating systems lab (20) other (4) parallel computing (1) parallel processing (1) PARALLEL PROGRAMMING (1) Parallel Programming Paradigms (4) Perl (1) Placement (3) Placement - Interview Questions (64) PRINCIPLES OF COMMUNICATION (1) PROBABILITY AND QUEUING THEORY (3) PROGRAMMING PARADIGMS (1) Python (3) Question Bank (1) question of the day (8) Question Paper (13) Question Paper and Answer Key (3) Railway Airport and Harbor (1) REAL TIME SYSTEMS (1) RESOURCE MANAGEMENT TECHNIQUES (1) results (3) semester 4 (5) semester 5 (1) Semester 6 (5) SERVICE ORIENTED ARCHITECTURE (1) Skill Test (1) software (1) Software Engineering (4) SOFTWARE TESTING (1) Structural Analysis (1) syllabus (34) SYSTEM SOFTWARE (1) system software lab (2) SYSTEMS MODELING AND SIMULATION (1) Tansat (2) Tansat 2011 (1) Tansat 2013 (1) TCP/IP DESIGN AND IMPLEMENTATION (1) TECHNICAL ENGLISH (7) Technology and National Security (1) Theory of Computation (3) Thought for the Day (1) Timetable (4) tips (4) Topic Notes (7) tot (1) TOTAL QUALITY MANAGEMENT (4) tutorial (8) Ubuntu LTS 12.04 (1) Unit Wise Notes (1) University Question Paper (1) UNIX INTERNALS (1) UNIX Lab (21) USER INTERFACE DESIGN (3) VIDEO TUTORIALS (1) Virtual Instrumentation Lab (1) Visual Programming (2) Web Technology (11) WIRELESS NETWORKS (1)

LinkWithin