Scribd
Upload
4 views5 pages

C Programming Revision Practice

The document contains a series of C programming examples that cover various fundamental concepts such as checking even or odd numbers, finding the largest element in an array, summing array elements, reversing arrays, and determining prime numbers. It also includes programs for calculating factorials, reversing numbers, checking for palindromes, summing digits, counting digits, generating Fibonacci series, finding GCD and LCM, and implementing linear and binary search algorithms. Each program is presented with code snippets and demonstrates basic input/output operations in C.

Uploaded by

prayagdey50
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views5 pages

C Programming Revision Practice

The document contains a series of C programming examples that cover various fundamental concepts such as checking even or odd numbers, finding the largest element in an array, summing array elements, reversing arrays, and determining prime numbers. It also includes programs for calculating factorials, reversing numbers, checking for palindromes, summing digits, counting digits, generating Fibonacci series, finding GCD and LCM, and implementing linear and binary search algorithms. Each program is presented with code snippets and demonstrates basic input/output operations in C.

Uploaded by

prayagdey50
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

C Programming Practice – Revision Programs

Even or Odd Number


#include <stdio.h>
int main()
{
int n;
scanf("%d",&n);
if(n%2==0)
printf("Even");
else
printf("Odd");
return 0;
}

Largest Element in Array


#include <stdio.h>
int main()
{
int n,i,a[50],largest;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);

largest=a[0];
for(i=1;i<n;i++)
if(a[i]>largest)
largest=a[i];

printf("Largest = %d",largest);
return 0;
}

Sum of Array
#include <stdio.h>
int main()
{
int n,i,a[50],sum=0;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);

for(i=0;i<n;i++)
sum=sum+a[i];

printf("Sum = %d",sum);
}

Reverse Array
#include <stdio.h>
int main()
{
int n,i,a[50],t;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&a[i]);

for(i=0;i<n/2;i++)
{
t=a[i];
a[i]=a[n-i-1];
a[n-i-1]=t;
}

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

Prime Number
#include <stdio.h>
int main()
{
int n,i,flag=0;
scanf("%d",&n);

for(i=2;i<n;i++)
{
if(n%i==0)
{
flag=1;
break;
}
}

if(flag==0)
printf("Prime");
else
printf("Not Prime");
}

Factorial
#include <stdio.h>
int main()
{
int n,i,f=1;
scanf("%d",&n);

for(i=1;i<=n;i++)
f=f*i;

printf("Factorial=%d",f);
}

Reverse Number
#include <stdio.h>
int main()
{
int n,rev=0,d;
scanf("%d",&n);

while(n>0)
{
d=n%10;
rev=rev*10+d;
n=n/10;
}

printf("%d",rev);
}
Palindrome Number
#include <stdio.h>
int main()
{
int n,t,rev=0,d;
scanf("%d",&n);
t=n;

while(n>0)
{
d=n%10;
rev=rev*10+d;
n=n/10;
}

if(rev==t)
printf("Palindrome");
else
printf("Not Palindrome");
}

Sum of Digits
#include <stdio.h>
int main()
{
int n,sum=0,d;
scanf("%d",&n);

while(n>0)
{
d=n%10;
sum=sum+d;
n=n/10;
}

printf("Sum=%d",sum);
}

Count Digits
#include <stdio.h>
int main()
{
int n,count=0;
scanf("%d",&n);

while(n>0)
{
count++;
n=n/10;
}

printf("Digits=%d",count);
}

Fibonacci Series
#include <stdio.h>
int main()
{
int n,f=0,s=1,next,i;
scanf("%d",&n);

for(i=1;i<=n;i++)
{
printf("%d ",f);
next=f+s;
f=s;
s=next;
}
}

GCD and LCM


#include <stdio.h>
int main()
{
int a,b,i,gcd=1,lcm;
scanf("%d%d",&a,&b);

int min=(a<b)?a:b;

for(i=1;i<=min;i++)
if(a%i==0 && b%i==0)
gcd=i;

lcm=(a*b)/gcd;

printf("GCD=%d LCM=%d",gcd,lcm);
}

Linear Search
#include <stdio.h>
int main()
{
int n,i,key,a[50],flag=0;
scanf("%d",&n);

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

scanf("%d",&key);

for(i=0;i<n;i++)
{
if(a[i]==key)
{
flag=1;
break;
}
}

if(flag)
printf("Found");
else
printf("Not Found");
}

Bubble Sort
#include <stdio.h>
int main()
{
int n,i,j,a[50],t;
scanf("%d",&n);

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

for(i=0;i<n-1;i++)
for(j=0;j<n-i-1;j++)
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}

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

Binary Search
#include <stdio.h>
int main()
{
int n,i,a[50],key,low,high,mid,flag=0;

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

scanf("%d",&key);

low=0;
high=n-1;

while(low<=high)
{
mid=(low+high)/2;

if(a[mid]==key)
{
flag=1;
break;
}
else if(key>a[mid])
low=mid+1;
else
high=mid-1;
}

if(flag)
printf("Found");
else
printf("Not Found");
}

You might also like