Apurba PaulAug 24, 20191 min readImplementation of Circular Queue using Array#include<stdio.h> int MAX=0; int front=0; int rear=-1; int queue[100]; //Empty int isEmpty() { if(front==0 && rear==-1) return 1;...
Apurba PaulAug 24, 20191 min readImplementation of Queue using Array#include<stdio.h> int MAX=0; int front=-1; int rear=-1; int queue[100]; //Empty int isEmpty() { if(rear==-1) return 1; else return...
Apurba PaulAug 13, 20191 min readDisplay a Polynomial using Singly Linked List#include<stdio.h> typedef struct mynode { int coeff,expo; struct mynode *Link; }Node; Node *start=NULL,*start2=NULL; //Display Function...