Slip 12_2, Slip 15_2,Slip24_1 : Implement a circular queue library (cir_queue.h) of integers using a dynamic (circular linked list) implementation of the queue and implementing init(Q), AddQueue(Q) and DeleteQueue(Q) , peek(Q) operations. Write a menu driven program that includes queue library and calls different queue operations.

-

 Solution :

Header File : cir_queue.h

#include<stdio.h>

#include<stdlib.h>

struct node

{

 int data;

 struct node *next;

};

struct node *r;

void init()

{

 r=NULL;

}

int isempty()

{

 if(r==NULL)

 return 1;

 else

 return 0;

}

void Add(int n)

{

 struct node *nw;

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

 nw->data=n;

 if(r==NULL)

 {

 r=nw;

 r->next=r;

 }

 else

 {

 nw->next=r->next;

 r->next=nw;

 r=r->next;

 }

}

int Delete()

{

 int no;

 struct node *temp;

 temp=r->next;

 if(r==temp->next)

 { r=NULL;

 }

 else

{

 r->next=temp->next;

 }

 no=temp->data;

 free(temp);

 return (no);

}

int peek()

{

 return r->next->data;

}

Program File:

#include<stdio.h>

#include "cir_queue.h"

main()

{ int ch,no;

 init();

 do

 {

 printf("\n1.Add \n2.Delete \n0.Exit");

 printf("Enter choice");

 scanf("%d",&ch);

 switch(ch)

 {

 case 1:printf("\n Enter element");

 scanf("%d",&no);

 Add(no);

 break;

 case 2:if(isempty()==1)

 printf("\n Queue is empty");

 else

 {

 printf("deleted

element is %d",Delete());

 break;

 }

 case 0:break;

 case 4:printf("Elemenent at peek %d ",peek());

 break;

 default:printf("Invalid choice");

 }

 }while(ch!=0);


}


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 23_2: Read the data from file ‘sortedcities.txt’ containing sorted names of cities and their STD codes. Accept a name of the city from user and use binary 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 : #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("sortedfile.txt","r"))!=NULL)  {  while(!feof(fp))  {  fscanf(fp,"%s%d",&a[i].name,&a[i].code);  i++;  } }  return i-1; } int binarysearch(struct city a[10],int lb,int ub,char sr[20]) {  int mid=0;  while(lb<=ub)  {  mid=(lb+ub)/2;  if(strcmp(a[mid].name,sr)==0)  return mid;  else if(strcmp(sr,a[mid].name)<0)  ub=mid-1;  else  lb=mid+1;  }  return -1; } main() { int n,p;  char sr[20];  n=readFile(ct);  if(n==-1)  printf("File not found ");  else  {  printf("Enter city name to search ");  scanf("%s",sr);  p=binarysearch(ct,0,n,sr);  if(p>=0)  prin...
Read more