Programming Articles - Page 1104 of 3363

Problem Statement Given a binary number, you have to write a C program to find 2'c complements for given binary number. 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’ ... 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

ProblemFind the greatest common divisor (GCD) for the given two numbers by using the recursive function in C programming language.SolutionThe solution to find the greatest common divisor (GCD) for the given two numbers by using the recursive function is as follows −AlgorithmRefer an algorithm given below to find the greatest common divisor (GCD) for the given two numbers by using the recursive function.Step 1 − Define the recursive function.Step 2 − Read the two integers a and b.Step 3 − Call recursive function.a. if i>j b. then return the function with parameters i, j c. if i==0 d. then return ... Read More

ProblemThe program to calculate the sum of the following expressionSum=1-n^2/2!+n^4/4!-n^6/6!+n^8/8!-n^10/10!User has to enter the value of n at runtime to calculate the sum of the series by using the predefined function power present in math.h library function.SolutionIt is explained below how to calculate sum of series using predefined function.AlgorithmRefer an algorithm given below to calculate sum of series by using the predefined function.Step 1 − Read the num valueStep 2 − Initialize fact = 1, sum = 1 and n =5Step 3 − for i= 1 to n   a. compute fact= fact*i    b. if i %2 = 0    c. ... Read More

ProblemWrite a C program to display all the prime numbers between 1 and n is a value given by the user at run time.SolutionC program to display all the prime numbers between 1 and n is a value given by the user at run time is explained below −AlgorithmGiven below is an algorithm to display all the prime numbers between 1 and n is a value given by the user at run time.Step 1 − Read n value.Step 2 − Initialize count = 0Step 3 − for i = 2 to n   a. for j = 1 to i    b. ... Read More

A function is a self-contained block that carries out a specific well-defined task.Types of functionsFunctions are broadly classified into two types which are as follows −Predefined functionsUser defined functionsCommunications among functionsFunctions communicate among themselves by using arguments and return value.Farm of ‘C’ function for return-datatype function name (argument list) is as follows −{    local variable declarations;    executable statements(s);    return (expression); }For Example, void mul (int x, int y).{    int p;    p=x*y;    printf(“product = %d”, p); }Prototype functionsThese functions can be done in two ways as explained below −Create a copy of the function declaration ... Read More

A file is a physical storage location on disk and a directory is a logical path which is used to organise the files. A file exists within a directory.The three operations that we can perform on file are as follows −Open a file.Process file (read, write, modify).Save and close file.ExampleConsider an example given below −Open a file in write mode.Enter statements in the file.The input file is as follows −Hi welcome to my world This is C programming tutorial From tutorials PointThe output is as follows −Number of characters = 72Total words = 13Total lines = 3ProgramFollowing is the C ... Read More

Here, we will print hollow rectangle star(*) pattern by using for loop in C programming language.Consider an example given below −InputEnter number of rows: 5OutputThe output is as follows −***** *    * *    * *    * *****AlgorithmAn algorithm is given below to explain how to print hollow rectangle star(*) pattern by using for loop.Step 1 − Input number of rows to print at runtime.Step 2 − Use outer for loop for rows from 1 to N.for(i=1; i