C Language Tasks for Beginners

 

 Code :

#include <stdio.h>
int main()
{
    int i, j, k;
    for (i = 1; i <= 4; i++)
    {
        for (j = 5; j >= i; j--)
        {
            printf(" ");
        }
        for (k = 1; k <= (i*2)-1; k++)
        {
            printf("*");
        }
        printf("\n");
    }

    for (i = 5; i >= 1; i--)
    {
        for (j = 5; j >= i; j--)
        {
            printf(" ");
        }
        for (k = 1; k <= (i*2)-1; k++)
        {
            printf("*");
        }
        printf("\n");
    }
    return 0;
}
  • Header File: #include <stdio.h> is needed to use printf() for printing output.
  • Main Function: The program starts from int main(). It returns 0 to indicate successful completion.
  • First Outer Loop (Top Pyramid): The first outer for loop (i = 1 to i <= 4) controls the number of rows in the top pyramid, with the number of stars increasing as the row number increases.
  • Inner Loop 1 (Spaces for Top Pyramid): The first inner for loop (j = 5 to j >= i) prints spaces to shift the stars to the right, decreasing the number of spaces as the row number increases.
  • Inner Loop 2 (Stars for Top Pyramid): The second inner for loop (k = 1 to k <= (i * 2) - 1) prints stars (*), with the number of stars increasing for each row in the top pyramid.
  • Second Outer Loop (Bottom Pyramid): The second outer for loop (i = 5 to i >= 1) controls the rows of the bottom inverted pyramid, with the number of stars decreasing as the row number decreases.
  • Inner Loop 1 (Spaces for Bottom Pyramid): The first inner for loop (j = 5 to j >= i) prints spaces for the bottom pyramid, increasing the number of spaces as the row number decreases.
  • Inner Loop 2 (Stars for Bottom Pyramid): The second inner for loop (k = 1 to k <= (i * 2) - 1) prints stars (*), with the number of stars decreasing for each row in the bottom pyramid.
  • New Line: printf("\n"); moves the output to a new line after printing each row.

Output :

     *
    ***
   *****
  *******
 *********
  *******
   *****
    ***
     *