Bca 2
Bca 2
SESSION 2019-20
(PROJECT FILE)
(INTRODUCTION TO
PROGRAMMING
USING C)
INDEX
S. No. Name of Programs Page No. Signature
1. Area of Circle and Rectangle 3
2. Swap the number 4
3. Even or Odd 5
4. Any Number to divisible by 11 6
5. Check Positive , Negative or Zero 8
6. Greatest Number 10
7. Leap Year 12
8. Vowel or Consonant 13
9. Factorial 15
10. Sum of Digits 16
11. Fibonacci Series 17
12. Prime Number 18
13. Revers Any Number 20
14. Linear Search 21
15. Selection Sort 23
16. Binary Search 25
17. Bubble sort 28
18. Diagonal Matrix 30
19. Matrix Multiplication 34
20. Factorial Using Recursion 38
21. Book Details Using Structure 40
22. Pointer Arithmetic 42
23. File Create 44
24. File Copy 45
Page |3
Even or Odd
#include<stdio.h>
#include<conio.h>
void main()
{
int n;
clrscr();
printf("Enter any number to check Even or Odd:");
scanf("%d",&n);
(n%2==0)?printf("%d is Even.",n):printf("%d is Odd.",n);
getch();
}
OUTPUT
First run:-
Enter any number to check Even or Odd:4
4 is Even.
Second run:-
Enter any number to check Even or Odd:5
5 is Odd.
Page |6
OUTPUT
First Run:-
Enter any number to check divisible by 11: 55
55 is divisible by 11.
Second Run:-
Enter any number to check divisible by 11: 21
21 is not divisible by 11.
33 is next number who divisible by 11.
Page |8
OUTPUT
First run:-
Enter any number to check positive, negative or zero: 4
4 is Positive.
Second run:-
Enter any number to check positive, negative or zero: -5
-5 is Negative.
Third run:-
Enter any number to check positive, negative or zero: 0
0 is Zero.
P a g e | 10
Greatest Number
#include<stdio.h>
#include<conio.h>
void main()
{
int a,b,c;
clrscr();
printf("Enter three number to check greatest number:");
scanf("%d %d %d",&a,&b,&c);
if(a>b)
{
if(a>c)
{
printf("%d is greatest.",a);
}
else
{
printf("%d is greatest.",c);
}
}
else if(b>c)
{
printf("%d is greatest.",b);
P a g e | 11
}
else
{
printf("%d is greatest.",c);
}
getch();
}
OUTPUT
First run:-
Enter three number to check greatest number: 5 2 4
5 is greatest.
Second run:-
Enter three number to check greatest number: 4 6 2
6 is greatest.
Third run:-
Enter three number to check greatest number: 5 6 8
8 is greatest.
P a g e | 12
Leap Year
#include<stdio.h>
#include<conio.h>
void main()
{
int n;
clrscr();
printf("Enter any number to check leap year:");
scanf("%d",&n);
if(((n%4==0)&&(n%100!=0))||(n%400==0))
{
printf("%d is leap year.",n);
}
else
{
printf("%d is not leap year.",n);
}
getch();
}
OUTPUT
Enter any number to check leap year: 2016
2016 is leap year.
P a g e | 13
Vowel or Consonant
#include<stdio.h>
#include<conio.h>
#include<ctype.h>
void main()
{
char ch;
clrscr();
printf("Enter any character to check vowel or consonant:");
scanf("%c",&ch);
ch=tolower(ch);
switch(ch)
{
case'a': printf("%c is vowel.");
break;
case'e': printf("%c is vowel.");
break;
case'i': printf("%c is vowel.");
break;
case'o': printf("%c is vowel.");
break;
case'u': printf("%c is vowel.");
break;
P a g e | 14
Factorial
#include<stdio.h>
#include<conio.h>
void main()
{
int n,i,f=1;
clrscr();
printf("Enter any number to find factorial:");
scanf("%d",&n);
for(i=n; i>=1; i--)
{
f=f*i;
}
printf("Factorial of %d is %d.",n,f);
getch();
}
OUTPUT
Enter any number to find factorial: 5
Factorial is 120.
P a g e | 16
Sum of Digits
#include<stdio.h>
#include<conio.h>
void main()
{
int n,r,sum=0;
clrscr();
printf("Enter digits to find sum:");
scanf("%d",&n);
while(n>0)
{
r=n%10;
sum=sum+r;
n=n/10;
}
printf("Sum of digits is %d.",sum);
getch();
}
OUTPUT
Enter digits to find sum: 432
Sum of digits is 9.
P a g e | 17
Fibonacci Series
#include<stdio.h>
#include<conio.h>
void main()
{
int t,a=0,b=1,c,i;
clrscr();
printf("Enter terms to find fibonacci series:");
scanf("%d",&t);
printf("%d ",a);
printf("%d ",b);
for(i=1; i<=(t-2); i++)
{
c=a+b;
printf("%d ",c);
a=b;
b=c;
}
getch();
}
OUTPUT
Enter terms to find fibonacci series: 10
0 1 1 2 3 5 8 13 21 34
P a g e | 18
Prime Number
#include<stdio.h>
#include<conio.h>
void main()
{
int n,i,f=0;
clrscr();
printf("Enter any number to check prime:");
scanf("%d",&n);
for(i=1; i<=n; i++)
{
if(n%i==0)
{
f++;
}
}
if(f==2)
{
printf("%d is prime number.",n);
}
else
{
printf("%d is not prime number.",n);
P a g e | 19
}
getch();
}
OUTPUT
First run:-
Enter any number to check prime: 13
13 is prime number.
Second run:-
Enter any number to check prime: 15
15 is not prime number.
P a g e | 20
Linear Search
#include<stdio.h>
#include<conio.h>
#define size 50
void main()
{
int a[size],s,i,n,c=0;
clrscr();
printf("Enter size of Array:");
scanf("%d",&s);
printf("Enter array element:");
for(i=0; i<s; i++)
{
scanf("%d",&a[i]);
}
printf("Enter element to be a searched:");
scanf("%d",&n);
for(i=0; i<s; i++)
{
if(a[i]==n)
{
c=1;
break;
P a g e | 22
}
}
if(c==1)
{
printf("Element found at position %d.",(i+1));
}
else
{
printf("Element not found.");
}
getch();
}
OUTPUT
First run:-
Enter size of Array: 5
Enter array element: 4 5 2 7 1
Enter element to be a searched: 2
Element found at position 3.
Second run:-
Enter size of Array: 5
Enter array element: 4 5 2 7 1
Enter element to be a searched: 3
Element not found.
P a g e | 23
Selection Sort
#include<stdio.h>
#include<conio.h>
#define size 50
void main()
{
int a[size],s,i,j,n;
clrscr();
printf("Enter size of Array:");
scanf("%d",&s);
printf("Enter array element:");
for(i=0; i<s; i++)
{
scanf("%d",&a[i]);
}
for(i=0; i<(s-1); i++)
{
for(j=(i+1); j<s; j++)
{
if(a[i]>a[j])
{
n=a[i];
a[i]=a[j];
P a g e | 24
a[j]=n;
}
}
}
printf("After sorting elements.\n");
for(i=0; i<s; i++)
{
printf("%d ",a[i]);
}
getch();
}
OUTPUT
Enter size of Array: 5
Enter array element: 6 3 5 1 7
After sorting elements.
13567
P a g e | 25
Binary Search
#include<stdio.h>
#include<conio.h>
#define size 50
void main()
{
int a[size],s,i,j,n,t,low,high,mid;
clrscr();
printf("Enter size of Array:");
scanf("%d",&s);
printf("Enter array element:");
for(i=0; i<s; i++)
{
scanf("%d",&a[i]);
}
for(i=0; i<(s-1); i++)
{
for(j=(i+1); j<s; j++)
{
if(a[i]>a[j])
{
n=a[i];
P a g e | 26
a[i]=a[j];
a[j]=n;
}
}
}
printf("After sorting elements.\n");
for(i=0; i<s; i++)
{
printf("%d ",a[i]);
}
printf("\nEnter element to be searched:");
scanf("%d",&t);
low=0;
high=s-1;
while(low<=high)
{
mid=(int)(low+high)/2;
if(a[mid]==t)
{
printf("Element found at position %d.",(mid+1));
break;
}
else if(a[mid]>t)
P a g e | 27
{
high=mid-1;
}
else
{
low=mid+1;
}
}
if(low>high)
{
printf("Element not found.");
}
getch();
}
OUTPUT
Enter size of Array: 5
Enter array element: 4 7 2 8 3
After sorting elements.
23478
Enter element to be searched: 4
Element found at position 3.
P a g e | 28
Bubble Sort
#include<stdio.h>
#include<conio.h>
#define size 50
void main()
{
int a[size],s,i,j,n;
clrscr();
printf("Enter size of Array:");
scanf("%d",&s);
printf("Enter array element:");
for(i=0; i<s; i++)
{
scanf("%d",&a[i]);
}
for(i=0; i<(s-1); i++)
{
for(j=0; j<(s-1-i); j++)
{
if(a[j]>a[j+1])
{
n=a[j];
P a g e | 29
a[j]=a[j+1];
a[j+1]=n;
}
}
}
printf("After sorting elements.\n");
for(j=0; j<s; j++)
{
printf("%d ",a[j]);
}
getch();
}
OUTPUT
Enter size of Array: 5
Enter array element: 7 3 6 2 5
After sorting elements.
23567
P a g e | 30
Diagonal Matrix
#include<stdio.h>
#include<conio.h>
#define size 50
void main()
{
int a[size][size],r,c,i,j;
clrscr();
printf("Enter matrix row:");
scanf("%d",&r);
printf("Enter matrix column:");
scanf("%d",&c);
printf("Enter matrix element:");
for(i=0; i<r; i++)
{
for(j=0; j<c; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("Matrix is:\n");
P a g e | 31
}
printf("\n");
}
printf("Minor diagonal matrix is:\n");
for(i=0; i<r; i++)
{
for(j=0; j<c; j++)
{
if((i+j)==(r-1))
{
printf("%d ",a[i][j]);
}
else
{
printf(" ");
}
}
printf("\n");
}
}
else
{
printf("Matrix is not a squar matrix.");
P a g e | 33
}
getch();
}
OUTPUT
Enter matrix row: 3
Enter matrix column: 3
Enter matrix element: 1 2 3 4 5 6 7 8 9
Matrix is:
123
456
789
Main diagonal matrix is:
1
5
9
Minor diagonal matrix is:
3
5
7
P a g e | 34
Matrix Multiplication
#include<stdio.h>
#include<conio.h>
#define size 50
void main()
{
int a[size][size],b[size][size],c[size][size],r1,c1,r2,c2,i,j,k;
clrscr();
printf("Enter first matrix row:");
scanf("%d",&r1);
printf("Enter first matrix column:");
scanf("%d",&c1);
printf("Enter first matrix element:");
for(i=0; i<r1; i++)
{
for(j=0; j<c1; j++)
{
scanf("%d",&a[i][j]);
}
}
printf("First matrix is:\n");
P a g e | 35
printf("%d ",c[i][j]);
}
printf("\n");
}
}
else
{
printf("Multiplication can not be possible.");
}
getch();
}
OUTPUT
Enter first matrix row: 2
Enter first matrix column: 2
Enter first matrix element: 1 2 3 4
First matrix is:
12
34
Enter second matrix row: 2
Enter second matrix column: 2
Enter second matrix element: 1 2 3 4
Second matrix is:
12
34
After multiplication the matrix is:
7 10
15 22
P a g e | 38
else
{
f=t*fact(t-1);
}
return f;
}
OUTPUT
Enter number to find factorial: 5
Factorial is 120.
P a g e | 40
Pointer Arithmetic
#include<stdio.h>
#include<conio.h>
void main()
{
int a=10,*p;
clrscr();
printf("Pointer Increment.\n");
p=&a;
printf("%u\n",p);
p++;
p=p+1;
printf("%u\n",p);
printf("Pointer Decrement.\n");
p=&a;
printf("%u\n",p);
p--;
p=p-1;
printf("%u\n",p);
printf("Pointer Addition.\n");
p=&a;
P a g e | 43
printf("%u\n",p);
p=p+5;
printf("%u\n",p);
printf("Pointer Subtraction.\n");
p=&a;
printf("%u\n",p);
p=p-5;
printf("%u\n",p);
getch();
}
OUTPUT
Pointer Increment.
65524
65528
Pointer Decrement.
65524
65520
Pointer Addition.
65524
65534
Pointer Subtraction.
65524
65514
P a g e | 44
File Create
#include<stdio.h>
#include<conio.h>
void main()
{
FILE *fp;
char ch[100];
fp=fopen("Project file.txt","w");
if(fp==NULL)
{
printf("File does not exist.");
getch();
}
printf("Enter contents:");
gets(ch);
fprintf(fp,"%s",ch);
fclose(fp);
getch();
}
OUTPUT
P a g e | 45
File Copy
#include<stdio.h>
#include<conio.h>
void main()
{
FILE *fp1,*fp2;
char ch;
fp1=fopen("File 1.txt","r");
fp2=fopen("Project file.txt","w");
ch=getc(fp1);
while(ch!=EOF)
{
printf("%c",ch);
ch=getc(fp1);
}
fclose(fp1);
fclose(fp2);
getch();
}
OUTPUT
P a g e | 46