C Practice
1. EvenOddProgram
#include<stdio.h>
void funcEvenOdd(int b){
int c=b%2;
if(c==1){
printf("The number %d is a odd number\n",b);
}
if(c==0){
printf("The number %d is a even number\n",b);
}
}
int main()
{
int a;
printf("Enter a number:");
scanf("%d",&a);
funcEvenOdd(a);
return 0;
}
2.Largest_Number_In_Array
#include<stdio.h>
int funclarge(int array[],int n){
int large=0;
for(int i=0;i<n;i++){
if(array[i]>large){
large=array[i];
}
}
return large;
}
int main()
{
int arr[]={12,5666,77,878};
int l=funclarge(arr,4);
printf("the largest number you have entered is:%d",l);
return 0;
}
3.Largest_Number_In_Array(user_input)
#include<stdio.h>
int funclarge(int array[],int n){
int large=0;
for(int i=0;i<n;i++){
if(array[i]>large){
large=array[i];
}
}
return large;
}
int main()
{
int arr[10];
for(int i=0;i<10;i++){
printf("Enter number %d:",i+1);
scanf("%d",&arr[i]);}
int l=funclarge(arr,10);
printf("the largest number you have entered is:%d",l);
return 0;
}
4.MULTIPLICATION_Table
#include<stdio.h>
int main()
{ int a;
printf("Enter a number:");
scanf("%d",&a);
printf("the multiplication table of %d is\n",a);
for(int i=1;i<=10;i++){
printf("%d X %d = %d\n",a,i,a*i);
}
return 0;
}
5.Find_Factorial
#include<stdio.h>
int factorialfunc1(int b){
int term=1;
for(int j=b;j>1;j--){
term=term*j;
}
return term;
}
int factorialfunc2(int c)
{
if(c==0 || c==1){
return 1;
}
else{
return c*factorialfunc2(c-1);
}
}
int main()
{
int n;
printf("Enter a number:\n");
scanf("%d",&n);
int factorial=factorialfunc2(n);
// int factorial=factorialfunc1(n);
printf("The factorial of %d is %d",n,factorial);
return 0;
}
6.Prime_Number_or_Not
#include<stdio.h>
int main()
{int n;
printf("Enter a number:\n");
scanf("%d",&n);
int prime=1;
for(int j=2;j*j<=n;j++){
if(n%j==0){
prime=0;
}
}
if(prime){
printf("the number %d is prime",n);
}
7.Number_Reverse
#include<stdio.h>
int reversefunc(int num){
int rev=0,remainder;
while(num!=0){
remainder=num%10;
rev=rev*10+remainder;
num=num/10;
}
return rev;
}
int main()
{
int n;
printf("Enter a number:\n");
scanf("%d",&n);
int reverse=reversefunc(n);
printf("The reverse of %d is %d",n,reverse);
return 0;
}
8.Cube_of_a_Number
#include<stdio.h>
int cube(int a){
int m=a*a*a;
return m;
}
int main()
{
int num;
printf("Enter that number whom you want the cube:\n");
scanf("%d",&num);
cube(num);
printf("The cube of %d is %d",num,cube(num));
return 0;
}
else{
printf("The number %d is not prime",n);
}
return 0;
}
9.Prime_Of_Given_Range_With_Count
#include<stdio.h>
int primefunc(int n){
for(int j=2;j*j <= n;j++){
if(n%j==0){
return 0;
}
}
return 1;
}
int main()
{int n;
int num1,num2;
printf("Enter Starting number:\n");
scanf("%d",&num1);
printf("Enter Ending number:\n");
scanf("%d",&num2);
printf("prime numbers between %d and %d are:\n",num1,num2);
for(int m=num1;m <= num2;m++){
if(primefunc(m)){
printf("%d ",m);
n++;
}
}
printf("\n");
printf("The count of prime number is %d",n);
return 0;
}
10.Palindrome_Check
#include<stdio.h>
int func(int n) {
int rev=0,rem;
while(n!=0) {
rem=n%10;
rev=rev*10+rem;
n=n/10;
}
return rev;
}
int main()
{
int num;
printf("Enter a Number:\n");
scanf("%d",&num);
if(func(num)==num) {
printf("The number is palindrome");
}
else {
printf(" The number is not palindrome");
}
return 0;
}
11.Power_Of_Number
#include<stdio.h>
int main()
{
int power,base,val=1;
printf("Enter the base number:\n");
scanf("%d",&base);
printf("Enter the power:\n");
scanf("%d",&power);
for(int j=0;j<power;j++)
{
val=val*base;
}
printf("The value of \n %d to the power %d is %d",base,power,val);
return 0;
}
12.Matrix_Multiplication
#include<stdio.h>
int main()
{
int sum;
int a[3][2],m[2][3],res[3][3];
printf("Enter the first matrix:\n");
for(int i=0; i<3; i++)
{ for(int j=0; j<2; j++)
{
printf("Enter %d %d value::",i+1,j+1);
scanf("%d",&a[i][j]);
}
}
printf("\nEnter the second matrix:\n");
for(int i=0; i<2; i++)
{ for(int j=0; j<3; j++)
{
printf("Enter %d %d value::",i+1,j+1);
scanf("%d",&m[i][j]);
}
}
for(int i=0; i<3; i++)
{ for(int j=0; j<3; j++)
{
for(int v=0; v<2; v++)
{
sum+=a[i][v]*m[v][j];
}
res[i][j]=sum;
sum=0;
}
}
printf("\n matrix multiplication becomes:\n");
for(int i=0; i<3; i++)
{ for(int j=0; j<3; j++)
{
printf("\t"); printf("%d",res[i][j]);
}
printf("\n");
}
}
13.Star_Pattern_1
#include<stdio.h>
int main()
{
int n;
printf("Enter the number of pattern you want:=");
scanf("%d",&n);
for(int j=0;j<n;j++){
for(int b=1;b<=j;b++){
printf("*");
}
printf("*\n");
}
return 0;
}
14.Star_Pattern_2
#include<stdio.h>
int main()
{
int n;
printf("Enter the number of pattern you want:=");
scanf("%d",&n);
for(int j=0;j<n;j++){
for(int b=0;b<n;b++){
if(j+b>=(n-1)){
printf("*");}
else{
printf(" ");
}
}
printf("\n");
}
return 0;
}
15.Star_Pattern_3
int main()
{
int num;
printf("Enter the numbers of row for your pattern\n");
scanf("%d",&num);
for(int m=0;m<num;m++){
for(int b=0;b<num;b++){
if(b>=m){
printf("*");
}
else{
printf(" ");
}
// printf("*");
}
printf("\n");
}
return 0;
}
16.Star_Pattern_4
int main()
{
int num;
printf("Enter the numbers of row for your pattern\n");
scanf("%d",&num);
for(int m=0;m<num;m++){
for(int b=0;b<num;b++){
if(b==0 || m==0 || b==num-1 || m==num-1){
printf("* ");
}
else{
printf(" ");
}
// printf("*");
}
printf("\n");
}
return 0;
}
17.Star_Pattern_5
#include<stdio.h>
int main()
{
int n=6;
for(int a=0;a<n;a++){
for(int b=0;b<n;b++){
if(b+a<=n-1){
printf("*");
}
else{
printf(" ");
}
}
printf("\n");
}
return 0;
}
18.Star_Pattern_6
#include<stdio.h>
int main()
{int n=8;
for(int a=0;a<n;a++){
for(int b=0;b<2*n;b++){
if(b>=n-1-a && b<=n-1+a){
printf("*");
}
else{
printf(" ");
}
}
printf("\n");
}
return 0;
}
19.Number's Digit count
#include<stdio.h>
int main()
{
int num,count=0;
printf("Enter the Number:\n");
scanf("%d",&num);
if(num==0){
printf("The number has %d digit:",num);
}
else{
while(num!=0){
num=num/10;
count++;
}
if(count>1){
printf("the number has %d digits.",count);
}
else{
printf("the number has %d digit.",count);
}}
return 0;
}