|
Anonymous |
|
nice site
|
0 |
Nov 13 2008, 6:03 AM EST by
Anonymous |
|
|
Thread started: Nov 13 2008, 6:03 AM EST
Watch
you look cool man
out of
found this valuable.
Do you find this valuable?
|
|
Anonymous |
|
RMI-Program
|
0 |
Oct 16 2007, 12:49 PM EDT by
Anonymous |
|
|
Thread started: Oct 16 2007, 12:49 PM EDT
Watch
//RMI Interface
import java.rmi.*; public interface Hello extends java.rmi.Remote { public void Hi() throws java.rmi.RemoteException; }
Save this file as Hello.java and Compile it using javac.
//Implementation File
import java.rmi.*;
class Implementation extends java.rmi.server.UnicastRemoteObject implements Hello { Implementation() throws java.rmi.RemoteException { super(); } public void Hi() throws java.rmi.RemoteException { System.out.println("HELLO!!!"); } }
Save file as Implementation.java and compile it.
//Server Side Program
import java.rmi.Naming; class Server { public static void main(String args[]) { try { Implementation i = new Implementation();
Naming.rebind("rmi://localhost:1099/HelloService",i); } catch(Exception e) { System.out.println("Exception at server!!"+e); } } }
Save file as Server.java and compile.
//Client Side Implementation
import java.rmi.Naming; class Client { public static void main(String args[]) { try { Hello p=(Hello)Naming.lookup("rmi://localhost/HelloService"); p.Hi(); } catch(Exception e) { System.out.println("Exception at client"); } } }
Save File as Client.java and compile.
Execution: 1.Open command 2. rmic Implementation 3. rmiRegistry 4.Open new command prompt 4.1 java Server 5.Open new Command prompt 5.1 java Client 6.Stop.
1
out of
1 found this valuable.
Do you find this valuable?
Do you?
|
|
Anonymous |
|
very nic
|
1 |
Sep 29 2007, 11:24 AM EDT by
Anonymous |
|
|
Thread started: Jul 21 2007, 10:58 AM EDT
Watch
simply superbbbbbbbbbb
2
out of
2 found this valuable.
Do you find this valuable?
Do you?
Show Last Reply
|
|
Last Reply:
RE: very nic
By: Posted Anonymously,
Sep 29 2007, 11:24 AM EDT
Photo- really fantastic!!!!!!!!!! All the best for ur future.
out of
found this valuable.
Do you find this valuable?
|
|
|
|
|
String Reversal continue 1-2
|
0 |
Aug 26 2007, 1:21 PM EDT by
|
|
|
Thread started: Aug 26 2007, 1:21 PM EDT
Watch
char* StrReverse1(char* str)
{
char *temp, *ptr;
int len, i;
temp=str;
for(len=0; *temp !='\0';temp++, len++);
ptr=malloc(sizeof(char)*(len+1));
for(i=len-1; i>=0; i--)
*(ptr+len-i-1)=*(str+i);
*(ptr+len)='\0';
return ptr;
}
char* StrReverse2(char* str)
{
int i, j, len;
char temp;
char *ptr=NULL;
i=j=len=temp=0;
len=strlen(str);
ptr=malloc(sizeof(char)*(len+1));
ptr=strcpy(ptr,str);
for (i=0, j=len-1; i<=j; i++, j--)
{
temp=ptr[i];
ptr[i]=ptr[j];
ptr[j]=temp;
}
return ptr;
}
void StrReverse3(char* str)
{
int i, j, len;
char temp;
i=j=len=temp=0;
len=strlen(str);
for (i=0, j=len-1; i<=j; i++, j--)
{
temp=str[i];
str[i]=str[j];
str[j]=temp;
}
}
/*A coooooooooool way of reversing a string by recursion. I found it at this web address
http://www.geocities.com/cyberkabila/datastructure/datastructuresright_reversestring.htm
*/
void StrReverse4(char *str)
{
if(*str)
{
StrReverse4(str+1);
putchar(*str);
}
}
out of
found this valuable.
Do you find this valuable?
|
|
|
|
String Reversal 1-1
|
0 |
Aug 26 2007, 1:20 PM EDT by
|
|
|
Thread started: Aug 26 2007, 1:20 PM EDT
Watch
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char* StrReverse(char*);
char* StrReverse1(char*);
char* StrReverse2(char*);
void StrReverse3(char*);
void StrReverse4(char*);
int main(void)
{
char str[50];
int temp=0;
printf("Enter a string: ");
scanf("%s", str);
printf("The reverse of the string is: %s\n", StrReverse(str));
printf("The reverse of the string is: %s\n", StrReverse1(str));
printf("The reverse of the string is: %s\n", StrReverse2(str));
StrReverse3(str);
printf("The reverse of the string is: %s\n", str);
//Get back the original string
StrReverse3(str);
//Reverse it again
printf("The reverse of the string is: ");
StrReverse4(str);
printf("\n");
scanf("%d", &temp);
}
char* StrReverse(char* str)
{
char *temp, *ptr;
int len, i;
temp=str;
for(len=0; *temp !='\0';temp++, len++);
ptr=malloc(sizeof(char)*(len+1));
for(i=len-1; i>=0; i--)
ptr[len-i-1]=str[i];
ptr[len]='\0';
return ptr;
}
out of
found this valuable.
Do you find this valuable?
|
|
Anonymous |
|
your first picture in the photo
|
0 |
Aug 21 2007, 10:00 AM EDT by
Anonymous |
|
|
Thread started: Aug 21 2007, 10:00 AM EDT
Watch
very nice ...all the best for ur future projects
1
out of
1 found this valuable.
Do you find this valuable?
Do you?
|
|
Anonymous |
|
Ajith in kreedom!!! Thala Rock---reviw by india glits
|
0 |
Aug 10 2007, 3:25 PM EDT by
Anonymous |
|
|
Thread started: Aug 10 2007, 3:25 PM EDT
Watch
http://www.youtube.com/watch?v=O2I8lURCVO4
1
out of
1 found this valuable.
Do you find this valuable?
Do you?
|
|
Anonymous |
|
the site is cool
|
0 |
Jul 21 2007, 11:31 AM EDT by
Anonymous |
|
|
Thread started: Jul 21 2007, 11:31 AM EDT
Watch
i see grt work in ur site and tat it make it really cool ...tat too the picture effect is grt ... nice job.... keep up the good work .... and looking for still more of ur works... all the best..
2
out of
2 found this valuable.
Do you find this valuable?
Do you?
|
|
Anonymous |
|
Sending the program for OSPF------PART 2
|
0 |
Apr 9 2007, 3:34 PM EDT by
Anonymous |
|
|
Thread started: Apr 9 2007, 3:34 PM EDT
Watch
for(i=0;i<=num;i++)
{
for(j=i+1;j<=num;j++)
{
& nbsp; if(cost[i]>cost[j])
{
temp=cost[i];
cost[i]=cost[j];
cost[j]=temp;
temp=hop[i];
hop[i]=hop[j];
hop[j]=temp;
temp=router[i];
  ; router[i]=router[j];
router[j]=temp;
}
}
}
cout<<"\n\n\n\n\n";
cout<<"Possible Shortest Path from the config.\n";
cout<<"Router no\tHop\tcost\n";
cnt =0;
for(i=0;i<=num;i++)
{
cout<<router[i]<<"\t"<<hop[i]<<"\t"<<cost[i]<<endl;
}
getch();
}
out of
found this valuable.
Do you find this valuable?
|
|
Anonymous |
|
Sending the program for OSPF------PART 1
|
0 |
Apr 9 2007, 3:33 PM EDT by
Anonymous |
|
|
Thread started: Apr 9 2007, 3:33 PM EDT
Watch
Sending the program for OSPF(Output just displays all
shortest path routes in the network)
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int num=0,rinfo[81],sum=0,cnt=0,hop[81],cost[81],router[81],temp=0;
cout<<"How Many Routers Between Source And Destination other than router 1???\n";
cin>>num;
cout<<"Enter Router Details\n";
for(int i=0;i<num;i++)
{
cout<<"To how many routers is router\t"<<i+1<<"connected?";
cin>>rinfo[i];
sum=sum+rinfo[i];
if(sum>num+1)
{
cout<<"Error In Network Config...\n";
break;
}
}
cout<<"Enter the next hop no. and the cost between the connected routers\n";
int j=0;
for(i=0;i<num;i++)
{
cnt=1;
while(cnt<=rinfo[i])
{
router[j]=i+1;
cout<<"Enter the Next Hop!\n";
cin>>hop[j];
cout<<"Enter the cost Between Routers"<<i+1<<"And"<<hop[j]<<" : ";
cin>>cost[j];
cnt++;
j++;
}
}
cout<<"Router DataBase\n";
cout<<"Router No.\tcost\tNext Hop\n\n";
j=0;
for(i=0;i<num;i++)
{
cnt=1;
while(cnt<=rinfo[i])
{
cout<<i+1<<"\t"<<hop[j]<<"\t"<<cost[j]<<endl;
cnt++;
j++;
}
}
out of
found this valuable.
Do you find this valuable?
|
|
Anonymous |
|
FILE TRANSFER PROTOCOL
|
0 |
Apr 9 2007, 3:28 PM EDT by
Anonymous |
|
|
Thread started: Apr 9 2007, 3:28 PM EDT
Watch
FILE TRANSFER PROTOCOL
#include<stdio.h>
#include<conio.h>
#include<fstream.h>
#include<dos.h>
void main()
{
clrscr();
FILE *fp;
char fname[30],ch;
printf("\nCLIENT REQUESTE A FILE FROM SERVER\n");
printf("\n-----------------------------------\n");
printf("\nENTER THE REQUESTED FILE :");
scanf("%s",&fname);
printf("\nFILE SENDING");
delay(1000);
printf(".");
delay(1000);
printf(".");
delay(1000);
printf(".");
printf("\n\nFILE SENDING");
delay(1000);
printf(".");
delay(1000);
printf(".");
delay(1000);
printf(".");
printf("\n\nTHE %s FILE HAS BEEN SENT TO SERVER SUCESSSFULLY...",fname);
delay(2000);
printf("\n\nSERVER SIDE\n");
printf("\n\nREQUESTED FILE FROM THE CLIENT IS : %s",fname);
printf("\n\nSEARCHING A %s FILE FROM THE DATABASE.....\n",fname);
delay(500);
printf("\nSEARCHING.");
delay(1000);
printf(".");
delay(1000);
printf(".");
delay(1000);
printf(".");
printf("\n\nSEARCHING.");
delay(1000);
printf(".");
delay(1000);
printf(".");
delay(1000);
printf(".");
printf("\n\nFILE FOUND! ! ! ! \n");
printf("\nSERVER FORWARD THE FILE TO REQUESTED CLIENT\n");
printf("\nSERVER FORWARD THE FILE...");
delay(2000);
printf("\n\nSERVER FORWARD THE FILE...");
delay(2000);
printf("\n\nSERVER FORWARD THE FILE...");
delay(2000);
printf("\n\n\n CLIENT SIDE\n");
printf("\n-------------\n");
printf("\n\nTHE CONTANT OF THE %s FILE IS\n\n",fname);
fp=fopen(fname,"r");
{
if(fp==NULL)
{
printf("\n\nFILE NOT FOUND! ! ! !TRY AGAIN\n");
}
else
{
while(!feof(fp))
{
ch=getc(fp);
printf("%c",ch);
}
}
}
fclose(fp);
getch();
}
out of
found this valuable.
Do you find this valuable?
|
|
Anonymous |
|
DNS
|
0 |
Apr 9 2007, 3:25 PM EDT by
Anonymous |
|
|
Thread started: Apr 9 2007, 3:25 PM EDT
Watch
#include<iostream.h>
#include<string.h>
#include<conio.h>
#include<stdio.h>
struct dns
{
char host[81];
char ip[81];
}obj[81];
int ch,opt=0;
char dname[81],ipad[81];
void main()
{
clrscr();
cout<<"Enter the host and IP addresses of 5 domains\n";
for(int i=0;i<5;i++)
{
cin>>obj[i].host;
cin>>obj[i].ip;
}
do
{
cout<<"\n1.Resolve By Name\n2.Resolve by IP Address\n";
cin>>ch;
switch(ch)
{
case 1:
cout<<"Enter the domain name\n";
cin>>dname;
for(i=0;i<5;i++)
{
if(strcmp(obj[i].host,dname)==0)
{
cout<<"IP ADDRESS IS:"<<obj[i].ip<<endl;
}
}
break;
case 2:
cout<<"Enter the ip address\n";
cin>>ipad;
for(i=0;i<5;i++)
{
if(strcmp(obj[i].ip,ipad)==0)
{
cout<<"Domain Name IS:"<<obj[i].host<<endl;
}
}
break;
}
cout<<"Wanna Continue?1-yes 0-no\n";
cin>>opt;
}while(opt==1);
getch();
}
1
out of
1 found this valuable.
Do you find this valuable?
Do you?
|
|
|
|
Bit stuffing
|
0 |
Apr 8 2007, 12:29 PM EDT by
|
|
|
Thread started: Apr 8 2007, 12:29 PM EDT
Watch
#include<math.h>
#include<conio.h>
#include<iostream.h>
#include<stdio.h>
void stuff();
long int len,count,pos;
long int bitstr[81];
void main()
{
clrscr();
len=0;
count=0;
pos=0;
for(int i=0;i<81;i++)
bitstr[i]=0;
cout<<"Enter the length of the bitstring\n";
cin>>len;
cout<<"Enter the bitstring\n";
for(i=0;i<len;i++)
{
cin>>bitstr[i];
}
for(i=0;i<len;i++)
{
if(bitstr[i]==1)
{
count++;
}
else
{
count=0;
}
if(count==5)
{
pos=i;
stuff();
count=0;
}
}
cout<<"BitStuffed Output.....\n";
for(i=0;i<len+1;i++)
{
cout<<bitstr[i]<<endl;
}
getch();
}
void stuff()
{
long int t[81];
int j=0;
for(j=0;j<81;j++)
t[j]=0;
j=0;
for(int i=pos;i<=len;i++)
{
t[j]=bitstr[i];
bitstr[i]=0;
j++;
}
j=0;
for(i=pos+1;i<len+1;i++)
{
bitstr[i]=t[j];
j++;
}
}
4
out of
4 found this valuable.
Do you find this valuable?
Do you?
|
|
|
|
Sliding window
|
0 |
Apr 8 2007, 12:27 PM EDT by
|
|
|
Thread started: Apr 8 2007, 12:27 PM EDT
Watch
#include<dos.h>
#include<conio.h>
#include<stdio.h>
void send();
int wndsize,n,cnt=0,i,j;
int static count=0;
int frame[81];
void main()
{
clrscr();
x: printf("Enter The Size Of The Window:");
scanf("%d",&wndsize);
printf("\nEnter The Number Of Frames To Be Sent:");
scanf("%d",&n);
printf("Enter The Datas:\n");
for(i=0;i<n;i++)
{
scanf("%d",&frame[i]);
}
if(wndsize>n)
{
printf("The Windowsize Is Not Fully Used");
goto x;
}
for(i=0;i<n;i++)
{
send();
}
getch();
}
void send()
{
count++;
if(count<n)
{
printf("\n\nReceived Frame:%d",count);
printf("\n\nWaitingfor.....Frame%d",count+1);
}
else
{
printf("\nReceived Frame:%d",count);
printf("\nAll Frames Received\n");
printf("The Received Frames Are:\n");
for(i=0;i<n;i++)
{
printf("%d",frame[i]);
printf("\n");
}
}
}
2
out of
2 found this valuable.
Do you find this valuable?
Do you?
|
|
|
|
Rs 232
|
0 |
Apr 8 2007, 12:25 PM EDT by
|
|
|
Thread started: Apr 8 2007, 12:25 PM EDT
Watch
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
char fname[81];
FILE *fp;
void main()
{
clrscr();
int ch=0;
char disp;
int op=0;
do
{
cout<<"****RS-232 MENU****\n1.Send\n2.Receive\n";
cin>>ch;
switch(ch)
{
case 1:
cout<<"enter the filename\n";
cin>>fname;
fp=fopen(fname,"r");
if(fp==NULL)
{
cout<<"Error\n";
}
else
{
cout<<"DATA Ready!!!\n";
}
fclose(fp);
break;
case 2:
fp=fopen(fname,"r");
while(!feof(fp))
{
disp=getc(fp);
cout<<disp;
}
fclose(fp);
break;
}
cout<<"Wanna Continue???1-yes 0-no\n";
cin>>op;
}while(op==1);
getch();
}
2
out of
2 found this valuable.
Do you find this valuable?
Do you?
|
|
|
|
Arp
|
0 |
Apr 8 2007, 12:24 PM EDT by
|
|
|
Thread started: Apr 8 2007, 12:24 PM EDT
Watch
#include<dos.h>
#include<conio.h>
#include<iostream.h>
#include<stdlib.h>
void main()
{
clrscr();
int ch;
cout<<"++++++MENU++++++\N1.ARP\n2.RARP\n";
cin>>ch;
switch(ch)
{
case 1:
system("net view");
break;
case 2:
system("ipconfig");
break;
}
getch();
}
2
out of
2 found this valuable.
Do you find this valuable?
Do you?
|
|
intel_ram2002 |
|
FOR POSTER DESIGN JUST PASTE THE LINK IN THE ADDRESS BAR AND CLICK GO
|
0 |
Jan 2 2007, 2:20 PM EST by
intel_ram2002 |
|
|
Thread started: Jan 2 2007, 2:20 PM EST
Watch
2
out of
2 found this valuable.
Do you find this valuable?
Do you?
|
|
Anonymous |
|
change
|
0 |
Dec 28 2006, 11:18 PM EST by
Anonymous |
|
|
Thread started: Dec 28 2006, 11:18 PM EST
Watch
the sword looks good make the sword as the T in ASthra
2
out of
2 found this valuable.
Do you find this valuable?
Do you?
|
|
Anonymous |
|
3d-max 8 activation key
|
0 |
Dec 28 2006, 2:47 PM EST by
Anonymous |
|
|
Thread started: Dec 28 2006, 2:47 PM EST
Watch
Try This any 1 for activation of 3d-max8 software...
By Balakumaran M
L7GPZJCU7JTAHLCX WW0WJEJPXATJTEFP
VDPNYVC84AP4ZAKT PECS932L8ESYEQE6
UFAC6CTU4LG7T0NT E81RRDYYHW22XXU3
JA9PS6JA44F9SJY1 XQDLQN7XNCSZWD0F
PZXPECDJXS6J5EA9 2C0R3FLQ6SSCZXFX
PS0LEQ9P5UEZ1Y0P Q1005HVRXYL92LW1
V28KAKEQJH4K46DP Q3RUSTEFT63Z4JCY
W33DZN27H901Q2LT CZNFLHJ4GU32YSFG
J6J89FA363PKN3RE TQXQXCCPAPQEWUVK
KFPLZYJAK1W5SANE KDZLP1WG0SCC55LW
1
out of
1 found this valuable.
Do you find this valuable?
Do you?
|
|
|
|
For applying for Duplicate Certificate
|
0 |
Dec 26 2006, 1:47 AM EST by
|
|
|
Thread started: Dec 26 2006, 1:47 AM EST
Watch
http://www.annauniv.edu/coe/info.html#Mark
4
out of
4 found this valuable.
Do you find this valuable?
Do you?
|