solveyoursudoku.blogspot.com

datastructure-using-java.blogspot.com

Datastructure using java: Write a java program to evaluate a postfix expression using stack

http://datastructure-using-java.blogspot.com/2010/02/write-java-program-to-evaluate-postfix.html

Cusat CS 4th semester lab cycle 09-10. Write a java program to evaluate a postfix expression using stack. 6 Write a java program to evaluate a postfix expression using stack. Top,m; public. Max) { m=max; a= new. M]; top=- 1. Key) { a[ top]=key; } public. A[top- ]); } } class. I n;i ) { char. R=x y; break. R); } } r=a. pop. R); } } class. Enter the postfix expresion. Input) ; } } public. Posted by Arun Ramesh. On January 3, 2012 at 6:21 AM. Thanks for the codings. On January 5, 2012 at 10:08 PM. Polynomia...

datastructure-using-java.blogspot.com

Datastructure using java: Write a java program to reverse a string using stack

http://datastructure-using-java.blogspot.com/2010/02/write-java-program-to-reverse-string.html

Cusat CS 4th semester lab cycle 09-10. Write a java program to reverse a string using stack. 5 Write a java program to reverse a string using stack. Top,m; public. Max) { m=max; a= new. M]; top=- 1. Key) { a[ top]=key; } public. A[top- ]); } public. In) { input=in; } public. I n;i ) a. push. I) ; while. Output=output a. pop. Output; } } class. Posted by Arun Ramesh. On February 29, 2016 at 3:22 PM. What is Top in this Program. I Know its a Varialbe but what Does it do. LEX, YACC and parsers. Write a java...

datastructure-using-java.blogspot.com

Datastructure using java: Selection Sort , Quick Sort , Merge Sort , Heap Sort

http://datastructure-using-java.blogspot.com/2010/03/selection-sort-quick-sort-merge-sort.html

Cusat CS 4th semester lab cycle 09-10. Selection Sort , Quick Sort , Merge Sort , Heap Sort. 14Write a program to implement. Max) { a= new. Max]; n=max; } public. I n;i ) { System. I n;i ) System. Out,in,min; for. Out n;out ) { min=out; for. In n;in ) if. A[in] a[min]) min=in; swap. Out,min); } } public. Left,right,pivot); recQuickSort. Right); } } private. A[ leftPtr] pivot); while. A[- rightPtr] pivot); if. LeftPtr,rightPtr); } swap. LeftPtr,right); return. LeftPtr; } private. WorkSpace,lBound,mid 1.

datastructure-using-java.blogspot.com

Datastructure using java: Write a java program to add two matrices.

http://datastructure-using-java.blogspot.com/2010/02/write-java-program-to-add-two-matrices.html

Cusat CS 4th semester lab cycle 09-10. Write a java program to add two matrices. 2 Write a java program to add two matrices. N,m,p,q; public. I,j; DataInputStream. Colum) { m=row; n=colum; a= new. M][n]; } public. I m;i ) for. J n;j ) a[i][j]= Integer. Matrix m1,Matrix m2) { m=m1. m. I m;i ){ for. J n;j ) a[i][j]=m1. a. I][j] m2. a. I][j]; } } public. I m;i ) { for. J n;j ) System. Matrix m1) { return. R,c; DataInputStream. Enter the rows and columns of 1st matrix. R,c); System. A2) { Matrix a3= new.

datastructure-using-java.blogspot.com

Datastructure using java: Implement all the queue operations using a linked list.

http://datastructure-using-java.blogspot.com/2010/02/implement-all-queue-operations-using.html

Cusat CS 4th semester lab cycle 09-10. Implement all the queue operations using a linked list. 9 Implement all the queue operations using a linked list. X) { data=x; } public. X); newNode. next. NewNode; last=newNode; } public. T; } public. LinkList l; public. X) { l. insertLast. N,d; Queue. D); } break. D); } break. Enter y to continue. Posted by Arun Ramesh. On July 18, 2013 at 2:43 AM. Do you have linked list implementation of stack methods? Cusat CS 4th semester lab cycle 09-10. LEX, YACC and parsers.

datastructure-using-java.blogspot.com

Datastructure using java: Implement BFS and DFS for a given graph

http://datastructure-using-java.blogspot.com/2010/03/implement-bfs-and-dfs-for-given-graph.html

Cusat CS 4th semester lab cycle 09-10. Implement BFS and DFS for a given graph. 15Implement BFS and DFS for a given graph. S) { size=s; st= new. Size]; top=- 1. Key) { st[ top]=key; } public. St[top- ]); } public. St[top]); } public. S) { size=s; queArray= new. Size]; front= 0. QueArray[ rear]=j; } public. Temp=queArray[front ]; if. Front= size) front= 0. Temp; } public. Front (front size- 1. Rear) ; } } class. Lab) { label=lab; wasVisited= false. Vertex vertexList[]; private. J maxVertex;j ) for. Enter ...

datastructure-using-java.blogspot.com

Datastructure using java: Implement Library stack using array in java

http://datastructure-using-java.blogspot.com/2010/02/implement-library-stack-using-array-in.html

Cusat CS 4th semester lab cycle 09-10. Implement Library stack using array in java. 4 In a Lirary the following text books were arranged as a stack in the given order. The books are placed or removed from the stack one at a time. A student entered the library. And did four pop operations on the stack. Display the current top of the stack.Then the librarian. Added two texts(Chemistry and Zoology) to the stack. Another student removed four books. Write a java program to implement this using array. Java pro...

datastructure-using-java.blogspot.com

Datastructure using java: Java program to implement deque using double linked list.

http://datastructure-using-java.blogspot.com/2010/02/java-program-to-implement-deque-using.html

Cusat CS 4th semester lab cycle 09-10. Java program to implement deque using double linked list. 10 Write a program to implement deque using double linked list. X) { data=x; } public. X); newNode. next. NewNode; newNode. next. First; first=newNode; } public. X); newNode. next. NewNode; newNode. previous. Last; } last=newNode; } public. T; } public. T; } public. DoublyLinkList l; public. X) { l. insertFirst. X) { l. insertLast. N,d; Deque. D); } break. D); } break. Datas in Deque From Front:-. Write a jav...

datastructure-using-java.blogspot.com

Datastructure using java: Organize a list of student names and their ranks as a binary search tree

http://datastructure-using-java.blogspot.com/2010/02/organize-list-of-student-names-and.html

Cusat CS 4th semester lab cycle 09-10. Organize a list of student names and their ranks as a binary search tree. 12 A list of student names and their ranks are given. Organize this data as a binary search tree. Given rank no,display the student's name. Display the entire rank list in ascending order. N) { rank=x; name=n; } public. Id,s); if. Id current. rank. Id current. rank. Root); } private. Key current. rank. Current; } } } class. Enter the rank and name. A,s); System. Enter y to continue inserting.