programmingwith8086.blogspot.com

graphics-using-c.blogspot.com

Graphics programming using c

http://graphics-using-c.blogspot.com/2010/08/filling-recursive-method.html

Graphics programming using c. Tuesday, August 3, 2010. Filling - recursive and non-recursive method. 3 Write a program to implement following seed filling algorithms on polygon, circle and an ellipse. A) floodfill b) boundary fill. Recursive and Non Recursive method. NULL) { pop(); x=p- x; y=p- y; if( getpixel(x 1,y)! Bdry)& (getpixel(x 1,y)! New) { putpixel(x 1,y,new); push(x 1,y); } if( getpixel(x-1,y)! New) { putpixel(x-1,y,new); push(x-1,y); } if( getpixel(x,y 1)! Bdry)& (getpixel(x,y 1)! Circumcircl...

graphics-using-c.blogspot.com

Graphics programming using c

http://graphics-using-c.blogspot.com/2010/10/draw-following-figure1.html

Graphics programming using c. Wednesday, October 13, 2010. Draw the following figure(1). Struct point { int x,y; }pol[ 3. Int n,r; float trans[ 3. Void midpoint(int xc,int yc,int r) { int x= 0. Int y=r; int p= 1. R; plot(xc,yc,x,y); while. Plot(xc,yc,x,y); } } void plot(int xc,int yc,int x,int y) { putpixel(xc x,yc y, 10. Putpixel(xc-x,yc y, 10. Putpixel(xc x,yc-y, 10. Putpixel(xc-x,yc-y, 10. Putpixel(xc y,yc x, 10. Putpixel(xc-y,yc x, 10. Putpixel(xc y,yc-x, 10. Putpixel(xc-y,yc-x, 10. I ) { for. New,bd...

graphics-using-c.blogspot.com

Graphics programming using c

http://graphics-using-c.blogspot.com/2010/08/line-clipping.html

Graphics programming using c. Sunday, August 15, 2010. Xa) m=(float)(yb-ya)/(float)(xb-xa); while(1) { if(rcode1= 0& rcode2= 0) return 1; else if( rcode1&rcode2)! 0) return 0; else { int outcode=(rcode1= 0)? Rcode2:rcode1; if(outcode&top) { if(m! 0) x=xa (float)(1/m)*(float)(wymax-ya); else x=xa; y=wymax; } else if(outcode&bottom) { if(m! Kbhit() ; closegraph(); initgraph(&gd,&gm,NULL); printf(After Clipping ); rectangle(wxmin,wymin,wxmax,wymax); if(clipline() line(xa,ya,xb,yb); while(!

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.

graphics-using-c.blogspot.com

Graphics programming using c

http://graphics-using-c.blogspot.com/2010/10/rotate-triangle-along-circumference-of.html

Graphics programming using c. Tuesday, October 12, 2010. Rotate a triangle along the circumference of a circle, also rotate the triangle with reference to its centroid. Rotate a triangle along the circumference of a circle, also rotate the triangle with reference to its centroid. Use midpoint algorithm for circle drawing. Kbhit() ; closegraph(); return 0; }. Posted by Arun Ramesh. Subscribe to: Post Comments (Atom). There was an error in this gadget. Amazon Contextual Product Ads. View my complete profile.

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 ...