Slip 5_2 ,Slip 11_2 ,Slip 23_1 : Implement a priority queue library (PriorityQ.h) of integers using a static implementation of the queue and implement the below two operations. 1) Add an element with its priority into the queue. 2) Delete an element from queue according to its priority.

-
 Solution :
Header File : PriorityQ.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)
{ int i;
 if(isfull()==1)
 printf("Queue is Full ");
 else
 {
 for(i=R;i>f;i--)
 { if(no<Q[i])
 Q[i+1]=Q[i];
 else
 break;
 }
 Q[i+1]=no;
 R++;
 }
}
int Delete()
{ int no;
 if(isempty()==1)
 printf("Queue is empty ");
 else
 {
 f++;
 no=Q[f];
 }
 return no;
}
void display()
{
 int i;
 for(i=f+1;i<=R;i++)
 { printf("%d ",Q[i]);
 }
}
Program File :
#include<stdio.h>
#include "PriorityQ.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",&n);
 Add(n);
 break;
 case 2:if(isempty()==1)
 printf("\nQueue is empty ");
 else
 printf("deleted elemet =%d
",Delete());
 break;
 case 3:display();
 break;
 case 0:break;
 default:printf("\nInvalid 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