Category: C Refresh

  code: #include<stdio.h> #define size 4 int q[size]; int rear=-1; int front=-1; Enqueue(int item){ if((rear+1)%size==front){ printf(“Queue Overflow\n”);…

https://tanvir002700.wordpress.com/2016/04/15/c-stl-tricks1/  

Stack VS Queue difference:   code: /* * C Program to Implement a Queue using an Array…

Theory: http://scanftree.com/Data_Structure/Breadth-First-Search Bangla: গ্রাফ থিওরিতে হাতেখড়ি-৪(ব্রেডথ ফার্স্ট সার্চ) Video: code implementation: Some other links may help: http://theoryofprogramming.com/2014/12/25/breadth-first-search-algorithm/…

code: #include<stdio.h> struct s1 { int roll; float gpa; }; struct s2 { char name[100]; char classe[20];…

code: #include<stdio.h> int main() { FILE *fp; double data[5]; fp=fopen(“bin.bin”,”rb”); if(fp==NULL){ printf(“Unable to open file”); return 0;…