to get information about the topicprogram to implement the data page link layer framing method character countrelated topic refer the page link bellow

http://seminarsprojects.net/Thread-program-to-implement-the-data-link-layer-framing-method-bit-stuffing ....etc

[:=Read Full Message Here=:]

#include
#include
void main()
{
char a,b;
int i,j,k,count=0;;
clrscr();
printf( enter bits and press -1 to terminate \n);
printf(\t);
for(i=0;i<100;i++)
{
a=getch();
k=a;
if(k!=13 && k!=48 && k!=49)
{
i--;
continue;
}
putch(a);
if(a==13)
break;
}
x

for(j=0;j {
if(a==49)
{
b=a;
count++;
if(count!=5)
continue;
}
if(count==5)
b='0';
else
b=a;
count=0;
}
printf(\n\t after stuffing:\n\n\t);
for(j=0;j printf(%c,b);
....etc

[:=Read Full Message Here=:]

S-DES Algorithm:-

Encryption:- Encryption algorithm takes an 8-bit block of plaintext and 10-bit key as input and produce an 8-bit block of ciphertext as output.
1. Encryption algorithm involves five functions:
1) an initial permutation function (IP)
2) a complex function (fk) which involves both substitution and permutation
3) a simple permutation function (SW) that switches two halves of data
4) the function f again
5) a permutation function that is the inverse of the initial permutation(IP-1).
2. The function fk takes as input ....etc

[:=Read Full Message Here=:]

Program for DES
#include
#include
void main()
{
int a,b,c,i,j,k,l,m,n,x1;
int p,q,r,s,d,y,e,z=0;
clrscr();
printf(\n Enter the plain Text number:\n);
scanf(%d,&n);
printf(\n Enter the key number \n);
scanf(%d,&k);
printf(\n Enter the bit stream \n);
for(i=0;i {
scanf(%d,&a);
}
p=n\2;
x1=p-k;
for(i=0;i<=x1;i++)
{
c=0;
z++;
}
z=z-1;

printf(\n Enter the Key bit Stream\n);
for(i=0;i {
sca ....etc

[:=Read Full Message Here=:]

to get information about the topic c code to implement des algorithm full report ppt and related topic refer the page link bellow

http://seminarsprojects.net/Thread-implementation-of-des-algorithm

http://seminarsprojects.net/Thread-implement-des-algorithm ....etc

[:=Read Full Message Here=:]

#include
#include
#include
void main()
{
char nod,st,ed;
int wts,n,i,j,k,x=0,y,s=0,pos=-1,max=100;
clrscr();
printf(Enter the no of nodes:);
scanf(%d,&n);
printf(Enter nodes:);
for(i=0;i {
fflush(stdin);
scanf(%c,&nod);
}
printf(Enter start & end node:);
fflush(stdin);
scanf(%c,&st);
fflush(stdin);
scanf(%c,&ed);
for(i=0;i {

y=0;
for(j=0;j {
printf(Wt between%c-%c:,nod,nod);
scan ....etc

[:=Read Full Message Here=:]

To get full information or details of program code in opengl for implement the mobile phone please have a look on the pages

http://seminarsprojects.net/Thread-rocket-launching-using-opengl

if you again feel trouble on program code in opengl for implement the mobile phone please reply in that page and ask specific fields in program code in opengl for implement the mobile phone ....etc

[:=Read Full Message Here=:]

#include
#include
#include
void main()
{
int i,j,k,n,c=0,l;
char s;
clrscr();
printf(\t enter the string \n\t);
gets(s);
l=strlen(s);
printf(\t%d,l);
printf(\n\n);
j=0;
printf( \tenter the frame size: \t );
scanf(%d,&n);
k=l/n;
for(i=0;i {
printf(\t DLESTX);
while(j {

putchar(s);
c++;
j++;
if(c==n)
break;
}
printf( DLESTX \t);
printf(\n\n);
c=0;
}
getch();
....etc

[:=Read Full Message Here=:]

how to implement and simulate vfa in matlab? Can we get some help in code. ....etc

[:=Read Full Message Here=:]

floyd warshall in ns2

Floyd Warshall Algorithm

We initialize the solution matrix same as the input graph matrix as a first step. Then we update the solution matrix by considering all vertices as an intermediate vertex. The idea is to one by one pick all vertices and update all shortest paths which include the picked vertex as an intermediate vertex in the shortest path. When we pick vertex number k as an intermediate vertex, we already have considered vertices {0, 1, 2, .. k-1} as intermediate vertices. For every pair (i, j) of source and des ....etc

[:=Read Full Message Here=:]