| Simple File Management | Using Command Line Argument |
| #include "stdio.h" #include "conio.h" #include "stdlib.h" void main() { FILE *fp1,*fp2; char ch; clrscr(); //Open File 1 in Read Mode fp1=fopen(“D:\abc.txt”,"r"); //Open File 2 in Write Mode fp2=fopen(“D:\xyz.txt”,"w"); //Read data from File 1 ch=getc(fp1); while(ch!=EOF) { printf("%c",ch); //Write data to File 2 putc(ch,fp2); //Read data From File 1 ch=getc(fp1); } fclose(fp); fclose(fp1); getch(); } | #include "stdio.h" #include "conio.h" #include "stdlib.h" void main(int argc,char *argv[]) { FILE *fp1,*fp2; char ch; clrscr(); //Open File 1 in Read Mode fp1=fopen(argv[1],"r"); //Open File 2 in Write Mode fp2=fopen(argv[2],"w"); //Read data from File 1 ch=getc(fp1); while(ch!=EOF) { printf("%c",ch); //Write data to File 2 putc(ch,fp2); //Read data From File 1 ch=getc(fp1); } fclose(fp); fclose(fp1); getch(); } |
GTU MCA Practical Solution for C ,C++, java, DBMS, SQL, RMI, CORBA, Network Programming, Servlet, JSP, ASP Code.
File Management in C
Example of Function in C
#include "stdio.h"
#include "conio.h"
//For Example as Simple Function
int Addition (int a,int b)
{
return a+b;
}
//For Example of Recursion Function
//Use of Conditional Operator
int factorial(int a)
{
return (a>0)?(a*factorial(a-1)):1;
}
//For Example of Pass By Reference
void swap(int *p,int *q)
{
int *r;
*r=*p;
*p=*q;
*q=*r;
}
void main()
{
int i=4,j=3;
clrscr();
printf("\nAddition = %d",Addition(i,j)); // Pass by value
printf("\nFactorial= %d",factorial(i)); // Recursion function
swap(&i,&j); // Pass by reference
printf("\n After Swaping");
printf("\n I=%d J=%d",i,j);
getch();
}
Example of Array in C
#include "stdio.h"
#include "conio.h"
//Function Used to Sort an Array
void sort(int a[5])
{
int i=0,j=0,temp;
for(i=0;i<5;i++)
{
for(j=i+1;j<5;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
}
void main()
{
int a[5]={4,2,5,3,1};
int m1[2][2]={1,2,3,4},m2[2][2]={2,2,2,2},m3[2][2]={0};
int add=0,i,j;
clrscr();
//One Dimension Addition
for(i=0;i<5;i++)
{
add+=a[i];
}
printf("\nAddition = %d",add);
//Before Sorting Data
printf("\n Before Sorting Data");
for(i=0;i<5;i++)
{
printf("\n %d - %d",i+1,a[i]);
}
sort(a); // Sort Function is Called
//After Sorting Data
printf("\n After Sorting Data");
for(i=0;i<5;i++)
{
printf("\n %d - %d",i+1,a[i]);
}
//Addition of Two Dimensional Array (Metrix)
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
m3[i][j]=m1[i][j]+m2[i][j];
}
}
//Code for Print Two Dimensional Array
for(i=0;i<2;i++)
{
printf("\n");
for(j=0;j<2;j++)
{
printf("\t%d",m3[i][j]);
}
}
getch();
}
Subscribe to:
Comments (Atom)