top of page

MR. APURBA PAUL

Naturally Curious

Home: Welcome

Implementation 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;...

Implementation 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...

Display 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...

Home: Blog2

Subscribe Form

Stay up to date

Home: Subscribe

CONTACT

JIS College of Engineering, Block-A, Phase-III, Kalyani, Nadia, West Bengal, India, Pin-741235

9874752090

Home: Contact
bottom of page