Found 1452 Articles for C

ProblemImplement Euclid’ s algorithm to find the greatest common divisor (GCD) and least common multiple (LCM) of two integers and to output the results along with the given integers.SolutionThe solution to implement Euclid’ s algorithm to find the greatest common divisor (GCD) and least common multiple (LCM) of two integers is as follows −The logic used to find GCD and LCM is as follows −if(firstno*secondno!=0){    gcd=gcd_rec(firstno, secondno);    printf("The GCD of %d and %d is %d", firstno, secondno, gcd);    printf("The LCM of %d and %d is %d", firstno, secondno, (firstno*secondno)/gcd); }The called function is as follows −int gcd_rec(int ... Read More

An operator is used to describe an operation applied to one or several objects. It is mainly meaningful in expressions, but also in declarations. It is generally a short sequence using non-alphanumeric characters.A punctuator is used to separate or terminate a list of elements.C operators and punctuators are as follows −...   &&  -=  >=   ~   +   ;  ] >   %   ,   <  ^ >>=   *=  /=  ^=   &   -   =  { !=    ++    | %=    +=  

Regression is a predictive modelling technique that investigates the relationship between a dependent and non-dependent variable.Polynomial regressionIt is a form of regression analysis that shows the relationship between an independent variable x and the dependent variable y that is modelled a nth degree polynomial in x.ExampleFollowing is the C program to compute the polynomial regression algorithm −#include #include #include main(){    int i,j,k,m,n;    float x[20],y[20],u,a[10],c[20][20],power,r;    printf("enter m,n:");    scanf("%d%d",&m,&n);    for(i=1;i

ProblemWrite a program to implement linear regression algorithm.User has to enter total number of values.SolutionThe solution to compute the linear regression in C programming language is as follows −Linear regression finds the relationship between two variables by connecting a linear equation to the observed data. One variable is to be an explanatory variable, and the other is a dependent variable.The logic with regards to linear regression is explained below −for(i=0;i

In C programming language, bubble sort is the simplest sorting technique and is also called as an exchange sort.Procedure for bubble sortCompare the first element with the remaining elements in the list and exchange(swap) them, if they are not in order.Repeat the same for other elements in the list until all the elements gets sorted.AlgorithmGiven below is an algorithm to sort a given list of numbers in an ascending order by using the bubble sort technique −Step 1 − StartStep 2 − Take list(array), numStep 3 − readlist(list, num)Step 4 − printlist(list, num)Step 5 − bub_sort(list, num)Step 6 − printlist(list, num)readlist ... Read More

Given below is an algorithm to convert roman numbers to decimal numbers in C language −AlgorithmStep 1 − StartStep 2 − Read the roman numeral at runtimeStep 3 − length: = strlen(roman)Step 4 − for i = 0 to length-1 do      Step 4.1 − switch(roman[i])          Step 4.1.1 − case ‘m’:          Step 4.1.2 − case ‘M’:               Step 4.1.2.1 − d[i]: =1000          Step 4.1.3 − case ‘d’:               Step 4.1.4 − case ‘D’:          ... Read More

Consider an example given below −ExampleThe input is as follows:Enter a binary number:10010001The output is as follows:1's complement of 10010001 is 011011102's complement of 10010001 is 01101111AlgorithmRefer an algorithm to find 2’c complements for a given binary number.Step 1 − Start.Step 2 − Read the binary number at runtime.Step 3 − Copy the binary number to strdp.Step 4 − len: = strlen(str)Step 5 − For i = 0 to len-1 do     Step 5.1 − if str[i] == ‘1’ then        Step 5.1.1 − str[i] == ‘0’     Step 5.2 − Else        Step 5.2.1 − ... Read More

ProblemWrite a program to read two numbers, x and n, and then compute the sum of the geometric progression.1+x+x2+x3+x4+……….+xnAnd then, print x, n and sum.SolutionThe solution to compute the geometric progression in C programming language is given below −AlgorithmRefer an algorithm to compute the geometric progression.Step 1 − StartStep 2 − RepeatStep 3 − Read values for x and n at runtimeStep 4 − If n > 0 then     Step 4.1: for i = 0 to n do       Step 4.1.1: sum = sum +pow(x, i)       Step 4.1.2: i = i+1     Step 4.2: print x, ... Read More

ProblemWrite the user functions to Delete N – Characters from Position in a given string. Here, the string is given by the user at runtime.SolutionThe solution to delete n characters in a given string is as follows −AlgorithmRefer an algorithm to delete n characters in a given string.Step 1 − StartStep 2 − Read string at runtimeStep 3 − Read position from where we need to delete the charactersStep 4 − Read n, number of characters to delete from that positionStep 5 − Call the function deletestr(str, p, n) jump to step 7Step 6 − StopStep 7 − Called function deletestr(str, ... Read More

ProblemFind the greatest common divisor (GCD) for the given two numbers by using the non-recursive function.SolutionIt is explained below how to find the greatest common divisor (GCD) for the given two numbers by using the non-recursive function.AlgorithmRefer an algorithm given below to find the greatest common divisor (GCD) for the given two numbers by using the non-recursive function.Step 1 − StartStep 2 − Read the integers a and bStep 3 − Call the function G=GCD(a, b) step 6Step 4 − Print G valueStep 5 − StopStep 6 − Called function: GCD(a, b)a. Initialize the i=1, j, remainder b. Remainder=i-(i/j*j) c. ... Read More