Archive for August 2014

Dijkstra's algorithm(Shortest Path) C program

#include<stdio.h> #include<string.h> #define INFINITY 999 int DJ(int adj[][100], int src,int dst); char path[100]; int n; main(...

#include<stdio.h> #define M 100 void allocate(); void deallocate(); void display(); int tm,os,tavtm,avtm,ch,ps,psa[M],start[M],e...

#include<stdio.h> #define M 100 void allocate(); void display(); int ps[30],ch,avtm,os,tm,i,j,k,n,ts,tinf=0,pts[30],inf[30],start...

#include<stdio.h> #define TB 100 void allocate(); void deallocate(); void display(); int BFull(); struct Indexed { char n...

#include<stdio.h> #define TB 100 void allocate(); void deallocate(); void display(); int BFull(); struct Link { char n[30...

#include<stdio.h> #define TB 100 void allocate(); void deallocate(); void display(); int BFull(); struct Sequence { char ...

1. BYTESTUFF #include<stdio.h> struct FRAME { char flag; char Data[50]; }F; void send(char[]); void receive(); char e...