CODECARTA

#include<stdio.h>
#include<conio.h>
void main()
{
  int i,a[i],m;
  clrscr();
   printf("enter the limit of array\n");
   scanf("%d",&m);
   printf("enter your array elements\n");
  
   for(i=0;i<m;i++)
  {
    scanf("%d",&a[i]);
  }
  printf("your array elements...\n");
  
   for(i=0;i<m;i++)
  {
    printf("%d\n",a[i]);
  }
 
getch();
}

Design, develop and execute a program in C to evaluate the given polynomial f(x)=a₄x⁴+a₃x³+a₂x²+a₁x+a₀

Program No:4
=============
 #include<stdio.h>
 #include<conio.h>

 void main() // Calling Main Function
  {
    float a[100],x,sum=0;
    int i,n;
    clrscr();

    printf("Enter the power of polinomial equation");
    scanf("%d",&n);

    printf("Enter the values of X \n");
    sanf("%f",&x);

    printf("enter the values for co-efficients \n");

    for(i=n;i>0;i--)
    {
      scanf("%f",&a[i]);
    }

    for(i=n;i>0;i--)
    {
     sum=(sum+a[i])*x;
    }
     sum=sum+a[0];
    printf("\n the values of f(%.2f) sum=%.2f",x,sum);


    getch();
  }
===========
Program Ends

 CLICKHERE! TO DOWNLOAD THIS PROGRAM

To more reference Wikipedia link
Screenshots:

Design,develop and execute a program in C to input N integer numbers into a single dimensional array,sort them in ascending order using dimensional array and perform a binary search for a given key integer number and report success or failure in the form of suitable message

CLICK HERE TO DOWNLOAD PROGRAM FILE!

 Program No:3
=================
 #include<stdio.h>
 #include<conio.h>
 #include<process.h>

 void main()
  {
    int a[100],i,n,key,first,last,mid;
    clrscr();
    printf("enter the limit number of array elements\n");
    scanf("%d",&n);

    printf("enter the elements of array\n");

    for(i=0;i<n;i++)
    {
      scanf("%d",&a[i]);
    }

    printf("My array elements...\n");

    for(i=0;i<n;i++)
    {
      printf("%d \n",a[i]);
    }

    printf("enter your searching word\n");
    scanf("%d",&key);

    first=0;
    last=n-1;

    while(first<=last)
    {
      mid=(first+last)/2;

      if(key==a[mid])
      {
    printf("\n %d is found at location =%d\n",key,mid+1);
    getch();
    exit(0);
      }
     else
     {
      if(key>a[mid])
      {
    first=mid+1;
      }
      else
      {
       last=mid-1;
      }

    }
   }
    printf("The %d is not found in the list ",key);

    getch();
  }
===================
Program Ends

CLICK HERE TO DOWNLOAD PROGRAM FILE!

To referance wikipedia link

screenshots: