Find Alphabets, Numbers And Speial Character In A Charecter Array In C.

Program To Find Nos Of Alphabets Nos Of Numeric Digit And Nos Of Special Character  In A Character Array Using C.


#include<stdio.h>
#include<conio.h>
main()
      {
       char string[50];
       int i,upperalpha,loweralpha,num,specialchar;
       upperalpha=0;
       loweralpha=0;
       num=0;
       specialchar=0;
       printf("\n\tEnter A String:==");
       gets(string);
       for(i=0;string[i]!='\0';i++)
                                   {
                                     if((string[i]>=65 && string[i]<=90)) 
                                                  {
                                                   upperalpha++;   
                                                  }
                                     else if((string[i]>=97 &&string[i]<=122))
                                          {
                                           loweralpha++;            
                                          }
                                     else if((string[i]>=48 && string[i]<=57))
                                          {
                                           num++;            
                                          }
                                     else
                                         {
                                          specialchar++;
                                         }
                                   } 
      printf("\n\tNumber Of Uppare Case Letter:==%d",upperalpha);
      printf("\n\tNumber Of Lower Case Letter:==%d",loweralpha);
      printf("\n\tNumber Of Numbers:==%d",num);
      printf("\n\tNumber Of Special Charecter:==%d",specialchar);
      getch();
      }

Simple Pascal Triangle In C

Draw A Simple Pascal Triangle Using C Language

Solution::

#include<stdio.h>
#include<conio.h>
main()
{
    int paskal[10][10],i,j,k,row;
    printf("\n\tEnter The Number Of Rows For Pascal Triangle:==");
    scanf("%d",&row);
    for( i=1; i<=row; i++)
              {
              for( j=1; j<=i; j++)
                                {
                                if(j==1||j==i)
                                              {
                                              paskal[i][j]=1;
                                              }
                                else
                                     {
                                     paskal[i][j]=paskal[i-1][i-j]+paskal[i-1][i-j+1]; 
                                     }
                                }
                                     
              }
     for( i=1; i<=row; i++)
                          {
                          for( k=row; k>=row-i; k--)
                                                 {
                                                 printf(" ");
                                                 }
                          for( j=1; j<=i; j++)
                                               {
                                               printf(" %d",paskal[i][j]);
                                               }
                          printf("\n");
                          }
     getch();
     }

Summation Of Series..

Find The summation Of The Series ..

Sum=1+x+x^2+.......+x^n

Solution:

#include<stdio.h>

#include<conio.h>

int power(int p, int b);

main()

      {

       int i,p,sum,term,base;

       printf("\n\tEnter The Base Value:==");

       scanf("%d",&base);

       printf("\n\tEnter The Number Of Terms:==");

       scanf("%d",&term);

       sum=0;

       printf("\n\n\tYour Series..\n\n\t");

       for(i=0;i<=term;i++)

                       {

                        p=power(i,base);

                        sum=sum+p; 

                        printf("+%d^%d",base,i);    

                       }

      printf(":==%d",sum);

      getch();

      }

int power(int p, int b)

    {

     int pow,i;

     pow=1;

     if(p==0)

             {

              return pow;         

             }        

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

                           {

                            pow=pow*b;    

                           } 

          return pow;   

    }

 

Find The summation Of The Series ..

Sum=1/2! - 2/4! + 3/6! - 4/8! +... -(-1)^n{n/(2n)!}

Solution:

#include<stdio.h>
#include<conio.h>
int factorial(int f);
main()
      {
       int term,i,fact;
       double sum,oddsum,evensum;
       printf("\n\tEnter The Number Of Terms:==");
       scanf("%d",&term);
       sum=0.0;
       oddsum=0.0;
       evensum=0.0;
       printf("\n\n\tYour Series...\n\n\t");
       for(i=1;i<=term;i++)
                           {
                            fact=factorial(2*i);
                            if(i%2==1)
                                      {
                                       oddsum=(float )i/fact;
                                       printf("+(%d/%d!)",i,2*i);    
                                      }
                           else
                               {
                                  evensum=(float )i/fact;
                                   printf("-(%d/%d!)",i,2*i);     
                               }  
                           }
       sum=oddsum-evensum;
       printf(":== %f",sum);
       getch();      
      }
int factorial(int f)
    {
     int fact,i;
     fact=1;
     for(i=1;i<=f;i++)
                      {
                       fact=fact*i;    
                      }        
     return fact;
    } 

How To Print Various Type Of Pattern In C

Output:

55555
54444
54333
54322
54321

Code:

#include<stdio.h>
#include<conio.h>
main()
      {
       int i,j,k,n;
       for(i=5;i>=1;i--)
                        {
                         for(j=5;j>=i;j--)
                                          {
                                           printf(" %d",j);
                                          }
                         for(k=i;k>1;k--)
                                          {
                                           printf(" %d",i);
                                          }  
                        printf("\n");
                        } 
       getch();        
      }