EmbLogic's Blog

1 #include<stdio.h>
2 #include<stdlib.h>
3 char* ip()
4 {
5          char *s1,ch;
6          int i=0;
7          s1=(char*)malloc(sizeof(char));
8          while(1)
9         {
10                 scanf(“%c”,&ch);
11                 s1=realloc(s1, i+1*sizeof(char));
12                 if(ch==10)
13                 break;
14                 s1[i]=ch;
15                 i++;
16         }
17         printf(“%s\n”,s1);
18         return s1;
19 }
20 int stlen(char*s1)
21 {
22         int i=0;
23         while(1)
24         {
25                 if(s1[i]==0)
26                 break;
27                 i++;
28         }
29         printf(“%d”,i);
30         return i;
31
32 }
33
34 main()
35 {       char * s1;
36         s1=ip();
37         stlen(s1);
38 }

#include
#include
char *input();
int length(char *);
int main()
{
char *s1,*s2;
int i;
printf(“Enter string 1:”);
s1=input();
printf(“Enter string 2:”);
s2=input();
i=length(s1);
printf(“Length of string is:%d\n”,i);
}
char *input()
{
char *s,ch;
int i=0;
s=(char *)malloc(sizeof(char));
while(1)
{
scanf(“%c”,&ch);
s=realloc(s,(i+2)*sizeof(char));
if(ch==’.’)
break;
s[i]=ch;
i++;
}
return s;
}
int length(char *s1)
{
int i=0,count=0;
while(*(s1+i)!=”)
{
count++;
i++;
}
return count;
}

#include<stdio.h>
#include<fcntl.h>
#include<dirent.h>
#include<string.h>
int openf(char *);
int main()
{
DIR *i;
struct dirent *k;
int j,l,s,flag=1,fd,fd1;
char *m = “txt.”;
char ch;
fd1 = openf(“new.txt”);
i = opendir(“./test”);
printf(“\n%d\n”,i);

while(( k = readdir(i)) !=  NULL)
{
flag=1;
l=strlen(k->d_name);
for(j = l-1,s=0;j >= l-4,s < 4 ;j–,s++ )
{
if((k->d_name[j])!= m[s])
{
flag=0;
goto q;
}

}
q:         if(flag==1)
{
fd = openf(k->d_name);
while(read(fd, &ch, 1))
write(fd1,&ch,1);
close(fd);
}
}
printf(“\n”);
close(fd1);
}
int openf(char * s)
{
int fd;
fd = open(s,O_RDWR|O_CREAT,0666);
if(fd < 1)
perror(“open error”);
else
printf(“input file open succesfull fd = %d\n”,fd);
return fd;
}

#include<stdio.h>
#include<fcntl.h>
#include<stdlib.h>
int foo(int ,  char *, int , int , int, char *);
int openf( char *);
int main(int argc, char * argv[])
{
int fd,pos,skip,b_size,n;
char ch,*buff;
buff = (char*)malloc(sizeof(char));
printf(“\nBlock size: “);
scanf(“%d”,&b_size);
printf(“\nNumber of Blocks: “);
scanf(“%d”,&n);
printf(“\nBytes to be skiped after each block: “);
scanf(“%d”,&skip);
fd = openf(argv[1]);
foo(fd,buff,b_size,n,skip,argv[1]);
close(fd);
}
int foo(int fd,  char *buff, int b_size, int n, int skip ,char * f)
{
char ch;
int i=0,j=0,k=0,m=0;
printf(“\nPHASE ONE DONE!!\n”);
while(1)
{
i=0;
for(j=0;;j++)
{    if(j>=n)goto i;
for(k=0; k < b_size; k++)
{
if (!(read(fd, &ch, 1)) || ch==0)
i:    goto o;
*(buff+k) = ch;
buff = realloc(buff,k+1);
}
for(m=0;m < skip;m++)
read(fd, &ch, 1);

printf(“\n%s**\n”,buff);
free(buff);
buff = (char*)malloc(sizeof(char));
}

}
o:printf(“\n%d blocks of size %d skipping %d bits after each read  are read form file %s\n”,n,b_size,skip,f);

}
int openf(char * s)
{
int fd;
fd = open(s,O_RDWR|O_CREAT,0666);
if(fd < 1)
perror(“open error”);
else
printf(“input file open succesfull fd = %d\n”,fd);
return fd;
}

#include<stdio.h>
#include<fcntl.h>
int openf(char *);
int main(int argc, char * argv[])
{
int fd,fd1, pos,i=1000000;
char ch=”;
fd = openf(argv[1]);
pos = lseek(fd,i * 4096, SEEK_SET);
write(fd, &ch,1);
close(fd);
}
int openf(char * s)
{
int fd;
fd = open(s,O_RDWR|O_CREAT,0666);
if(fd < 1)
perror(“open error”);
else
printf(“input file open succesfull fd = %d\n”,fd);
return fd;
}

#include<stdio.h>
#include<fcntl.h>
int openf(char *);
int main(int argc, char * argv[])
{
int fd,fd1, pos,i=3;
char ch;
fd = openf(argv[1]);
fd1 = openf(argv[2]);
pos = lseek(fd, 0, SEEK_END);
printf(“\n%d\n”,pos);
for(i=2; i < pos+1;i++)
{
lseek(fd, pos-i, SEEK_SET);
read(fd, &ch, 1);
write(fd1, &ch, 1);
printf(“ch = %c\n”,ch);
}

close(fd);
close(fd1);
}
int openf(char * s)
{
int fd;
fd = open(s,O_RDWR|O_CREAT,0666);
if(fd < 1)
perror(“open error”);
else
printf(“input file open succesfull fd = %d\n”,fd);
return fd;
}

RCS file: fops.h,v
Working file: fops.h
head: 1.1
branch:
locks: strict
root: 1.1
access list:
symbolic names:
keyword substitution: kv
total revisions: 1;    selected revisions: 1
description:
struct file_operations fops={
2 open:device_open,
3 release:device_release,
4 write:write,
5 read:read,
6 llseek:llseek
7 };
—————————-
revision 1.1    locked by: root;
date: 2014/07/12 12:01:39;  author: root;  state: Exp;
Initial revision
=============================================================================

#include<stdio.h>
int main()
{
int i,j,n,small,k;
printf(“Enter the Element of Array\n”);
scanf(“%d”,&n);
int a[n];
printf(“Enter the element\n”);
for(i=0;i<n;i++)
{
scanf(“%d”,&a[i]);
}
for(i=0;i<n;i++)
{
small=i;
for(j=i;j<n;j++)
{
if(a[j]<a[small])
small=j;
}
k=a[small];
a[small]=a[i];
a[i]=k;
}
for(i=0;i<n;i++)
{
printf(“%d\n”,a[i]);
}
}

#include<stdio.h>
int main()
{
int i,j,n,temp,search,low,high,mid,c;
printf(“Enter the element of array \n “);
scanf(“%d”,&n);
int a[n];
printf(“Enter the element\n”);
for(i=0;i<n;i++)
{
scanf(“%d”,&a[i]);
}
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf(“Array After Shorting\n”);
for(i=0;i<n;i++)
{
printf(“a[%d]=%d\n”,i,a[i]);
}
printf(“Enter the Number To be Search :\n”);
scanf(“%d”,&search);
low=0;
high=n-1;
while(1)
{
mid=(high+low)/2;
if(search==a[mid])
{
printf(“%d is found %dth location \n”,search,mid);
break;
}
else if(search>a[mid])
{
low=mid+1;
high=n-1;
}
else if(search<a[mid])
{
low=0;
high=mid-1;
}
else if(low>high)
{
printf(“%d is not found\n”,search);
break;
}
}
}