pallavimushan-datastructure.blogspot.com
Pallavi: Merge two linked list, restricting common elements to occur only once
http://pallavimushan-datastructure.blogspot.com/2011/03/merge-two-linked-list-restricting.html
Friday, March 18, 2011. Merge two linked list, restricting common elements to occur only once. C Program to merge two linked list, restricting common elements to occur only once. Structure containing a data part and link part */. Int data ;. Struct node *link ;. Void add ( struct node * , int ) ;. Void display ( struct node * ) ;. Int count ( struct node * ) ;. Void merge ( struct node *, struct node *, struct node * ) ;. Struct node *first, *second, *third ;. Add ( &first, 9 ) ;. Add ( &first, 12 ) ;.
pallavimushan-datastructure.blogspot.com
Pallavi: Tower of Hanoi
http://pallavimushan-datastructure.blogspot.com/2011/04/tower-of-hanoi.html
Wednesday, April 20, 2011. Subscribe to: Post Comments (Atom). Http:/ pallavimushan.blogspot.com. Believe in The Beauty of Your Dreams! One Day At A Time . Our GOD is and Awesome GOD! People are just as HAPPY as they make their minds to be. People you DOUBT what you say, BUT they will always BELIEVE what you DO! Take Care of YOUR CHARACTER, and YOUR REPUTATION will TAKE CARE of ITSELF. The First Step to WISDOM is SILENCE, the second is LISTENING. The rest if your life begins right now. You only live once,.
pallavimushan-datastructure.blogspot.com
Pallavi: Queue
http://pallavimushan-datastructure.blogspot.com/2011/04/queue.html
Wednesday, April 20, 2011. Subscribe to: Post Comments (Atom). Http:/ pallavimushan.blogspot.com. Believe in The Beauty of Your Dreams! One Day At A Time . Our GOD is and Awesome GOD! People are just as HAPPY as they make their minds to be. People you DOUBT what you say, BUT they will always BELIEVE what you DO! Take Care of YOUR CHARACTER, and YOUR REPUTATION will TAKE CARE of ITSELF. The First Step to WISDOM is SILENCE, the second is LISTENING. The rest if your life begins right now. You only live once,.
pallavimushan-java.blogspot.com
Pallavi: Interpocess Communication In Java
http://pallavimushan-java.blogspot.com/2011/02/interpocess-communication-in-java.html
Wednesday, February 23, 2011. Interpocess Communication In Java. Message Class synchronizing the messages between PrintHow n PrintHello classes,. System.out.println("How");. System.out.println("Hello");. Class printhow extends Thread. Class printhello extends Thread. Public static void main(String arg[]). Message m=new Message();. Printhello po = new printhello(m);. Printhow ph = new printhow(m);. Subscribe to: Post Comments (Atom). Http:/ pallavimushan.blogspot.com. Believe In The BEAUTY Of Your DREAMS!
pallavimushan-java.blogspot.com
Pallavi: Socket Programming in Java
http://pallavimushan-java.blogspot.com/2011/02/socket-programming-in-java.html
Wednesday, February 23, 2011. Socket Programming in Java. Import java.io.*;. Import java.net.*;. Public static void main(String args[]). Creating a server side socket. Data being sent throught this port. ServerSocket ss = new ServerSocket(8765);. Socket incoming = ss.accept();. BufferedReader br = new BufferedReader (new InputStreamReader(incoming.getInputStream() );. BufferedReader lin = new BufferedReader (new InputStreamReader(System.in) ;. System.out.println("Server : Enter BYE to exit");. One Day At...
pallavimushan-datastructure.blogspot.com
Pallavi: Add a new node at the end of linked list using recursion
http://pallavimushan-datastructure.blogspot.com/2011/04/add-new-node-at-end-of-linked-list.html
Friday, April 15, 2011. Add a new node at the end of linked list using recursion. C: Program to add a new node at the end of linked list using recursion. Int data ;. Struct node *link ;. Void addatend ( struct node * , int ) ;. Void display ( struct node * ) ;. Struct node *p ;. Addatend ( &p, 1 ) ;. Addatend ( &p, 2 ) ;. Addatend ( &p, 3 ) ;. Addatend ( &p, 4 ) ;. Addatend ( &p, 5 ) ;. Addatend ( &p, 6 ) ;. Addatend ( &p, 10 ) ;. Display ( p ) ;. Adds a new node at the end of the linked list */. But if ...
pallavimushan-datastructure.blogspot.com
Pallavi: C - Program to add two polynomials.
http://pallavimushan-datastructure.blogspot.com/2011/03/c-program-to-add-two-polynomials.html
Monday, March 7, 2011. C - Program to add two polynomials. Int coeff ;. Int exp ;. Struct term t [10] ;. Int noofterms ;. Void initpoly ( struct poly * ) ;. Void polyappend ( struct poly *, int c, int e ) ;. Struct poly polyadd ( struct poly, struct poly ) ;. Void display ( struct poly ) ;. Struct poly p1, p2, p3 ;. Initpoly ( &p1 ) ;. Initpoly ( &p2 ) ;. Initpoly ( &p3 ) ;. Polyappend ( &p1, 1, 7 ) ;. Polyappend ( &p1, 2, 6 ) ;. Polyappend ( &p1, 3, 5 ) ;. Polyappend ( &p1, 4, 4 ) ;. Display ( p1 ) ;.
pallavimushan-java.blogspot.com
Pallavi: February 2011
http://pallavimushan-java.blogspot.com/2011_02_01_archive.html
Wednesday, February 23, 2011. Socket Programming in Java. Import java.io.*;. Import java.net.*;. Public static void main(String args[]). Creating a server side socket. Data being sent throught this port. ServerSocket ss = new ServerSocket(8765);. Socket incoming = ss.accept();. BufferedReader br = new BufferedReader (new InputStreamReader(incoming.getInputStream() );. BufferedReader lin = new BufferedReader (new InputStreamReader(System.in) ;. System.out.println("Server : Enter BYE to exit");. System....
SOCIAL ENGAGEMENT