Slip27_1 : Read the data from the file and sort on names in alphabetical order (use strcmp) using Merge sort and write the sorted data to another file 'sortedemponname.txt'

-

 Solution :

#include<stdio.h>

#include<stdlib.h>

#include<string.h>

struct employee

{

 char name[20];

 int age;

}emp[10];

int readFile(struct employee a[])

{

 int i=0;

 FILE *fp;

 if((fp=fopen("emp.txt","r"))!=NULL)

 {

 while(!feof(fp))

 {

 fscanf(fp,"%s%d",&a[i].name,&a[i].age);

 i++;

 }

 }

 return i-1;

}

mergesort(struct employee a[10],int lb,int ub)

{ int mid;

 if(lb<ub)

 {

 mid=(lb+ub)/2;

 mergesort(a,lb,mid);

 mergesort(a,mid+1,ub);

 merge(a,lb,mid,ub);

 }

}

merge(struct employee a[10],int lb,int mid,int ub)

{

 struct employee b[20];

 int k,i,j;

 k=0;

 i=lb;

 j=mid+1;

 while(i<=mid && j<=ub)

 {

 //if(a[i]<=a[j])

 if(strcmp(a[i].name,a[j].name)<0)

 { b[k]=a[i];

 i++;

 k++;

 }

 else

 { b[k]=a[j];

 j++;

 k++;

 }

 }

 while(i<=mid)

 {

 b[k]=a[i];

 i++;

 k++;

 }

 while(j<=ub)

{

 b[k]=a[j];

 j++;

 k++;

 }

 for(i=lb,k=0;i<=ub;k++,i++)

 {

 a[i]=b[k];

 }

}

void writeFile(struct employee a[],int n)

{

 int i=0;

 FILE *fp;

 if((fp=fopen("sortedemp_merge.txt","w"))!=NULL)

 {

 for(i=0;i<n;i++)

 { fprintf(fp,"%s %d\n",a[i].name,a[i].age);

 }

 }

}

main()

{ int n;

 n=readFile(emp);

 if(n==-1)

 printf("File not found ");

 else

 {

 mergesort(emp,0,n-1);

 writeFile(emp,n);

 printf("File Sorted ");

 }

}


Comments

Post a Comment

Popular posts from this blog

Slip 22_2: Read the data from file 'cities.txt' containing names of cities and their STD codes. Accept a name of the city from user and use sentinel linear search algorithm to check whether the name is present in the file and output the STD code, otherwise output “city not in the list”. Solution :

-
 Solution : #include<stdio.h> #include<stdlib.h> #include<string.h> struct city {  char name[20];  int code; }ct[10]; int readFile(struct city a[]) {  int i=0;  FILE *fp;  if((fp=fopen("city.txt","r"))!=NULL)  {  while(!feof(fp))  {  fscanf(fp,"%s%d",&a[i].name,&a[i].code);  i++;  }  }  return i-1; } void sentinelsearch(struct city a[10],int n,int sr) { int i,cnt=0;  a[n]=sr;  while(strcmp(sr,a[i].name)!=0) { i++;  }  if(i<n)  printf("city is found and STD code is %d ",a[i].code);  else  printf("city is not found "); } main() { int n;  char sr[20];  n=readFile(ct);  if(n==-1)  printf("File not found ");  else  {  printf("Enter city name to search");  scanf("%s",sr);  SentinelSearch(ct,n,sr);  } }
Read more

Slip10_2, 30_1 : Read the data from the file “employee.txt” and sort on names in alphabetical order (use strcmp) using bubble sort or selection sort

-
 Solution :Using Bubble sort #include<stdio.h> #include<stdlib.h> #include<string.h> struct employee {  char name[20];  int age; }emp[10]; int readfile(struct employee a[10]) {  int i=0;  FILE*fp;  if((fp=fopen("empl.txt","r"))!=NULL)  {  while(!feof(fp))  {  fscanf(fp,"%s%d",a[i].name ,&a[i].age);  i++;  }  }  return i-1; } void writefile(struct employee a[],int n) {  int i;  FILE *fp;  if((fp=fopen("bsort.txt","w"))!=NULL)  {  for(i=0;i<n;i++)  {  fprintf(fp,"%s %d \n",a[i].name ,a[i].age);  }  } } void bubblesort(struct employee a[],int n) {  int i,j;  struct employee temp;  for(i=0;i<n-1;i++)  {  for(j=0;j<n-1;j++)  {  if(strcmp(a[j].name,a[j+1].name)>0)  {  temp=a[j];  a[j]=a[j+1];  a[j+1]=temp;  }  }  } } main() { ...
Read more

Slip 10_1 ,22_1: Implement a linear queue library (st_queue.h) of integers using a static implementation of the queue and implementing the init(Q), add(Q) and peek(Q) operations. Write a program that includes queue library and calls different queue operations

-
 Solution : Header File :st_queue.h #include<stdio.h> int Q[20]; int f,R; void init() { f=R=-1; } int isempty() {  if(f==R)  return 1;  else  return 0; } int isfull() {  if(R==19)  return 1;  else return 0; } void Add(int no) {  if(isfull()==1)  printf("Queue is Full ");  else  {  R++;  Q[R]=no;  } } int Delete() { int no;  if(isempty()==1)  printf("Queue is empty ");  else  {  f++;  no=Q[f];  }  return no; } oid display() {  int i;  for(i=f+1;i<=R;i++)  { printf("%d ",Q[i]);  } } Program File : #include<stdio.h> #include "st_queue.h" main() { int n,ch;  init();  do  {  printf("\n\n1.Add \n2.Delete \n3.Display \n0.EXit");  printf("\nEnter choice ");  scanf("%d",&ch);  switch(ch)  { case 1:printf("\nEnter element ");  scanf("%d",...
Read more