LEXICAL ANALYZER Download the program for Lexical Analyzer from the download box alongside (function(w) { if (!w.SharexyWidget) { w.SharexyWidget = {};} if (!w.SharexyWidget.Params) { w.SharexyWidget.Params = {}; } w.SharexyWidget.Params['980623'] = {'code_id':'980623','publisher_key':'undefined','design':'sharexy','layout_static':'h','type':'st','mode_float':'','size_float':'60','size_static':'32','buzz':'0','services':['facebook', 'twitter', 'linkedin', 'google_plus', 'blogger'],'url':'current','allways_show_ads':'0','show_ads_sharing':'0','show_ads_cursor':'0','bg_float':'0','bg_color':'#f1f1f1','labels':'0','counters':'0', 'counters_float':'0'} })(window); ...
Friday, 29 April 2011
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...
Thursday, 28 April 2011
ANDROID SEMINAR
Android Seminar (function() { var scribd = document.createElement("script"); scribd.type = "text/javascript"; scribd.async = true; scribd.src = "http://www.scribd.com/javascripts/embed_code/inject.js"; var s = document.getElementsByTagName("script")[0]; s.parentNode.insertBefore(scribd, s); })(); (function(w) { if (!w.SharexyWidget) { w.SharexyWidget = {};} if (!w.SharexyWidget.Params) { w.SharexyWidget.Params = {}; } w.SharexyWidget.Params['980623'] = {'code_id':'980623','publisher_key':'undefined','design':'sharexy','layout_static':'h','type':'st','mode_float':'','size_float':'60','size_static':'32','buzz':'0','services':['facebook', 'twitter', 'linkedin', 'google_plus', 'blogger'],'url':'current','allways_show_ads':'0','show_ads_sharing':'0','show_ads_cursor':'0','bg_float':'0','bg_color':'#f1f1f1','labels':'0','counters':'0', 'counters_float':'0'} })(window); ...
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)!='...
Wednesday, 20 April 2011
Seminar Report
Android Operating System Final Android (function(w) { if (!w.SharexyWidget) { w.SharexyWidget = {};} if (!w.SharexyWidget.Params) { w.SharexyWidget.Params = {}; } w.SharexyWidget.Params['980623'] = {'code_id':'980623','publisher_key':'undefined','design':'sharexy','layout_static':'h','type':'st','mode_float':'','size_float':'60','size_static':'32','buzz':'0','services':['facebook', 'twitter', 'linkedin', 'google_plus', 'blogger'],'url':'current','allways_show_ads':'0','show_ads_sharing':'0','show_ads_cursor':'0','bg_float':'0','bg_color':'#f1f1f1','labels':'0','counters':'0', 'counters_float':'0'} })(window); ...
Thursday, 14 April 2011
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 packets6. 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...
Friday, 8 April 2011
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) {...
Data & Web Mining
DWM Programs in java Download the Data & Web Mining programs from the download box alongside. (function(w) { if (!w.SharexyWidget) { w.SharexyWidget = {};} if (!w.SharexyWidget.Params) { w.SharexyWidget.Params = {}; } w.SharexyWidget.Params['980623'] = {'code_id':'980623','publisher_key':'undefined','design':'sharexy','layout_static':'h','type':'st','mode_float':'','size_float':'60','size_static':'32','buzz':'0','services':['facebook', 'twitter', 'linkedin', 'google_plus', 'blogger'],'url':'current','allways_show_ads':'0','show_ads_sharing':'0','show_ads_cursor':'0','bg_float':'0','bg_color':'#f1f1f1','labels':'0','counters':'0', 'counters_float':'0'} })(window); ...
Wednesday, 6 April 2011
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)...
Saturday, 2 April 2011
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(); }...
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 (function(w) { if (!w.SharexyWidget) { w.SharexyWidget = {};} if (!w.SharexyWidget.Params) { w.SharexyWidget.Params = {}; } w.SharexyWidget.Params['980623'] = {'code_id':'980623','publisher_key':'undefined','design':'sharexy','layout_static':'h','type':'st','mode_float':'','size_float':'60','size_static':'32','buzz':'0','services':['facebook', 'twitter', 'linkedin', 'google_plus', 'blogger'],'url':'current','allways_show_ads':'0','show_ads_sharing':'0','show_ads_cursor':'0','bg_float':'0','bg_color':'#f1f1f1','labels':'0','counters':'0', 'counters_float':'0'} })(window); ...
Subscribe to:
Posts (Atom)
