We will explain each code step by step for a clear understanding of how it works.<\/p>\n
Basic C Programs<\/h2>\n
A good programmer has great command over the concepts of a language as well as the skills required to develop algorithms to solve complex problems that come through rigorous practice.<\/p>\n
We are going to discuss mentioned Basic C Programs to reach out to them and explore its structure & syntax through an example. We will cover each and every topic related to them and will let you know about the small things related to them.<\/p>\n
After reading them, I am sure that your concepts for these basic C programs would be crystal clear & it would not make any trouble in the future to you.<\/p>\n
Let us begin our discussion by trying to understand what is the Fibonacci series?<\/p>\n In mathematics, a Fibonacci series refers to the sequence in which the next element is equal to the sum of its two preceding elements<\/em>.<\/p>\n Therefore, the first two numbers in the sequence need to be specified.<\/p>\n Generally, the first term is 0 and the second is 1.<\/p>\n The Fibonacci series goes on like this up till n numbers:<\/p>\n 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584\u2026. N<\/p>\n Before discussing the example, revise the Basic Structure of C Program<\/a><\/strong><\/em><\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Elucidation<\/span><\/strong><\/p>\n Declaration:<\/strong> We declare the variable \u2018number_of_terms\u2019 to find the terms till which the series is to be displayed, the variable \u2018iteration\u2019 to traverse the for loop. Then, we initialize the first and second term as 0 and 1 respectively are their values are fixed.<\/p>\n Input:<\/strong> We take the input of the number of terms to be entered by the user till which he wishes to display the Fibonacci series.<\/p>\n Logic:\u00a0<\/strong>We initialize the variable \u2018iteration\u2019 to 1. We make the loop run till the number of terms in the series and print the first term and second term.<\/p>\n Do you know how to declare Variables in C<\/a>?<\/strong><\/em><\/p>\n Here is a code in C to display the Fibonacci series up till a given number:<\/strong><\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Elucidation<\/strong><\/p>\n Declaration:<\/strong> We declare a variable limit to find the number till which the Fibonacci series is to be displayed. We initialize the variables \u2018term1\u2019 and \u2018term2\u2019 to 0 and 1 respectively as their values are constant. We initialize next_term to 0 for the traversal of the while loop.<\/p>\n Input:<\/strong> We take the input of the limit by the user till which he wishes to display the Fibonacci series.<\/p>\n Logic:\u00a0<\/strong>We store the sum of the first two terms, that is, 0 and 1 in the variable \u2018next_term\u2019.<\/p>\n Before we begin our discussion on prime numbers, it is important to understand conditional statements and operators in C<\/a><\/strong><\/em>.<\/p>\n A prime number is nothing but a natural number (1, 2, 3, 4\u2026..) with its only factors as 1 and the number itself with the exclusion of 1.<\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Elucidation<\/strong><\/p>\n Declaration:<\/strong> We declare the variable \u2018number\u2019 to check if it is prime or not and \u2018iteration\u2019 to traverse the for loop. We initialize the variable \u2018flag\u2019 to 0 used for indication of the prime or non-prime number<\/p>\n Input:<\/strong> We take the input of the number entered by the user to check if it is prime or not.<\/p>\n Logic:\u00a0<\/strong>Our main aim is to check if there is any factor of the number other than 1 or the number itself in the range (1, number). If there exists a number such that it divides the number, then the number is non-prime.<\/p>\n Explanation Through Dry Run:<\/strong><\/p>\n Consider the value of the variable number = 19.<\/p>\n Since iteration starts from 2 till the integral division of 19\/2 = 9, therefore:<\/p>\n Iteration would take the values: 2, 3, 4, 5, 6, 7, 8 and 9.<\/p>\n Checking the condition if number % iteration is divisible with each other, that is,<\/p>\n 19 % 2 \u2260 0 Since these conditions are not satisfied, we conclude the number 19 is not non-prime which means that it is a prime number.<\/p>\n In order to come out of the if-condition, we use the break statement. Therefore, the flow of control is transferred to the else condition that indicates that the number 19 is prime.<\/p>\n Here is a program in C that helps you find a prime number in a given range:<\/strong><\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Elucidation<\/span><\/strong><\/p>\n Declaration:<\/strong> We declare the variables \u2018lower_limit\u2019 and \u2018upper_limit \u2019to specify the range between which we are supposed to find all the prime numbers.<\/p>\n Input:<\/strong> We take the input of the lower limit and upper limit from the user to display the prime numbers within that range.<\/p>\n Logic:\u00a0<\/strong>Our main aim is to check if there is any factor of the numbers other than 1 or the number itself in the range (lower_limit, upper_limit). If there exists a number such that it divides the number, then the number is non-prime.<\/p>\n Before we begin our discussion on Palindromes, it is important to understand iteration, conditional statements, operators, and\u00a0strings in C<\/a><\/strong><\/em>.<\/p>\n A palindrome in C is nothing but either a number, word or phrase that is read in a similar fashion forward as well as backward.<\/p>\n For instance,<\/p>\n We will discuss 2 Basic C programs based on Palindromes:<\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Elucidation<\/strong><\/p>\n Declaration:<\/strong> We declare the variable \u2018number\u2019 to store the value entered by the user to check if it is a palindrome or not, the variable \u2018remainder\u2019 to find the remainder when the integral division of that number is performed with 10, and the variable \u2018original_number\u2019 to store the value of the number entered by the user temporarily. We initialize the variable \u2018number_reverse to 0 for loop traversal.<\/p>\n Input:<\/strong> We take the input of the number to check if it is a palindrome or not from the user in the variable \u2018number\u2019.<\/p>\n Logic: <\/strong>The while loop runs till the number entered by the user becomes 0<\/p>\n Consider the value of the number = 181<\/p>\n The while loop will run for 3 times, given as:<\/p>\n 1. First iteration, number = 181<\/strong><\/p>\n remainder = 181 % 10 = 1 2. Second iteration, number = 18<\/strong><\/p>\n remainder = 18 % 10 = 8 3. Third iteration, number = 1<\/strong><\/p>\n remainder = 1 % 10 = 1 The loop will no longer run as the base condition no longer continues to be satisfied as the number reached its minimum value = 0<\/p>\n Here is a program in C that checks if the given word entered by the user as a string if a palindrome or not:<\/strong><\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Before we begin our discussion on how to find the factorial of a number, it is important to be thorough with Iteration, Data types, Conditional statement, and Operators in C.<\/p>\n Let us try to understand what is a factorial<\/a>:<\/p>\n The factorial of a number n is given by: 1 x 2 x 3 x 4 \u2026\u2026\u2026\u2026\u2026\u2026.. x n.<\/p>\n For instance, the factorial of 5 given given by: 1 x 2 x 3 x 4 x 5 = 120.<\/p>\n Example of Factorial in C<\/strong><\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Elucidation<\/span><\/strong><\/p>\n We can understand the working of this program with the help of a dry run:<\/p>\n Consider number = 8<\/p>\n For i = 1<\/p>\n factorial = 1 * 1 = 1<\/p>\n For i = 2<\/p>\n factorial = 1* 2 = 2<\/p>\n For i = 3<\/p>\n factorial = 2 * 3 = 6<\/p>\n For i = 4<\/p>\n factorial = 6 * 4 = 24<\/p>\n For i = 5<\/p>\n factorial = 24 * 5 = 120<\/p>\n For i = 6<\/p>\n factorial = 120 * 6 = 720<\/p>\n For i = 7 For i = 8<\/p>\n factorial = 5040 * 8 = 40320<\/p>\n Hence, we obtain the value of 8! = 40320<\/p>\n Key takeaway:<\/strong> You can even find the factorial of a number using recursion in C<\/a><\/strong><\/em>.<\/span><\/p>\n Before we begin our discussion on number reversal, it is important to understand Operators in C and Iteration in C.<\/p>\n The purpose of this program is to reverse a number.<\/p>\n For instance,<\/p>\n The reversal of the number 67193 is 39176<\/p>\n Example of Number Reversal in C<\/strong><\/p>\n Code-<\/strong><\/p>\n Output-<\/strong><\/p>\n Elucidation<\/strong><\/p>\n The same concept has been applied to the palindrome problem.<\/p>\n Before we begin our discussion on matrix multiplication, it is important to understand Arrays<\/a> and<\/strong> Multidimensional arrays in C<\/a><\/strong><\/em>.<\/p>\n Matrix Multiplication is one of the popular basic of C programs, let us begin our discussion by trying to understand what a matrix is.<\/p>\n In mathematics, a matrix is referred to as a rectangular array of elements used to represent numbers, symbols, or expressions in the form of horizontal rows and vertical columns.<\/p>\n The general form of a m x n matrix is:<\/strong><\/p>\n This is an example of a 4 x 3 matrix:<\/strong><\/p>\n This is how you can visualize a matrix, say A[m][n] with m number of rows and n number of columns:<\/strong><\/p>\n It is important to note that not every matrix can be multiplied with another matrix.<\/strong><\/p>\n Condition for multiplication of 2 matrices:<\/strong><\/p>\n Two matrices can be multiplied only when the number of columns of the first matrix is equal to the number of rows in the second matrix.<\/p>\n How to multiply 2 matrices:<\/strong><\/p>\n Each element of the resultant matrix is obtained by multiplying the elements of each row of the first matrix with its corresponding elements of each column of the second matrix and adding them together.<\/p>\n Example of Matrix Multiplication in C<\/strong><\/p>\n Output-<\/strong><\/p>\n Before we begin our discussion on decimal to binary conversions, it is important to understand Operators in C.<\/p>\n Here is a code in C that illustrates how to convert a number in a decimal number system to binary number system:<\/strong><\/p>\n Code-<\/strong><\/p>\n![\"Basic](\"https:\/\/data-flair.training\/blogs\/wp-content\/uploads\/sites\/2\/2019\/06\/Basic-C-Programs.jpg\")
<\/a><\/p>\n1. Fibonacci Series in C<\/h3>\n
Example of\u00a0Fibonacci Series in C<\/h4>\n
#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint number_of_terms, iteration;\r\nint term1 = 0, term2 = 1, next_term;\r\n\r\nprintf(\"Enter the number of terms till you want to display the numbers in the Fibonacci series: \");\r\nscanf(\"%d\", &number_of_terms);\r\n\r\nprintf(\"The Fibonacci series up till %d terms is: \",number_of_terms);\r\n\r\nfor (iteration = 1; iteration <= number_of_terms; iteration++)\r\n{\r\nprintf(\"%d \", term1);\r\nnext_term = term1 + term2; \/\/ Next term is the sum of previous terms\r\nterm1 = term2;\r\nterm2 = next_term;\r\n}\r\nreturn 0;\r\n}\r\n<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n\n
<\/a><\/p>\n#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint term1 = 0, term2 = 1, next_term = 0, limit;\r\n\r\nprintf(\"Enter a number till which you want to display the Fibonacci series: \");\r\nscanf(\"%d\", &limit);\r\n\r\nprintf(\"The Fibonacci series till %d is: %d, %d, \",limit, term1, term2); \/\/ term1 = 0 and term2 = 1\r\n\r\nnext_term = term1 + term2;\r\nwhile(next_term <= limit)\r\n{\r\nprintf(\"%d \",next_term);\r\nterm1 = term2;\r\nterm2 = next_term;\r\nnext_term = term1 + term2;\r\n}\r\nreturn 0;\r\n}<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n\n
2. Prime Numbers in C<\/h3>\n
Example of\u00a0Prime Numbers in C<\/h4>\n
#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint number, iteration;\r\nint flag = 0; \/\/ Initialize\r\n\r\nprintf(\"Enter a positive number to check if it is prime or not \");\r\nscanf(\"%d\", &number);\r\n\r\nfor(iteration = 2; iteration <= number\/2; iteration++)\r\n{\r\nif(number%iteration == 0) \/\/ Condition for a non-prime number\r\n{\r\nflag = 1; \/\/ To indicate that the number is non-prime\r\nbreak;\r\n}\r\n}\r\n\r\nif (number == 1)\r\n{\r\nprintf(\"1 is not a prime number.\\n\");\r\n}\r\nelse\r\n{\r\nif (flag == 0)\r\nprintf(\"%d is a prime number.\\n\", number);\r\nelse\r\nprintf(\"%d is not a prime number.\\n\", number);\r\n}\r\n\r\nreturn 0;\r\n}\r\n\r\n<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n\n
\n19 % 3 \u2260 0
\n19 % 4 \u2260 0
\n19 % 5 \u2260 0
\n19 % 6 \u2260 0
\n19 % 7 \u2260 0
\n19 % 8 \u2260 0
\n19 % 9 \u2260 0<\/p>\n#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint lower_limit, upper_limit, iteration;\r\nint flag; \/\/ A variable flag to indicate if the number is prime or not\r\nprintf(\"Enter the range:\\n\");\r\nprintf(\"Lower limit: \");\r\nscanf(\"%d\",&lower_limit);\r\nprintf(\"Upper limit: \");\r\nscanf(\"%d\",&upper_limit);\r\n\r\nprintf(\"The prime numbers in the range (%d,%d) are:\\n\", lower_limit, upper_limit);\r\n\r\nwhile (lower_limit < upper_limit)\r\n{\r\nflag = 0;\r\nfor(iteration = 2; iteration <= lower_limit\/2; iteration++)\r\n{\r\nif(lower_limit % iteration == 0)\r\n{\r\nflag = 1; \/\/ Condition for non-prime number\r\nbreak;\r\n}\r\n}\r\nif (flag == 0)\r\n{\r\nprintf(\"%d \", lower_limit);\r\n}\r\nlower_limit++;\r\n}\r\nreturn 0;\r\n}\r\n<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n\n
3. Palindrome in C<\/h3>\n
\n
\n
Example of\u00a0Palindrome Series in C<\/h4>\n
#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint number, number_reverse = 0, remainder, original_number;\r\n\r\nprintf(\"Enter an integer: \");\r\nscanf(\"%d\", &number);\r\n\r\noriginal_number = number; \/\/ Storing the value of the number into a variable original_number\r\n\r\n\/* Reversing the number *\/\r\nwhile( number!=0 )\r\n{\r\nremainder = number % 10;\r\nnumber_reverse = number_reverse * 10 + remainder;\r\nnumber \/= 10;\r\n}\r\n\/\/ To check if the original number and the reversed number are equal or not\r\nif (original_number == number_reverse)\r\nprintf(\"%d is a palindrome.\\n\", original_number);\r\nelse\r\nprintf(\"%d is not a palindrome.\\n\", original_number);\r\nreturn 0;\r\n}<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n\n
Explanation through Dry Run:<\/h3>\n
\nnumber_reverse = ( 0 * 10 ) + 1 = 1
\nnumber = 181 \/ 10 = 18<\/p>\n
\nnumber_reverse = ( 1 * 10 ) + 8 = 18
\nnumber = 18 \/ 10 = 1<\/p>\n
\nnumber_reverse = ( 18 * 10 ) + 1 = 181
\nnumber = 1 \/ 10 = 0<\/p>\n#include <stdio.h>\r\n#include <string.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nchar string1[30], string2[30], temp;\r\nint i,j;\r\nprintf(\"Enter the first string to check if it is a palindrome\\n\");\r\nfgets(string1,30,stdin);\r\nstrcpy(string2, string1); \/\/ Copying the first string to the second one\r\n\/\/ Reversing the string\r\n\r\ni = 0;\r\nj = strlen(string2)-1;\r\nwhile (i < j)\r\n{\r\ntemp = string2[i];\r\nstring2[i] = string2[j];\r\nstring2[j] = temp;\r\ni++;\r\nj--;\r\n}\r\nputs(string2);\r\nif (strcmp(string1, string2) == 0) \/\/ Comparing input string with the reverse string\r\n{\r\nprintf(\"The string %s is a palindrome\\n\",string1);\r\n}\r\nelse\r\n{\r\nprintf(\"The string %s isn't a palindrome\\n\",string1);\r\n}\r\nreturn 0;\r\n}<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n4. Factorial Program in C<\/h3>\n
#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint number, iteration;\r\nlong factorial = 1; \/\/ initializing factorial to 1\r\n\r\nprintf(\"Enter a positive integer: \");\r\nscanf(\"%d\",&number);\r\n\r\nif (number < 0) \/\/ If the user enters a negative number\r\nprintf(\"The factorial of a negative number does not exist\\n\");\r\nelse\r\n{\r\nfor(iteration = 1; iteration <= number; iteration++)\r\n{\r\nfactorial = factorial*iteration;\r\n}\r\nprintf(\"The factorial of %d is %lu\\n\", number, factorial);\r\n}\r\nreturn 0;\r\n}\r\n<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n
\nfactorial = 720 * 7 = 5040<\/p>\n5. Number Reversal in C<\/h3>\n
#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint number, number_reverse, remainder;\r\nnumber_reverse = 0; \/\/ initializing number_reverse to 0\r\n\r\nprintf(\"Enter a number in the form of an integer: \");\r\nscanf(\"%d\", &number);\r\n\r\nwhile(number != 0)\r\n{\r\nremainder = number%10;\r\nnumber_reverse = number_reverse*10 + remainder;\r\nnumber = number\/10;\r\n}\r\nprintf(\"The reversed number is: %d\\n\", number_reverse);\r\nreturn 0;\r\n}<\/pre>\n<\/a><\/p>\n<\/a><\/p>\n6. Matrix Manipulation in C<\/h3>\n
<\/a><\/p>\n<\/p>\n<\/a><\/p>\n#include <stdio.h>\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint row1, column1, row2, column2, sum = 0;\r\nint iteration1, iteration2, iteration3;\r\nint matrix1[10][10], matrix2[10][10], product[10][10];\r\n\r\nprintf(\"Enter the number of rows and columns of first matrix: \");\r\nscanf(\"%d%d\", &row1, &column1);\r\n\r\nprintf(\"Enter the elements of first matrix\\n\\n\");\r\n\r\nfor (iteration1 = 0; iteration1 < row1; iteration1++)\r\n{\r\nfor (iteration2 = 0; iteration2 < column1; iteration2++)\r\n{\r\nscanf(\"%d\", &matrix1[iteration1][iteration2]);\r\n}\r\n}\r\n\r\nprintf(\"Enter the number of rows and columns of second matrix: \");\r\nscanf(\"%d%d\", &row2, &column2);\r\n\r\nif (column1 != row2)\r\n{\r\nprintf(\"The matrices can't be multiplied.\\n\\n\");\r\n}\r\nelse\r\n{\r\nprintf(\"Enter the elements of second matrix\\n\\n\");\r\n\r\nfor (iteration1 = 0; iteration1 < row1; iteration1++)\r\n{\r\nfor (iteration2 = 0; iteration2 < column2; iteration2++)\r\n{\r\nscanf(\"%d\", &matrix2[iteration1][iteration2]);\r\n}\r\n}\r\nfor (iteration1 = 0; iteration1 < row1; iteration1++)\r\n{\r\nfor (iteration2 = 0; iteration2 < column2; iteration2++)\r\n{\r\nfor (iteration3 = 0; iteration3 < row2; iteration3++)\r\n{\r\nsum = sum + matrix1[iteration1][iteration3]*matrix2[iteration3][iteration2];\r\n}\r\n\r\nproduct[iteration1][iteration2] = sum;\r\nsum = 0;\r\n}\r\n}\r\n\r\nprintf(\"The product of the matrices is:\\n\\n\");\r\n\r\nfor (iteration1 = 0; iteration1 < row1; iteration1++)\r\n{\r\nfor (iteration2 = 0; iteration2 < column2; iteration2++)\r\nprintf(\"%d\\t\", product[iteration1][iteration2]);\r\nprintf(\"\\n\");\r\n}\r\n}\r\nreturn 0;\r\n}<\/pre>\n<\/a><\/p>\n7. Convert Decimal to Binary Number in C<\/h3>\n
#include <stdio.h>\r\n#include <math.h>\r\nlong decimal_to_binary(int decimal_number)\r\n{\r\nlong binary_number = 0;\r\nint remainder, iteration = 1;\r\n\r\nwhile (decimal_number != 0)\r\n{\r\nremainder = decimal_number%2;\r\ndecimal_number = decimal_number\/ 2;\r\nbinary_number = binary_number+ remainder*iteration;\r\niteration = iteration*10;\r\n}\r\nreturn binary_number;\r\n}\r\n\r\nint main()\r\n{\r\n\r\nprintf(\"Welcome to DataFlair tutorials!\\n\\n\");\r\n\r\nint decimal_number;\r\nprintf(\"Enter a positive integer in decimal system: \");\r\nscanf(\"%d\", &decimal_number);\r\nprintf(\"The number %d in decimal system to binary is %ld\\n\", decimal_number, decimal_to_binary(decimal_number));\r\nreturn 0;\r\n}<\/pre>\n<\/a><\/p>\n