The inverse filtering is a restoration technique for deconvolution, i.e., when the image is blurred by a known lowpass filter, it is possible to recover the image by inverse filtering or generalized inverse filtering. However, inverse filtering is very sensitive to additive noise. The approach of reducing one degradation at a time allows us to develop a restoration algorithm for each type of degradation and simply combine them. The Wiener filtering executes an optimal tradeoff between inverse filtering and noise smoothing. It removes the additive noise and inverts the blurring simultaneously. The Wiener...
Tuesday, 29 November 2011
Thursday, 3 November 2011
Robotics & Artificial Intelligence- Prolog Codes
Prolog is a logical and a declarative programming language. The name itself, Prolog, is short for PROgramming in LOGic. Prolog's heritage includes the research on theorem provers and other automated deduction systems developed in the 1960s and 1970s. The inference mechanism of Prolog is based upon Robinson's resolution principle (1965) together with mechanisms for extracting answers proposed by Green (1968). These ideas came together forcefully with the advent of linear resolution procedures. Explicit goal-directed linear resolution procedures, such as those of Kowalski and Kuehner (1971) and Kowalski (1974), gave impetus to the development...
Thursday, 29 September 2011
Booth Algorithm for Signed Binary Multiplication & IEEE Floating point representation
Booth's Algorithm: It is a powerful algorithm for signing up a number of multiplication. It generates a 2n bit product and it treats both +ve & -ve number uniformly. Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented by Andrew Donald Booth in 1950 while doing research on crystallography at Birkbeck College in Bloomsbury, London. Booth used desk calculators that were faster at shifting than adding and created the algorithm to increase their speed. Booth's algorithm is of interest in the...
Tuesday, 20 September 2011
DSIP University Papers
DSIP papers Download the Digital Signal And Image Processing question papers 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); ...
Monday, 15 August 2011
Happy Independence Day
(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, 4 May 2011
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)...
Tuesday, 3 May 2011
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. (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'}...
Monday, 2 May 2011
Advanced MicroProcessors
AMP All Programs you can download all the programs from the download box alongside Note: It does not include EFlags (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); ...
Sunday, 1 May 2011
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!! (function(w) { if (!w.SharexyWidget) { w.SharexyWidget = {};} if (!w.SharexyWidget.Params) { w.SharexyWidget.Params = {};...
Friday, 29 April 2011
Lexical Analyzer
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); ...
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); ...
Thursday, 31 March 2011
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...
Tuesday, 29 March 2011
Infix to Postfix Conversion
Following is the java code for converting from infix to postfix: // To convert Infix into Postfix import java.io.*; class infix2 { public static void main(String args[]) throws IOException { check obj=new check(); String str = new String(); char infix[]=new char[15]; char postfix[]=new char[15]; char stack[]=new char[15]; int len=0,i=0,j=0,top=-1,value; BufferedReader b=new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter Expression ==> "); str=b.readLine(); len=str.length(); infix=str.toCharArray(); for(i=0;i<=len-1;i++) { int t=obj.isoperand(infix[i]); if(t==1) { postfix[j]=infix[i]; j++; } else if(top==-1) { top++; stack[top]=infix[i]; } else if(infix[i]==')') { while(stack[top]!='(') { postfix[j]=stack[top]; top--; j++; } top--; } else if(obj.priority(infix[i])>obj.priority(stack[top])) { top++; stack[top]=infix[i]; } else...
Saturday, 26 March 2011
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 (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); ...
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) {...
Computer Graphics programs in C++
The term computer graphics includes almost everything on computers that is not text or sound. Today almost every computer can do some graphics, and people have even come to expect to control their computer through icons and pictures rather than just by typing. Here in our lab at the Program of Computer Graphics, we think of computer graphics as drawing pictures on computers, also called rendering. The pictures can be photographs, drawings, movies, or simulations -- pictures of things which do not yet exist and maybe could never exist. Or they may be pictures from places...
Jigsaw puzzle
Jigsaw puzzle html Download the Jigzaw puzzle 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); ...
Economic Crisis 2008 Seminar Presentation
This is the Seminar Presentation that we prepared for the Economic Crisis that started in 2008 Economic Crisis 2008 (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); ...
Sudoku puzzle in javascript
Download the Code for Sudoku puzzle for 3X3, 6X6, & 9X9 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); ...
Computer Graphics mini project/ Screen Saver code
1. Car Screensaver: /******************************************************************* Program : Screensaver: Moving car ********************************************************************/ #include<iostream.h> #include"conio.h" #include<math.h> #include"stdlib.h" #include"dos.h" #include"graphics.h" #define DELAY 1 #define SOUND 3500 void state(int x,int y,int mode); int area,area1; void *ptr1,*ptr2,*burst; void BF(int,int,int,int); void circ_bre(int x,int y,int rad); void draw_burst ( int x, int y,int ); void display(int,int,int,int); void dda(int x1,int y1,int x2,int y2); int COND(int x,int y) { if (x>20 && x<getmaxx()-20 && y>20 && y<getmaxy()-20) return 1; else return 0; } void state(int x,int y,int mode) { while(COND(x,y)&&!kbhit()) { if(x==300&&y==230) { putimage(350,230,burst,COPY_PUT); sound(SOUND); delay(100); cleardevice(); state(30,30,0); } switch(mode) { case 0:...
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...
Friday, 25 March 2011
Optimism Vs Pessimism
Is Your Glass Half Full or Half Empty?Are you a glass half full or a glass half empty kind of person? Does it really make a difference? I think it makes a huge difference in the quality of your life. Both optimists and pessimists contribute to our society. The optimist invents the airplane and the pessimist the parachute. Two men look out through the same bars: One sees the mud, & one the stars.Optimism can lead to accomplishment. If you think something is possible, you will generally work harder to achieve it. Believing...
Subscribe to:
Posts (Atom)
