Ajinkya Mandhare: TE VI SEM

Showing posts with label TE VI SEM. Show all posts

Wednesday, 4 May 2011

Tagged under: Hospital Management, Rational Rose, TE VI SEM

Object Oriented Software Engineering- Hospital Management in Rational Rose

Rational Rose is a tool set produced and marketed by Rational Software Corporation (now owned by IBM). Rose is an operational tool set that uses the Unified Modeling Language (UML) as its means for facilitating the capture of domain semantics and architecture/design intent. UML has a number of different notations, allowing the specification of the artifacts of design from many different perspectives and for different objectives during the computer engineering life cycle. Most of these notations are directly supported through the Rose tool set.

Rational Rose is an object-oriented Unified Modeling Language (UML) software design tool intended for visual modeling and component construction of enterprise-level software applications. In much the same way a theatrical director blocks out a play, a software designer uses Rational Rose to visually create (model) the framework for an application by blocking out classes with actors (stick figures), use case elements (ovals), objects (rectangles) and messages/relationships (arrows) in a sequence diagram using drag-and-drop symbols. Rational Rose documents the diagram as it is being constructed and then generates code in the designer's choice of C++, Visual Basic, Java, Oracle8, Corba or Data Definition Language.

Hospital Management
You can download the Software engineering models for hospital management from the download box alongside. These models were prepared using Rational Rose.

Anonymous 10:49 am No comment

Tuesday, 3 May 2011

Tagged under: Programs, Source codes, system programming and compiler construction, TE VI SEM

System Programming & Compiler Construction

Here are all Spcc prog.
Download them from the download box alongside.
Note: If the question has the source prog in c language, & they ask for Uniform symbol table, or literal table, then don't get confused. It is not the prog of Assembler, but of Lexical Analyzer. If it is an assembly lang prog & they ask to find the Sym/lit table, then it is the question of Assembler.

Anonymous 3:04 pm No comment

Monday, 2 May 2011

Tagged under: Advanced Microprocessors, TE VI SEM

Advanced MicroProcessors

AMP All Programs
you can download all the programs from the download box alongside

Note: It does not include EFlags

Anonymous 7:41 pm No comment

Sunday, 1 May 2011

Tagged under: TE VI SEM

Advanced MicroProcessor Reservation Table

Reservation table

1. Collision vector=(100)

Simple cycles: (2),(4),(1,4),(1,1,4),(2,4)etc

Greedy cycle: (1,4,2,4),(1,1,4,2,4)etc

MAL=2

Max throughput=0.5

2. . Collision vector=(10)

Simple cycles: (3),(1,3)

Greedy cycle: (1,3,3),(3,1,3)

MAL=2

Max throughput=0.5

3. Collision vector=(110)

Simple cycles: (4),(1,4)

Greedy cycle: (1,4,4),(4,1,4)

MAL=2.5

Max throughput=0.4

4. Collision vector=(11)

Simple cycles: (3)

Greedy cycle: ---

MAL=3

Max throughput=0.33

Note: The above answers were found to be correct by me. However I don't take the responsibility of this being fail-proof!!

Anonymous 5:00 pm No comment

Friday, 29 April 2011

Tagged under: lexical analyzer, Programs, Source codes, TE VI SEM

Lexical Analyzer

LEXICAL ANALYZER
Download the program for Lexical Analyzer from the download box alongside

Anonymous 12:57 pm No comment

Tagged under: TE VI SEM

OOSE Practicals

Question Bank for OOSE Practical Exam

1. Airline Reservation System

2. Railway Reservation System

3. Nokia Gallery

4. Banking System

5. Big Bazaar

6. Bus Reservation System

7. Movie Ticket Reservation

8. Hospital Management System

9. Star Plus Serial Schedule Management System

10. SUC Event Management

11. Hotel Management

12. IPL Matches

Following diagrams will be asked based on above systems…

1. Class Diagram

2. Sequence Diagram

3. Collaboration Diagram

4. State Transition Diagram

5. Activity Diagram

6. Use Case Diagram

Only System name would be given…

Example: Class diagram for Hospital Management System.

Note: Students first have to write the problem statement.. Then draw d diagram on answer sheet nd then perform pracs..

Anonymous 12:38 pm 2 comments

Thursday, 28 April 2011

Tagged under: Android operating system, featured, PPT, Seminar, TE VI SEM

ANDROID SEMINAR

Android Seminar

Anonymous 5:54 pm No comment

Tagged under: Assemblers, system programming and compiler construction, TE VI SEM

Assemblers (Pass1)

Programs for Pass1 assembler:
1. Pass 1(a):

import java.io.*;
import java.util.*;
class Pass1a
{public static void main(String args[])throws IOException
{
int i=0;
FileWriter fw=new FileWriter("Input.txt");
Scanner src=new Scanner(System.in);
System.out.println("Enter code");
String code=src.next();
char code1[]=new char[500];
code1=code.toCharArray();
int n=code.length();

for( i=0;i<n;++i)
{
while((code1[i]!='|')&&i<n-1)
{
if(code1[i]==';')
{fw.write("\n");
++i;
continue;

}
fw.write(code1[i]);
++i;
}
fw.write(" ");
}

fw.close();
FileReader fr=new FileReader("Input.txt");
BufferedReader br=new BufferedReader(fr);
String input;
while((input=br.readLine())!=null)
System.out.println(input);
String token="";
i=0;
String prg[][] = new String[30][4];
int lines=0;
input="";
FileReader fr1=new FileReader("Input.txt");
BufferedReader br1=new BufferedReader(fr1);

while((input=br1.readLine())!=null)
{
int l=input.length();
i=0;
token = "";

while(i<l)
{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
			i++;
}

if(token=="") token="   ";
	prg[lines][0]=token;

token = "";

while(i<l)
		if(input.charAt(i)==' ')
		i++;
		else break;

while(i<l)
	{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token=" ";
	prg[lines][1]=token;

while(i<l)
		if(input.charAt(i)==' ') 
		i++;
		else break;

token = "";

while(i<l)
	{
		if(input.charAt(i)!=' ' && input.charAt(i)!=',')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token=" ";
	prg[lines][2]=token;

while(i<l)
		if(input.charAt(i)==' ' || input.charAt(i)==',') i++;
		else break;

token = "";

while(i<l)
	{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token="";
	prg[lines][3]=token;

lines++;
	i=l;

}
int j;

System.out.println("\n");
for(i=0;i<lines;i++)
{
	for(j=0;j<4;j++)
		System.out.print(prg[i][j]+"\t");
	System.out.println();
}

}}

2. Pass 1(b):

import java.io.*;
import java.util.*;
class Pass1b
{public static void main(String args[])throws IOException
{
int i=0;
FileWriter fw=new FileWriter("Input.txt");
Scanner src=new Scanner(System.in);
System.out.println("Enter code");
//int n=src.nextInt();
//St s[]=new St[n];
String code=src.next();
char code1[]=new char[500];
code1=code.toCharArray();
//for(int i=0;i<10;++i)
//System.out.println(code1[i]);
int n=code.length();
System.out.println(n);

for( i=0;i<n;++i)
{
while((code1[i]!='|')&&i<n-1)
{
if(code1[i]==';')
{fw.write("\n");
++i;
continue;

}
//System.out.println(i);
fw.write(code1[i]);
++i;
}
fw.write(" ");
}

fw.close();
FileReader fr=new FileReader("Input.txt");
BufferedReader br=new BufferedReader(fr);
String input;
while((input=br.readLine())!=null)
System.out.println(input);
//fr.close();
String token="";
i=0;
String prg[][] = new String[30][4];
int lines=0;
input="";
FileReader fr1=new FileReader("Input.txt");
BufferedReader br1=new BufferedReader(fr1);

while((input=br1.readLine())!=null)
{
int l=input.length();
i=0;
token = "";

while(i<l)
{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
			i++;
}

if(token=="") token=" ";
	prg[lines][0]=token;

token = "";

while(i<l)
		if(input.charAt(i)==' ') i++;
		else break;

while(i<l)
	{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token=" ";
	prg[lines][1]=token;

while(i<l)
		if(input.charAt(i)==' ') i++;
		else break;

token = "";

while(i<l)
	{
		if(input.charAt(i)!=' ' && input.charAt(i)!=',')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token=" ";
	prg[lines][2]=token;

while(i<l)
		if(input.charAt(i)==' ' || input.charAt(i)==',') i++;
		else break;

token = "";

while(i<l)
	{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token="";
	prg[lines][3]=token;

lines++;
	i=l;

}
int j;
System.out.println("\n");
for(i=0;i<lines;i++)
{
	for(j=0;j<4;j++)
		System.out.print(prg[i][j]+"\t");
	System.out.println();
}

String mnemonics[] = new String[10];
int mlen[] = new int[10];
int mno = 0;

mnemonics[mno]="L";
mlen[mno++]=4;
mnemonics[mno]="A";
mlen[mno++]=4;
mnemonics[mno]="ST";
mlen[mno++]=4;

String pseudo[] = new String[10];
int pno=0;

pseudo[pno++]="START";
pseudo[pno++]="BALR";
pseudo[pno++]="USING";
pseudo[pno++]="DC";
pseudo[pno++]="DS";
pseudo[pno++]="END";

System.out.println();
System.out.println("-------------------------------------------");
System.out.println("Mnemonics opcode Table is : ");
System.out.println();

System.out.println("Mnemonics\tLength");
System.out.println();

for(i=0;i<mno;i++)
{
	System.out.print(mnemonics[i]+"\t\t  "+mlen[i]);
	System.out.println();
}

System.out.println();
System.out.println("-------------------------------------------");
System.out.println("Pseudo opcode Table is : ");
System.out.println();

System.out.println("Psuedo\tRoutine Adderess");
System.out.println("Opcode");
System.out.println();

for(i=0;i<pno;i++)
{
	System.out.print(pseudo[i]+"\t\t"+i);
	System.out.println();
}

String symbol[] = new String[20];
int sym_value[] = new int[20];
int symno = 0;

int lc=0;
for(i=0;i<lines;i++)
{
	token = prg[i][0];
	if(token!=" ")
	{
		symbol[symno] = token;
		sym_value[symno++] = lc;
	}

token = prg[i][1];

if(token.equalsIgnoreCase("DC")) lc=lc+4;
	else if(token.equalsIgnoreCase("DS")) lc=lc+4;
	else
	{
		for(j=0;j<mno;j++)
		{
			if(token.equals(mnemonics[j])) 
			{
				lc=lc+mlen[j];
				break;
			}
		}
	}

}

System.out.println();
System.out.println("-------------------------------------------");
System.out.println("Symbol Table is : ");
System.out.println();

System.out.println("Symbol\tValue");
System.out.println();

for(i=0;i<symno;i++)
{
	System.out.print(symbol[i]+"\t"+sym_value[i]);
	System.out.println();
}
}}

3. Pass 1(c):

import java.io.*;
import java.util.*;
class Pass1c
{public static void main(String args[])throws IOException
{
int i=0;
FileWriter fw=new FileWriter("Input.txt");
Scanner src=new Scanner(System.in);
System.out.println("Enter code with | as space & ; for next line");
String code=src.next();
char code1[]=new char[500];
code1=code.toCharArray();
int n=code.length();

for( i=0;i<n;++i)
{
while((code1[i]!='|')&&i<n-1)
{
if(code1[i]==';')
{fw.write("\n");
++i;
continue;

}
fw.write(code1[i]);
++i;
}
fw.write(" ");
}

while((input=br1.readLine())!=null)
{
int l=input.length();
i=0;
token = "";

while(i<l)
{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
			i++;
}

if(token=="") token=" ";
	prg[lines][0]=token;

token = "";

while(i<l)
		if(input.charAt(i)==' ') i++;
		else break;

while(i<l)
	{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token=" ";
	prg[lines][1]=token;

while(i<l)
		if(input.charAt(i)==' ') i++;
		else break;

token = "";

while(i<l)
	{
		if(input.charAt(i)!=' ' && input.charAt(i)!=',')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token=" ";
	prg[lines][2]=token;

while(i<l)
		if(input.charAt(i)==' ' || input.charAt(i)==',') i++;
		else break;

token = "";

while(i<l)
	{
		if(input.charAt(i)!=' ')
			token+=input.charAt(i);
		else break;
		i++;
	}

if(token=="") token="";
	prg[lines][3]=token;

lines++;
	i=l;

}
int j;
System.out.println("\n");
for(i=0;i<lines;i++)
{
	for(j=0;j<4;j++)
		System.out.print(prg[i][j]+"\t");
	System.out.println();
}

String mnemonics[] = new String[10];
int mlen[] = new int[10];
int mno = 0;

mnemonics[mno]="L";
mlen[mno++]=4;
mnemonics[mno]="A";
mlen[mno++]=4;
mnemonics[mno]="ST";
mlen[mno++]=4;

String pseudo[] = new String[10];
int pno=0;

pseudo[pno++]="START";
pseudo[pno++]="BALR";
pseudo[pno++]="USING";
pseudo[pno++]="DC";
pseudo[pno++]="DS";
pseudo[pno++]="END";

System.out.println();
System.out.println("-------------------------------------------");
System.out.println("Mnemonics opcode Table is : ");
System.out.println();

System.out.println("Mnemonics\tLength");
System.out.println();

for(i=0;i<mno;i++)
{
	System.out.print(mnemonics[i]+"\t\t  "+mlen[i]);
	System.out.println();
}

System.out.println();
System.out.println("-------------------------------------------");
System.out.println("Pseudo opcode Table is : ");
System.out.println();

System.out.println("Psuedo\tRoutine Adderess");
System.out.println("Opcode");
System.out.println();

for(i=0;i<pno;i++)
{
	System.out.print(pseudo[i]+"\t\t"+i);
	System.out.println();
}

String symbol[] = new String[20];
int sym_value[] = new int[20];
int symno = 0;
String literal[] = new String[20];
int lit_value[] = new int[20];
int litno = 0;
String lit="";
int lc=0;
for(i=0;i<lines;i++)
{
	token = prg[i][0];
	lit=prg[i][2];
	if(lit!="")
	{
	if(lit.charAt(0)=='=')
	{
   		literal[litno++] = lit;
 	}
	}

token = prg[i][1];

}

for(i=0;i<litno;i++)
{
lit=literal[i];

if(lit.charAt(1)=='F'||lit.charAt(1)=='f')
	{
   		lit_value[i] = lc;
		lc=lc+4;
	}

if(lit.charAt(1)=='H'||lit.charAt(1)=='h')
	{
   		lit_value[i] = lc;
		lc=lc+2;
	}

if(lit.charAt(1)=='D'||lit.charAt(1)=='d')
	{
   		lit_value[i] = lc;
		lc=lc+8;
	}
	
}
System.out.println();
System.out.println("-------------------------------------------");
System.out.println("Literal Table is : ");
System.out.println();

System.out.println("Literal\tValue");
System.out.println();

for(i=0;i<litno;i++)
{
	System.out.print(literal[i]+"\t"+lit_value[i]);
	System.out.println();
}

}}

NOTE:While entering the code use '|' as space & ';' for next line.

Anonymous 1:07 pm No comment

Wednesday, 20 April 2011

Tagged under: Android operating system, featured, Report, Seminar, TE VI SEM

Seminar Report

Android Operating System

Final Android

Anonymous 9:46 pm No comment

Thursday, 14 April 2011

Tagged under: TE VI SEM

ACN Practical exam list

ACN Practical Exam 2011

1. Install Web Server

Site Name:
Contents of the site:

2. Implement Virtual Hosting (name based)

IP Address:

Site Name:
Contents of the Site:

3. Implement Virtual Hosting (IP based)

IP Address:
Site Name:
Contents of the Site:

4. Analysis of packet captured (UDP)

Mention the port numbers of the captured packets

5. Analysis of packet captured (TCP)

Mention the flag status of the captured packets

6. Analysis of packet captured (ARP)

Mention the IP address of the source and destination hosts

7. Analysis of packet captured (IP)

Mention the IP address of the source and destination hosts

8. Implement Sliding Window Protocol (Go-Back-N)

9. Implement Sliding Window Protocol (Selective Repeat)

10. Implement Group Chat Server (2 Clients)

11. Implement Group Chat Server (3 Clients)

12. Implement multicast routing protocol DVMRP with following topology and groups

Node ____ is the source.

CBR traffic starts at ______ time.

Node ____ joins the group at _______ time.

Node ____ leaves the group at _______ time.

Anonymous 9:43 am No comment

Friday, 8 April 2011

Tagged under: Advanced Microprocessors, Superscaler Architecture, TE VI SEM

SUPERSCALAR ARCHITECTURE in terms of Pipelining

Superscaler Program

/***********To Study The SUPERSCALAR ARCHITECTURE in terms of Pipelining****************/

import java.util.*;
class  superscalar
{
	public static void main(String[] args) 
	{
		int n,i,j,k;
		Scanner sc=new Scanner(System.in);
		System.out.print("Enter number of instructions: ");
		n=sc.nextInt();
		if(n<=0)
		{
		System.out.println("No instructions available for execution!!!");
		System.exit(0);
		}
		System.out.println("Fetch\tDecode\tExecute\tWrite");
		for(i=1;i<=n;i++)
		{
			if(i%2==0)
			      even(i);
			else
			       odd(i);   
		}
		
		for(i=n-1;i>=(n-5)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();
		for(i=n;i>=(n-4)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();

System.out.print("   \t");
		for(i=n-1;i>=(n-3)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();
		
		System.out.print("   \t");
		for(i=n;i>=(n-2)&&i>0;i--)
		{
			System.out.print("   \t"+i);
			i--;
		}
		System.out.println();

if((n-1)>0)
			System.out.println("   \t\t\t"+(n-1));
		System.out.println("   \t\t\t"+n);
	}

static void even(int i)
	{
		int count=0,l;

for(l=i;l>=2;l--)
		{
			if(count==4)
			{
//                                System.out.println();
				break;
			}
			if(l%2==0)
			{
				System.out.print(l+"   \t");
				count++;
			}
		}
		System.out.println();
	}

static void odd(int i)
	{
		int count=0,l;
		for(l=i;l>=1;l--)
		{
			if(count==4)
			{
//                                System.out.println();
				break;
			}
			if(l%2==1)
			{
				System.out.print(l+"   \t");
				count++;
			}
		}
		System.out.println();
	}
}
/******************OUTPUT*****************
Enter number of instructions: 5
Fetch   Decode  Execute Write
1
2
3       1
4       2
5       3         1
        4         2
        5         3       1
                  4       2
                  5       3
                          4
                          5
*/

Anonymous 8:04 pm No comment

Tagged under: Data and Web Mining, TE VI SEM

Data & Web Mining

DWM Programs in java
Download the Data & Web Mining programs from the download box alongside.

Anonymous 8:02 pm No comment

Wednesday, 6 April 2011

Tagged under: Advanced Microprocessors, Arithmetic Pipelining, TE VI SEM

Arithmetic Pipelining for multiplicaion

ARITHMETIC PIPELINING
This the final prog for arithmetic pipelining. It works upto 8bit X 8bit multiplication. There were some minor changes in the datatypes of some variables as compared to the previous prog.

//Arithmetic Pipelining Program by Ajinkya
#include<iostream.h>
#include<math.h>
#include<conio.h>
#include<stdio.h>

int a1[20],a2[20],x[20],p[8][20],q[8][20],q2[8][20],i,j,k;
long q3[8][20];
int a,b;
void dectobin(int a, int a1[]);
void csa(int p[8][20]);
void cpa(int p[8][20]);

void main()
{
for(i=0;i<20;++i)
a1[i]=a2[i]=x[i]=0;
for(i=0;i<8;++i)
for(j=0;j<20;++j)
{p[i][j]=0;
q2[i][j]=0;
q3[i][j]=0;
}
clrscr();
cout<<"Enter multiplicand";
cin>>a;
cout<<"Enter multiplier";
cin>>b;
cout<<"A= ";
dectobin(a,a1);
for(i=0;i<8;++i)
cout<<a1[i];
cout<<endl<<"B= ";
dectobin(b,a2);
for(i=0;i<8;++i)
cout<<a2[i];
cout<<endl;
for(i=0;i<8;++i)
{
for(j=15;j>16-i-1;--j)
p[i][j]=0;
if(a2[i]==1)
{
k=0;
for(j=i;j<16;++j)
p[i][16-j-1]=a1[k++];
}
else
{for(j=i;j<16;++j)
p[i][16-j-1]=0;
}
}
for(i=0;i<8;++i)
{
cout<<"P"<<i<<" = ";
for(j=0;j<16;++j)
cout<<p[i][j];
cout<<endl;
}
i=0;
j=0;

csa(p);
i=i+3;
j++;
csa(p);
int z;
for(j=0;j<3;++j)
for(z=0;z<16;++z)
{if(j==0||j==1)
 {p[2*j][z]=q[j][z];
  p[2*j+1][z]=q2[j][z];
 }
 else
 {p[2*j][z]=p[3*j][z];
  p[2*j+1][z]=p[3*j+1][z];
 }
}
i=0;
j=0;
csa(p);
i=i+3;
++j;
csa(p);
for(j=0;j<3;++j)
for(z=0;z<16;++z)
{if(j==0||j==1)
 {p[2*j][z]=q[j][z];
  p[2*j+1][z]=q2[j][z];
 }
}
i=0;
j=0;
csa(p);
for(j=0;j<2;++j)
for(z=0;z<16;++z)
{if(j==0)
 {p[2*j][z]=q[j][z];
  p[2*j+1][z]=q2[j][z];
 }
 else
 p[2*j][z]=p[3*j][z];
}
i=0;j=0;
csa(p);
for(j=0;j<1;++j)
for(z=0;z<16;++z)
{p[2*j][z]=q[j][z];
 p[2*j+1][z]=q2[j][z];
}
i=0;j=0;
cpa(p);

getch();
}
void dectobin(int a, int a1[])
{i=0;
while(a>0)
{
x[i]=a%2;
a=a/2;
++i;
}
--i;
j=0;
while(i>=0)
{
a1[i]=x[i];

--i;
}
}
void csa(int p[8][20])
{
cout<<"CSA";
int z;
cout<<"Exor"<<endl;
 for(z=0;z<16;++z)
 {if((p[i][z]==p[i+1][z]==p[i+2][z]==0)||(p[i][z]==p[i+1][z]==1&&p[i+2][z]==0)||(p[i][z]==0&&p[i+1][z]==p[i+2][z]==1)||(p[i+1][z]==0&&p[i][z]==p[i+2][z]==1))
 q[j][z]=0;
 else
 q[j][z]=1;
 cout<<q[j][z];
 }

q2[j][15]=0;
 int r=0;
cout<<"Carry"<<endl;
 for(z=15;z>0;--z)
 {
 if((p[i][z]==0&&p[i+1][z]==0&&p[i+2][z]==0)||(p[i][z]==0&&p[i+1][z]==0)||(p[i+1][z]==0&&p[i+2][z]==0)||(p[i][z]==0&&p[i+2][z]==0))
{ //cout<<endl<<p[i][z]<<p[i+1][z]<<p[i+2][z];

q2[j][z-1]=0;
}  else
  q2[j][z-1]=1;

}

for(z=0;z<16;++z)
   cout<<q2[j][z];
   cout<<endl;

}

void cpa(int p[8][20])
{
cout<<"CPA";
cout<<endl<<"P= ";
   int z;
   int c=0;
   for(z=15;z>=0;--z)
   {if(q[j][z]==0&&q2[j][z]==0&&c==0)
    {q3[j][z]=0;
    }
    else
    {if((q[j][z]==1&&q2[j][z]==0&&c==0)||(q2[j][z]==1&&q[j][z]==0&&c==0)||(q[j][z]==0&&q2[j][z]==0&&c==1))
    { q3[j][z]=1;
       c=0;
     }
     else
     {if((q[j][z]==1&&q2[j][z]==1&&c==0)||(q[j][z]==1&&q2[j][z]==0&&c==1)||(q[j][z]==0&&q2[j][z]==1&&c==1))
      {q3[j][z]=0;
	c=1;
       }
      else
      {q3[j][z]=1;
	c=1;
       }
     }
    }
   }
   if(c==1)
   q3[j][16]=1;
cout<<"Sum: ";
   for(z=0;z<16;++z)
   cout<<q3[j][z];
   cout<<endl;
cout<<"Carry: "<<c;
for(z=0;z<16;++z)
{q3[j][z]=abs(q3[j][z])*pow(2,15-z);
}
float ans=0;
for(z=0;z<16;++z)
ans=ans+q3[j][z];
cout<<endl<<"Ans "<<ans;

}
/*******OUTPUT**************
Enter Multiplicand 181
Enter Multiplier 147

A=10110101
B=10010011

P0=000000010110101
P1=000000111101010
P2=000000000000000
P3=000000000000000
P4=000101101010000
P5=000000000000000
P6=000000000000000
P7=101101010000000

CSA
Exor: 000000111011111
Carry: 0000000001000000

CSA
Exor: 0000101101010000
Carry: 0000000000000000

CSA
Exor: 0000101011001111
Carry: 0000001010100000

CSA
Exor: 0101101010000000
Carry: 0000000000000000

CSA
Exor: 0101001011101111
Carry: 0001010100000000

CSA
Exor: 0100011111101111
Carry: 0010000000000000

CPA
Sum= 0110011111101111
Carry=0
 
P=0110011111101111
Ans=26607
***************************/

Anonymous 8:42 pm No comment

Saturday, 2 April 2011

Tagged under: K-mean, Nearest Neighbour, TE VI SEM

K-Mean & Nearest Neighbour Programs

Kmean & Nearest Neighbour Prog in java

1. Kmean:

#include<iostream.h>
#include<conio.h>
#include<math.h>
void main()
{
 clrscr();
 int m1,m2,i,j,n,x,y,sum1,sum2,k;
 int d[100],k1[50],k2[50];
 cout<<"Enter the no. of items in cluster:";
 cin>>n;
 cout<<"Enter the items of the cluster:";
 for(i=0;i<n;i++)
 cin>>d[i];
 for(i=0;i<n;i++)
 {
  k1[i]=k2[i]=0;
 }
 m1=d[0];
 m2=d[1];
 k=1;
 while(1)
 {
 x=0;
 y=0;
 for(i=0;i<n;i++)
 {
  if(abs(m1-d[i]) <= abs(m2-d[i]))
  {
   k1[x++]=d[i];
  }
  else
  k2[y++]=d[i];
 }
 cout<<"\n\n\n** Iteration:"<<k<<" **\n"<<endl;
 cout<<"cluster1={";
 for(i=0;i<x;i++)
 {
 cout<<k1[i]<<",";
 }
 cout<<"}"<<endl;
 cout<<"cluster2={";
 for(i=0;i<y;i++)
 {
 cout<<k2[i]<<",";
 }
 cout<<"}"<<endl;
 sum1=sum2=0;
 for(i=0;i<x;i++)
 sum1=sum1+k1[i];
 sum1=sum1/x;
 for(i=0;i<y;i++)
 sum2=sum2+k2[i];
 sum2=sum2/y;
 if(sum1==m1 && sum2==m2)
 break;
 else
 {
  m1=sum1;
  m2=sum2;
 }
 k++;
 }
 getch();
}

2. Nearest Neighbour:

#include<iostream.h>
#include<conio.h>
void main()
{
 clrscr();
 int m,i,j,n,t,p,l,iflag,jflag;
 int a[10][10];
 char k[10],k1[10],k2[10];
 cout<<"Enter the no. of tuples:";
 cin>>n;
 cout<<"Enter the name of the nodes:";
 for(i=0;i<n;i++)
 {
  cin>>k[i];
 }
 cout<<"Enter the adjacent matrix:\n\n";
 cout<<" ";
 for(i=0;i<n;i++)
 cout<<" "<<k[i];
 cout<<endl;
 for(i=0;i<n;i++)
 {
  cout<<endl<<k[i]<<" ";
  for(j=0;j<n;j++)
  cin>>a[i][j];
 }
 cout<<endl;
 t=1;
 while(1)
 {
 cout<<"** Threshold="<<t<<" **\n\n";
 m=0;
 iflag=1;
 jflag=1;
 for(i=0;i<n;i++)
 for(j=0;j<n;j++)
 {
  if(a[i][j]<=t && a[i][j]>0 && i<j)
  {
   cout<<k[i]<<" is connected to "<<k[j]<<" having distance of "<<a[i][j]<<endl;
   for(l=0;l<m;l++)
   {
    if(k[i]==k1[l])
    {
    iflag=0;
    break;
    }
    else
    {
    iflag=1;
    }
   }
   for(l=0;l<m;l++)
   {
    if(k[j]==k1[l])
    {
    jflag=0;
    break;
    }
    else
    {
    jflag=1;
    }
   }
   if(iflag==1)
   k1[m++]=k[i];
   if(jflag==1)
   k1[m++]=k[j];
  }
 }
 p=0;
 for(i=0;i<n;i++)
 {
  if(k[i]!=k1[i])
  {
   k2[p++]=k[i];
  }
 }
 cout<<"k1={";
 for(i=0;i<m;i++)
 cout<<k1[i]<<",";
 cout<<"}\n";
 cout<<"k2={";
 for(i=0;i<p;i++)
 cout<<k2[i]<<",";
 cout<<"}\n";
 if(m==n)
 break;
 t++;
 cout<<"\n\n";
}
 getch();
}

Anonymous 11:10 am No comment

Tagged under: Android operating system, TE VI SEM

Seminar

ANDROID report
Download the report from the download box alongside

Points for seminar:
1) intro
2) Innovative features
3) open source

4) arch

5) comparison
6) system mgmt
7) life cycles
8) security
9) advantages

10) future pros

Anonymous 10:07 am No comment

Thursday, 31 March 2011

Tagged under: Go back n, TE VI SEM

Go Back N - Sender & Receiver

1. Go Back N Sender:

import java.io.*;
import java.net.*;
import java.lang.*;
public class gbnsend
{
	 public static void main(String args[])
	 {
		  int serverport=3333;
		 String address="127.0.0.2";
  		try
  		{
   			InetAddress ipaddress=InetAddress.getByName(address);
  			 Socket socket=new Socket(ipaddress,serverport);
   			InputStream sin=socket.getInputStream();
   			OutputStream sout=socket.getOutputStream();
   			DataInputStream in=new DataInputStream(sin);
  			 DataOutputStream out=new DataOutputStream(sout);
   			BufferedReader keyboard=new BufferedReader(new InputStreamReader(System.in));
   			String line=null;
  			 String word []=new String [8];
   			int i;
   			System.out.println("plz input the no of frames to b sent");
  			 int n=Integer.parseInt(keyboard.readLine());
  			 for(i=0;i<n;i++)
			 {
    				word[i]=keyboard.readLine();
   			 }
  			 i=0;
   			while(i<n)
  			 {
    				System.out.println("sending frame "+word[i]);
    				out.writeUTF(word[i]);
    				out.flush();
    				i++;
  			 }
   			try 
  		 	{
    				Thread.sleep(1000);
   			}
   			catch(InterruptedException e)
   			{
    				e.printStackTrace();
   			}
   			line=in.readUTF();
   			System.out.println("nack received for frame "+line);
  			i=Integer.parseInt(line);
   			out.writeUTF(word[i]);
 		 	 System.out.println("retransmitting all frames after "+word[i]);
  			 i++;
  			 while(i<n)
   			 {
    				System.out.println("sending frame "+word[i]);
   				 out.writeUTF(word[i]);
   				 out.flush();
   				 i++;
   			}
  		}
 		 catch(Exception e)
  		{
   			e.printStackTrace();
  		}
 
	 }
}

2. Go Back N Receiver:

import java.net.*;
import java.io.*;
public class gbnreceive
{
 public static void main(String args[])
 {
  int port=3333;
  try
  {
   ServerSocket ss=new ServerSocket(port);
   System.out.println("waiting for user2");
   Socket socket=ss.accept();
   System.out.println("user detected");
   System.out.println();
   InputStream sin=socket.getInputStream();
   OutputStream sout=socket.getOutputStream();
   DataInputStream in=new DataInputStream(sin);
   DataOutputStream out=new DataOutputStream(sout);
   BufferedReader keyboard=new BufferedReader(new InputStreamReader(System.in));
   String line=null;
   String word []=new String [8];
   int i=0;
   while(i<4)
   {
    line=in.readUTF();
    word[i]=line;
    System.out.println("frame "+word[i]+" received successfully");
    i++;
   }
   while(i<8)
   {
    if(i==4)
    {
      System.out.println("frame "+i+" not received");
      i++;
    }
    else
    {
      System.out.println("frame "+i+" discarded");
      i++;
     }
    }
   System.out.println("requesting for retransmaission");
   line=keyboard.readLine();
   out.writeUTF(line);
   out.flush();
   i=4;
   while(i<8)
   {
    line=in.readUTF();
    word[i]=line;
    i++;
   }
   System.out.println("received all retransmitted frames successfully");
  }
  catch(Exception e)
  {
   e.printStackTrace();
  }
  /*finally
  {
   sin.close();
   sout.close();
   in.close();
   out.close();
  }*/
 }
}

Anonymous 7:20 am No comment

Saturday, 26 March 2011

Tagged under: TE VI SEM

Packet Sniffer

ACN Packet Sniffer

Our sir told to use some packetsniffer other than Wireshark or Colasoft. So I used Smartsniff.
Click the link below for snapshots
SmartSniff

For snapshots of Wireshark click the link below
Wireshark

Anonymous 7:38 pm No comment

Tagged under: Apriori Algorithm, TE VI SEM

Apriori Algorihm

Apriori Algorithm:

#include<stdio.h>
#include<conio.h>

int item[5][5]={{1,3,4,6},{2,3,5,7},{1,2,3,5,8},{2,5,9,10},{1,4}};
int fn(int a,int b);
int main()
{
int tid[5]={1,2,3,4,5} ,i,j,ms,k,count[11]={0};
int p,a,b,c;
printf("\n\tTrans_id\t\tItems\n\n");
for(i=0;i<5;i++)
{
printf("\t%d \t\t\t",tid[i]);
for(j=0;j<5;j++)
{
if(item[i][j]!=0)
printf("%d",item[i][j]);
}
printf("\n");
}
printf("\n Assume minimum support:");
scanf("%d",&ms);
for(k=1;k<=10;k++)
{
for(i=0;i<5;i++)
for(j=0;j<5;j++)
if(item[i][j]==k&&item[i][j]!=0)
count[k]++;
}
printf("\nGenerating c1 from the data");
for(k=1;k<=10;k++)
printf("\n\t\t%d\t\t%d",k,count[k]);
for(k=1;k<=10;k++)
{
if(count[k]<ms)
count[k]=0;
}
printf("\nGenerating l1 from c1");
for(k=1;k<=10;k++)
{
a=2;
if(count[k]!=0)
printf("\n\t\t%d\t\t%d",k,count[k]);
}
printf("\nGenerating l2 from c2");
p=2;
b=3;
for(i=1;i<4;i++)
{
for(j=p++;j<=5;j++)
{
if(fn(i,j)>=ms)
printf("\n\t\t%d%d\t\t%d",i,j,fn(i,j));
c=5;
}
}
printf("\n\t\tGenerating l3");
printf("\n\n\t\t\t\t%d %d %d",a,b,c);
getch();
return 0;
}
int fn(int a,int b)
{
int i,j,cnt=0,aa,flag=0;
for(i=0;i<5;i++)
{
flag=0;
for(j=0;j<5;j++)
{
aa=j;
if(flag==1)
goto ab;
if(a==item[i][j])
{
flag=1;
j++;
ab:
if(b==item[i][j])
{
cnt++;
break;
}
}
j=aa;
}
}
return cnt;
}





/************OUTPUT***********

        Trans_id                Items

        1                       1346
        2                       2357
        3                       12358
        4                       25910
        5                       14

 Assume minimum support:2

Generating c1 from the data
                1               3
                2               3
                3               3
                4               2
                5               3
                6               1
                7               1
                8               1
                9               1
                10              1
Generating l1 from c1
                1               3
                2               3
                3               3
                4               2
                5               3
Generating l2 from c2
                13              2
                14              2
                23              2
                25              3
                35              2
                Generating l3

                                2 3 5*/

Anonymous 7:28 pm No comment

Tagged under: TE VI SEM, wireshark

Packet garbage and analysis using Wireshark

On the Internet, packet filtering is the process of passing or blocking packets at a network interface based on source and destination addresses, ports, or protocols. The process is used in conjunction with packet mangling and Network Address Translation (NAT). Packet filtering is often part of a firewall program for protecting a local network from unwanted intrusion.

In a software firewall, packet filtering is done by a program called a packet filter. The packet filter examines the header of each packet based on a specific set of rules, and on that basis, decides to prevent it from passing (called DROP) or allow it to pass (called ACCEPT).

There are three ways in which a packet filter can be configured, once the set of filtering rules has been defined. In the first method, the filter accepts only those packets that it is certain are safe, dropping all others. This is the most secure mode, but it can cause inconvenience if legitimate packets are inadvertently dropped. In the second method, the filter drops only the packets that it is certain are unsafe, accepting all others. This mode is the least secure, but is causes less inconvenience, particularly in casual Web browsing. In the third method, if the filter encounters a packet for which its rules do not provide instructions, that packet can be quarantined, or the user can be specifically queried concerning what should be done with it. This can be inconvenient if it causes numerous dialog boxes to appear, for example, during Web browsing.

Wireshark is a network packet analyzer. A network packet analyzer will try to capture network packets and tries to display that packet data as detailed as possible.

You could think of a network packet analyzer as a measuring device used to examine what's going on inside a network cable, just like a voltmeter is used by an electrician to examine what's going on inside an electric cable (but at a higher level, of course).

Here are some examples people use Wireshark for: