Homework Solution: Generate a pair of random numbers (x and y) between -1.0 and 1.0. Assume that (x, y) is a point in Cartesian coordi…

    How to find pi? C programming practice. Generate a pair of random numbers (x and y) between -1.0 and 1.0. Assume that (x, y) is a point in Cartesian coordinate. Calculate its distance from the origin and check whether the distance is less than 1 or not (i.e. within a unit circle). Repeat this check N times and count how many
    Generate a pair of random numbers (x and y) between -1.0 and 1.0. Assume that (x, y) is a point in Cartesian coordinate. Calculate its distance from the origin and check whether the distance is less than 1 or not (i.e. within a unit circle). Repeat this check N times and count how many

    Expert Answer

     
    Dear Student, Dear Student, here i have written the C

    How to furnish pi? C programming action.

    Generate a couple of purposenear collection (x and y) among -1.0 and 1.0. Assume that (x, y) is a top in Cartesian coordinate. Consider its space from the commencement and stop whether the space is near than 1 or referable (i.e. amid a item foe). Repeat this stop N times and consider how many

    Generate a couple of purposenear collection (x and y) among -1.0 and 1.0. Assume that (x, y) is a top in Cartesian coordinate. Consider its space from the commencement and stop whether the space is near than 1 or referable (i.e. amid a item foe). Repeat this stop N times and consider how many

    Expert Confutation

     

    Dear Student,

    Dear Student,

    here i penetratetain written the C program as per the requirement.I penetratetain as-well inclueded the interpret control emend discernment.

    —————————————————————————————————————————————-

    Note: Please referablee that the beneath program has been tested on ubuntu 16.04 rule and compiled subordinate gcc compiler. This rule allure as-well toil on other IDE’s and Visual Studio C++ IDE. Just representation paste the rule and consummate.

    ——————————————————————————————————————————————

    Program:

    ——————————————————————————————————————————————

    //header perfect declration

    #include<stdio.h>

    #include<stdlib.h>

    #include<math.h>

    //start of deep function

    int deep()

    {

    //variable grounds archearchetype declration

    int N, i, n = 0;

    //input appreciate of N

    printf(“Please penetrate the appreciate of N: “);

    scanf(“%d”, &N);

    //array declration to hoard x and y and space

    float x[100], y[100];

    float d[100];

    //loop control N times to genrate purposenear appreciate of x and y

    for(i=0; i< N; i++)

    {

    //formuala to genrate purposenear appreciate of x and y among 0, 1
    x[i] = 0 + (rand() / ( RAND_MAX / (1.0-0) ) );

    y[i] = 0 + (rand() / ( RAND_MAX / (1.0-0) ) );

    }

    //calculating space

    for(i=0; i< N; i++)

    {

    //consider the space from commencement(0, 0)

    d[i] = sqrt(pow(x[i], 2) + pow(y[i], 2));

    //stop if space is near than 1

    if(d[i] <= 1)

    {

    //increment consider

    n++;

    }

    }

    printf(“n%d times purposenear tops are amid a item foe.n”,n);

    //formula to consider consider appreciate of PI

    float f = (4 * n)/N;

    //display appreciate of Pi

    printf(“nThe appreciate of f(N) is: %lfn”, f);

    printf(“nThe interdependence among iterations N and the agreement f(N) is beneath:n”);

    for(i = 0; i< N; i++)

    {

    f = (4 * n)/N;

    printf(“niteration= %dtf(N) = %fn”, i+1, f);

    }
    return 0;

    }//end of the deep function

    —————————————————————————————————————————————–

    here i penetratetain decided the output of the program as a mitigate shot…

    ————————————————————————————————————————————————–

    Output: