C++ Programming Tutorial

 
 
 

Graphics Programming

Quadratic Surfaces

Draw a Sphere using Ellipses Draw a Sphere using Parametric Equations Draw an Ellipsoid using Parametric Equations

Character Generation

Urdu Alphabets using Stroke Method Urdu Alphabets using Matrix Method

Arc

Circular Arc using Trigo. Method Elliptical Arc using Trigo. Method

General Programs

C-Curve of nth order K-Curve of nth order Cubic Bezier Curve Bezier Curve of nth degree Scanfill algorithm Boundary Fill - 8 Connected Point Flood fill algorithm Rotate About Origin Rotate about reference point Scaling about origin Scaling about reference point Polyline translation Reflection in x axis Reflection in y Axis Reflection on any line Midpoint Circle Drawing Bresenhams Line Algorithm (BLA) Generate a pattern Draw a Chess Board Draw a Luddo Board Deterministic Finite Automation for identifier Kurskals algo - Minimum Cost Spanning Tree

Windows Programs

Checkbox like windows Simple windows & buttons Moving message box like windows Text box Graphical Rep. of tower of hanoi Graphical menu - operate it using arrow keys Text animation

Line

Line using Parametric equations Line-Cartesian Slope-Intercept Equation simple imp Line using Cartesian Slope-Intercept Equation Line - BLA - slopes negative and greater than 1 Line - BLA - slopes negative and less than 1 Line - BLA - slopes positive and greater than 1 Line - BLA - slopes positive and less than 1 DDA line drawing algorithm Bresenham line drawing algorithm Cohen sutherland Line clipping algo.

Line Styles

Different kinds of Dashed Lines Different kinds of Thick Lines

Polygons

Draw a Polygon Draw a Triangle Draw a Rectangle Sutherland-Hodgeman Polygon Clipping Algo

Circle

Circle using Trigo. Method Circle using Polynomial Method Circle using Bresenhams Circle algo. Circle using MidPoint Circle algo.

Ellipse

Ellipse using Polynomial Method Ellipse using Trigo. Method Ellipse using MidPoint Ellipse algo.

2D Transformations

Translation Transformation Scaling Transformation Scaling Trans along a Fixed Point Scaling Trans along Arbitrary Direction Rotation Transformation Rotation Trans along a Pivot Point Reflection tran of x-axix, y-axis and w.r.t origin Reflection tran of line y=x and y=-x X-Direction Shear Transformation Y-Direction Shear Transformation

2D Viewing - Clipping

Window-to-Viewport Coordinate Tran Point Clipping Algorithm Cohen-Sutherland Line Clipping Algo Cohen-Sutherland MidPoint Subdivision Line Nicol Lee Nicol algo. for Line Clipping Liang-Barsky Line Clipping Algo Window-to-Viewport Transformaton None-or-All String Clipping Strategy None-or-All Character Clipping Strategy

3D Object Representations

3D object using Polygon-Mesh Rep. 3D object - Translational Sweep Representatiom 3D object - Rotational Sweep Rep.

3D Transformations

3D Rotation Trans along x-axis 3D Rotation Trans along y-axis 3D Rotation Trans along z-axis 3D Reflection Trans along xy-plane 3D Reflection Trans along yz-plane 3D Reflection Trans along zx-plane 3D Shearing Trans along x-axis 3D Shearing Trans along y-axis 3D Shearing Trans along z-axis

Bezier Curves - Surfaces

3D Cubic Bezier Curve 3D Bezier Curve of nth degree 3D Piece-Wise Bezier Curve of nth degree 3D Bezier Surface for MxN control points

Projection

3D objects - Standard Perspective Projection 3D obj - Arbitrary Plane and Center of Projection 3D objects using General Perspective Projection 3D obj-Orthographics Proje Parallel onto xy-plane 3D obj-Cavalier Oblique Parallel prj-xy-plane 3D obj-Cabinet Oblique Parallel prj - xy-plane

Fill Algorithm or Area Filling

Geometric shapes using Boundary Geometric shapes - Boundary - Linked List Geometric shapes using Flood Geometric shapes - Flood - Linked-List Polygon using Scan Line Polygon Rectangle using Scan-Line Rectangle Circle using Scan-Line Circle Circle - Scan-Line Circle - Polar Coordinates
 

Program of Deterministic Finite Automation (DFA) for identifier, real number with optional Integer and Fractional Part

 

Image

#include <iostream.h>
#include <conio.h>
#include <string.h>
#include <ctype.h>
#include <process.h>

void main()
{
    char inputstr[50];
    char nextSymbol,state[10]=\"START\";
    int i;
    clrscr();

    cout<<\"\\n*****Scanner (Lexical Analysis) *****\\n\";
    cout<<\"Enter String : \";
    cin.getline(inputstr,50,\'\\n\');

    for(i=0;inputstr[i]!=NULL;i++)
    {
        nextSymbol = inputstr[i];

        if(strcmp(state,\"INVALID\")==0)
            break;

        //initially state of inputstr is in start.
        if(strcmp(state,\"START\")==0){
            if(isdigit(nextSymbol))
                strcpy(state,\"INT\");
            else if(isalpha(nextSymbol))
                strcpy(state,\"ID\");
            else if(nextSymbol==\'.\')
                strcpy(state,\"S1\");
            else
                strcpy(state,\"INVALID\");
        }
        else if(strcmp(state,\"ID\")==0){
            if(isdigit(nextSymbol))
                strcpy(state,\"ID\");
            else if(isalpha(nextSymbol))
                strcpy(state,\"ID\");
            else
                strcpy(state,\"INVALID\");
        }
        else if(strcmp(state,\"INT\")==0){
            if(isdigit(nextSymbol))
                strcpy(state,\"INT\");
            else if(nextSymbol==\'.\')
                strcpy(state,\"REAL\");
            else
                strcpy(state,\"INVALID\");
        }
        else if(strcmp(state,\"REAL\")==0){
            if(isdigit(nextSymbol))
                strcpy(state,\"REAL\");
            else
                strcpy(state,\"INVALID\");
        }
        else if(strcmp(state,\"S1\")==0){
            if(isdigit(nextSymbol))
                strcpy(state,\"REAL\");
            else
                strcpy(state,\"INVALID\");
        }
    }

    if(strcmp(state,\"S1\")==0 || strcmp(state,\"INVALID\")==0)
        cout<<\"\\n\\nINVALID INPUT\";
    else
        cout<<\"\\n\\nString State is : \"<<state;

end:
    getch();
}[/Code]

    Related Post:
  1. Program to show find the maximum depth of a Binary Search Tree
  2. Program to illustrate the Bubble Sort
  3. Program that provides an example of destructors
  4. Program of LL Parser
  5. Program of Rotate About Origin
  6. Program to perform array operations like append, insert, delete, edit, display and search and element
  7. Program to show the implementation of Window-to-Viewport Transformaton
  8. Program to illusrate the use of stream insertion and extraction operators
  9. Program to illustrate an example of Inheritance
  10. Program to draw a line using Bresenhams Line Algorithm (BLA) for lines with slopes positive and greater than 1
  11. Program to illustrate the difference among public, protected and private inheritance
  12. Program that computes and display the square of first ten integers. (using for loop)
  13. Program of Deapth First Search Traversal ( DFS )
  14. Program to draw a Sphere using Ellipses
  15. Program of scanfill algorithm
  16. Program to display bill receipt based on customer information and create telephone directory
  17. Program to show the simulation of the Solar System
  18. Program of bubble sort
  19. Program to construct Newtons Divided Difference Interpolation Formula from the given distinct data points and estimate the value of the function
  20. Program to illustrate the implementation of X-Direction Shear Transformation