Question

(use only variables, expression, conditional statement and loop of c programming)

***C programming**

int sum_of_cubes(int n) {

}

int quadrant(int x, int y) {

}

3.1 int sum_of_cubes(int n) This function should return the sum of the cubes of the first n integers. For example, if n is 4, it should return 13 +23+ 39 +4°. There is a simple formula for the result: 3x = ((n + 1)) = + If n is zero the result will be zero. If n is negative the function should return -1, as we consider this to be an error case or invalid parameter value. 3.2 int quadrant(int x, int y) This function's parameters represent the (x, y) coordinates of a point in the Cartesian plane. It should return the number of the quadrant that the point lies in. We define the quadrant numbers as shown: 21 3 4 If either x or y or both) are zero, we consider that the point that is represented does not lie in any quadrant, so-1 should be returned. 3.3 int num_occurrences_of_digit(long num, int digit) This function should return the number of occurrences of the digit digit in the integer num (in its decimal representa- tion). In non-error cases the result will be zero or more. For example: there are two 2s in 2162019, and two Is. It has one 6, and no 8s. In decimal there are only ten digits, 0 through 9. There are no negative digits. (An entire number can be negative, but it does not contain individual negative digits.) If digit is not a valid digit with value in the range 0 through 9 the function should return -1. Although in some situations you could actually argue that zero has negative infinity digits, for purposes of this project we say that the number zero itself contains only one digit, which is zero. Note that num can be negative, the minus sign is not a digit. For example, there are two 2s in the number - 2162019. Leading zeros in num do not count or affect the results. When you are testing your function yourself, keep in mind from Chapter 3 in the text that leading zeros in an integer constant cause it to be in octal. If you forget this and pass in a number like 0123 the results will likely not be what you expect.

int num_occurrences_of_digit(long num, int digit) {
return 0;
}

Answer 1

// C program to create and test functions

#include <stdio.h>

#include <stdlib.h>

// function to calculate the sum of cubes of the first n integers

int sum_of_cubes(int n)

{

       if(n < 0) // if n is negative return -1(error)

             return -1;

       int sum = 0;

       int i;

       // loop to calculate the sum of cubes of first n integers

       for(i=1;i<=n;i++)

             sum += (i*i*i);

       return sum; // return the sum

}

// function to return the quadrant to which the point (x,y) belongs

int quadrant(int x, int y)

{

       if((x == 0) || (y == 0)) // if x or y is 0 return -1 (error)

             return -1;

       else if((x > 0) && (y > 0)) // both positive first quadrant

             return 1;

       else if((x > 0) && (y < 0)) // x positive y negative second quadrant

             return 4;

       else if((x < 0) && (y < 0)) // both negative third quadrant

             return 3;

       else // x negative y positive fourth quadrant

             return 2;

}

// function to return the number of occurrence of digit in num

int num_occurrence_of_digit(long num, int digit)

{

       if(digit < 0) //if digit < 0 return -1 (error)

             return -1;

       int count = 0;

       num = abs(num); // get the absolute value of num

       // loop to calculate the occurrence of digit in num

       while(num != 0)

       {

             int d = num%10; // get the last digit

             if(d == digit) // check if last digit is digit we want to search

                    count++; // increment the count

             num = num/10; // remove the last digit from num

       }

       return count; // return number of occurrence

}

int main(void) {

       // test the functions

       printf("\nsum_of_cubes(4) : %d ",sum_of_cubes(4));

       printf("\nsum_of_cubes(0) : %d ",sum_of_cubes(0));

       printf("\nsum_of_cubes(-2) : %d ",sum_of_cubes(-2));

       printf("\nquadrant(0,2) : %d ",quadrant(0,2));

       printf("\nquadrant(2,2) : %d ",quadrant(2,2));

       printf("\nquadrant(2,-2) : %d ",quadrant(2,-2));

       printf("\nquadrant(-2,2) : %d ",quadrant(-2,2));

       printf("\nquadrant(-2,-2) : %d ",quadrant(-2,-2));

       printf("\nnum_occurrence_digit(20162019,2) : %d ",num_occurrence_of_digit(20162019,2));

       printf("\nnum_occurrence_digit(-20162019,2) : %d ",num_occurrence_of_digit(-20162019,2));

       printf("\nnum_occurrence_digit(-20162019,-1) : %d ",num_occurrence_of_digit(-20162019,-1));

               return 0;

}

//end of program

Output:

sum_of_cubes (4) : 100 sum_of_cubes (0) : 0 sum_of_cubes (-2): -1 quadrant(0, 2) : -1 quadrant(2,2) : 1 quadrant(2,-2) : 4 quadrant(-2,2) : 2 quadrant(-2,-2) : 3 num_occurrence_digit(20162019,2) : 2 num_occurrence_digit(-20162019,2) : 2 num_occurrence_digit(-20162019,-1) : -1