Best C Programming code for Linear Queue using Static Memory Allocation – February,2021

#include<stdio.h> #include<stdlib.h> #define max 50 typedef struct Queue { int val[max]; int front,rear; }qu; void enqueu(qu *,int); int dequeu(qu *); int peek(qu); int isempty(qu); int isfull(qu); void disp(qu); int main()…

Continue ReadingBest C Programming code for Linear Queue using Static Memory Allocation – February,2021

Best C Programming code for Circular Queue using Dynamic Memory Allocation – February,2021

#include<stdio.h> #include<conio.h> #include<stdlib.h> typedef struct circular { int val; struct circular *next; }cir; cir *createnode(cir *,int ); void enqueue(cir **,int); int dequeue(cir **); int isempty(cir *); int peek(cir *); void…

Continue ReadingBest C Programming code for Circular Queue using Dynamic Memory Allocation – February,2021

Best C Programming code for Circular Queue using Static Memory Allocation – February,2021

#include<stdio.h> #include<stdlib.h> #define max 5 typedef struct Queue { int val[max]; int rear,front; }qu; void enque(qu *,int); int deque(qu*); int peek(qu); int isempty(qu); int isfull(qu); void disp(qu); void main() {…

Continue ReadingBest C Programming code for Circular Queue using Static Memory Allocation – February,2021

Best C programming code for Josephus problem (October,2020) – Circular Linked List

#include<stdio.h> #include<conio.h> typedef struct circular { int val; struct circular *next; }cir; cir *create(); void disp(cir *); void insertafter(cir *,int); cir *insertbefore(cir *,int); cir *del(cir *,int); cir *josephus(cir*,int); void main()…

Continue ReadingBest C programming code for Josephus problem (October,2020) – Circular Linked List