Slip 30_2 : Write a program that merges two ordered linked lists into third new list. When two lists are merged the data in the resulting list are also ordered. The two original lists should be left unchanged. That is merged list should be new one. Use linked implementation.

-

 Solution :

#include<stdio.h>

struct node

{

 int data;

 struct node *next;

};

struct node* create();

void display(struct node*);

struct node* create()

{ int n,i;

 struct node *s,*f;

 printf("Enter how many nodes ");

 scanf("%d",&n);

 f= (struct node *)malloc(sizeof(struct node));

 printf("Enter data ");

 scanf("%d",&f->data);

 s=f;

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

 {

 s->next=(struct node*)malloc(sizeof(struct node));

 s=s->next;

 printf("Enter data ");

 scanf("%d",&s->data);

 }

 s->next=NULL;

 return f;

}

void display(struct node *f)

{ struct node *s;

 for(s=f;s!=NULL;s=s->next)

 {

 printf("| %d |-> ",s->data);

 }

}

struct node* merge(struct node *f1,struct node *f2)

{ struct node *s;

 for(s=f1;s->next!=NULL;s=s->next)

 {

 }

 s->next=f2;

 return f1;

}

main()

{

 struct node *f1,*f2,*f3;

 f1=create();

 f2=create();

 printf("1st linked list ");

 display(f1);

 printf("\n2nd linked list ");

display(f2);


 f3=merge(f1,f2) ;

 printf("\nAfter merging LL is ");

 display(f3);

}

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