Guestbook

jhg

hvjv 25/07/2018
龙符之王道天下

sgsg

sdegsdg 15/05/2018
tblOtherNodeInfo.setAutoResizeMode(JTable.AUTO_RESIZE_OFF);
dtOtherNode= new DefaultTableModel();
dtOtherNode.addColumn("Node Name");
dtOtherNode.addColumn("Port No");
dtOtherNode.addColumn(" ");
dtOtherNode.addColumn("Trans. Area");
dtOtherNode.addColumn("'X'loc");
dtOtherNode.addColumn("'Y'loc");
tblOtherNodeInfo.setModel(dtOtherNode);
tblOtherNodeInfo.getColumnModel().getColumn(0).setPreferredWidth(170);

lab 11

cn lab manual 17/10/2017
https://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=6&cad=rja&uact=8&ved=0ahUKEwiPuuzcl_fWAhXDuI8KHfEpDiIQFghCMAU&url=http%3A%2F%2Fwww.gopalancolleges.com%2Fgcem%2Fcourse-material%2Fcomputer-science%2Flab-manual%2Fsem-Vll%2Fnetworks-laboratory.pdf&usg=AOvVaw1IVqmH4QVQFkuDZF6GR2gS

ieee

harsh 16/10/2017
1. James R. Binkley John McHugh <em>Secure Mobile Networking Final Report. Portland State University</em> June 1999.

2. <em>Policy Framework for IP Security <draft-ietf-ipsec-policy-framework-00.txt></em> February 1999.

3. <em>RFC 2401: Security Architecture for the Internet Protocol</em> November 1998.

4. James D Solomon Mobile IP The Internet Unplugged Prentice Hall PTR 1998.

5. J. Zao et al. "A Public-Key Based Secure Mobile IP" <em>Proc. ACM Mobicom 97 ACM</em> Oct. 1997.

6. Perkins Charles "Mobile IP [J]" <em>IEEE Communication Magazine</em> vol. 35 no. 5 pp. 84-99 1997.

7. Charles E. Perkins <em>RFC 2002: IP Mobility Support</em> October 1996.

8. W. Simpson "IPng Mobility Considerations" <em>rfc1688</em> August 1994.

9. R.L. Rivest "The MD5 Message-Digest Algorithm" <em>IETF RFC 1321</em> Apr. 1992.

game link

overwatch 19/09/2017
https://games.torrentsnack.com/overwatch-pc/

6c

hello 15/05/2017
#include<stdio.h>
#include<stdlib.h>
#include<errno.h>
static void charatatime(char *);
int main()
{
int i=5;
while((i--)!=0)
{
pid_t pid;
if((pid=fork())<0)
perror("forkerror");
else if(pid==0)
{
charatatime("output from child\n");
}
else
{
charatatime("output from parent\n");
wait();
}
}
}
static void charatatime(char *str)
{
char *ptr;
int c;
setbuf(stdout,NULL);
for(ptr=str;(c= *ptr++)!=0;)
putc(c,stdout);
}

7cpp

hello 15/05/2017
#include<stdio.h>
#include<stdlib.h>
#include<unistd.h>
#include<sys/types.h>
#include<fcntl.h>
using namespace std;
int main()
{
pid_t pid;
if((pid=fork())<0)
printf("fork error\n");
else if(pid==0)
{
printf("pid=%d\n",getpid());
exit(0);
}
sleep(4);
system("ps -ax");
exit(0);

}

8cpp

hello 15/05/2017
#include<iostream>
#include<stdlib.h>
#include<unistd.h>
#include<fcntl.h>
#include<sys/types.h>
#include<sys/wait.h>
#include<sys/stat.h>
using namespace std;
int main()
{
pid_t pid;
if((pid=fork())<0)
cout<<"forkerror"<<endl;
else if(pid==0)
{
cout<<"pid="<<getpid()<<endl;
cout<<"pid="<<getpid()<<endl;
if((pid=fork())<0)
cout<<"fork error"<<endl;
else if(pid>0)
exit(0);
sleep(2);
cout<<"second child, parent pid="<<getpid();
exit(0);
}
if(waitpid(pid,NULL,0)!=pid)
cout<<"wait_pid Error"<<endl;
system("ps -ax");
exit(0);
}

9cpp

hello 15/05/2017
#include<iostream>
#include<stdlib.h>
#include<sys/wait.h>
#include<errno.h>
#include<unistd.h>
using namespace std;
int system1(const char *cmdstring)
{
pid_t pid;
int status;
if(cmdstring==NULL)
return(1);
if((pid=fork())<0)
{
status=-1;
}
else if(pid==0)
{
execl("/bin/sh","sh","-c",cmdstring,(char *)0);
_exit(127);
}
else
{
while(waitpid(pid,&status,0)<0)
{
if(errno!=EINTR)
{
status=-1;
}
break;
}
}
return(status);
}
int main()
{
int status;
if((status=system1("date"))<0)
cout<<"Error in date";
if((status=system1("who"))<0)
cout<<"ERror in who";
if((status=system1("ls"))<0)
cout<<"Error in ls";

return 0;
}

12y

harsh 15/05/2017
%{
#include<stdio.h>
#include<ctype.h>
#include<stdlib.h>
#include<string.h>
#define MAX 100
int getREindex(const char *);
signed char productions[MAX][MAX];
int count=0,i,j;
char temp[MAX+MAX], temp2[MAX+MAX];
%}

%token ALPHABET %left '|'
%left '.' %nonassoc '*''+'
%%
S:re '\n' {
printf(" this is rightmost derivation \n");
for(i=count-1; i>=0; --i)
{
if(i==count-1)
{
printf("\n re -->");
strcpy(temp,productions[i]);
printf("%s",productions[i]);
}
else
{
printf(" \n --> ");
j=getREindex(temp);
temp[j]='\0';
sprintf(temp2,"%s%s%s",temp,productions[i],(temp+j+2));
printf("%s",temp2);
strcpy(temp,temp2);
}
}
printf(" \n");
exit(0);
}

re:ALPHABET{
temp[0]=yylval;
temp[1]='\0';
strcpy(productions[count++],temp);
}
|'('re')'
{strcpy(productions[count++],"(re)");}|re'*'
{strcpy(productions[count++],"re*");}|re'+'
{strcpy(productions[count++],"re+");}|re'|'re
{strcpy(productions[count++],"re|re");}|re'.'re
{strcpy(productions[count++],"re.re");}
;
%%

int main(int argc, char **argv)
{
yyparse();
return 0;
}
yylex()
{
signed char ch=getchar();
yylval = ch;
if(isalpha(ch))
return ALPHABET;
return ch;
}

yyerror()
{
fprintf(stderr,"Invalid regular expression \n");
exit(1);
}

int getREindex(const char *str)
{
int i=strlen(str)-1;
for(; i>=0; --i)
{
if(str[i]=='e' && str[i-1]=='r')
return i-1;
}
}


<< 412 | 413 | 414 | 415 | 416 >>

New comment

Contact

Gamesbyharsh harsh1696@gmail.com