Wednesday, August 19, 2009

Sign Language











12 comments:

  1. mon,u r very creative-keep doing

    best wishes

    ReplyDelete
  2. good picture, you always have a brilliant idea to develop the progress to success, thank you friend, hope you are also happy, greeting from Indonesian bloggers.

    ReplyDelete
  3. Very creative, thanks friend, fraternal greetings and best friend visited the house.

    ReplyDelete
  4. Thanks Dear Dunia Berkarya...............its my son, but thanks for the good words

    ReplyDelete
  5. Nice creations Dikshith.
    Go ahead and try to improve your creativity
    day by day. Best Wishes.

    ReplyDelete
  6. This comment has been removed by the author.

    ReplyDelete
  7. hai thomman.
    varakale koottu pidikkukka, ethra rasakaramanu.very creative. keep it up.

    ReplyDelete
  8. //Circular queue
    #include
    #include
    #include
    #include


    class circularqueue
    {
    int a[50], front, rear,n;
    public:
    circularqueue()
    {
    cout<<"Enter the number of elements to create an array with\n";
    cin>>n;
    front=-1;
    rear=-1;
    clrscr();
    }
    void geta()
    {
    cout<<"Enter the element to be inserted\n";
    int c;
    cin>>c;
    if((rear==front-1)||((rear==n-1)&&(front==0)))
    {
    cout<<"Element cannot be inserted as the queue is full\n";
    getch();
    }
    else if(front==-1)
    {
    front=rear=0;
    a[rear]=c;
    cout<<"Queue was empty and element was inserted\n";
    getch();
    }
    else if(rear==n-1)
    {
    rear=0;
    a[rear]=c;
    cout<<"Rear was at the end. It was moved to zero and element was inserted\n";
    getch();
    }
    else
    {
    rear++;
    a[rear]=c;
    cout<<"Rear was incremented and then element was inserted\n";
    getch();
    }
    }
    void dele()
    {
    if(front==-1)
    {
    cout<<"Queue is empty. Delete operation cannot be performed.\n";
    getch();
    }
    else if((front==rear-1)||((front==n-1)&&(rear==0)))
    {
    rear=front=-1;
    cout<<"Queue was completely emptied\n";
    getch();
    }
    else if(front==n-1)
    {
    front=0;
    cout<<"Front was at the end of the array and it was moved to 0\n";
    getch();
    }
    else
    {
    front++;
    cout<<"Front was incremented\n";
    getch();
    }
    }
    void disp()
    { int i=front;
    if(front==-1)
    {
    cout<<"No elements to display\n";
    getch();
    }
    else if(rearrear)
    {
    cout<<"Front is greater than rear. Displaying elements from front till end and then from beginning till rear.\n";
    while(i>h;
    switch(h)
    {
    case 1:cq.geta(); break;
    case 2:cq.dele(); break;
    case 3:cq.disp(); break;
    default:exit(0);
    }
    }while(1);
    }

    ReplyDelete
  9. //Circular queue
    #include
    #include
    #include
    #include


    class circularqueue
    {
    int a[50], front, rear,n;
    public:
    circularqueue()
    {
    cout<<"Enter the number of elements to create an array with\n";
    cin>>n;
    front=-1;
    rear=-1;
    clrscr();
    }
    void geta()
    {
    cout<<"Enter the element to be inserted\n";
    int c;
    cin>>c;
    if((rear==front-1)||((rear==n-1)&&(front==0)))
    {
    cout<<"Element cannot be inserted as the queue is full\n";
    getch();
    }
    else if(front==-1)
    {
    front=rear=0;
    a[rear]=c;
    cout<<"Queue was empty and element was inserted\n";
    getch();
    }
    else if(rear==n-1)
    {
    rear=0;
    a[rear]=c;
    cout<<"Rear was at the end. It was moved to zero and element was inserted\n";
    getch();
    }
    else
    {
    rear++;
    a[rear]=c;
    cout<<"Rear was incremented and then element was inserted\n";
    getch();
    }
    }
    void dele()
    {
    if(front==-1)
    {
    cout<<"Queue is empty. Delete operation cannot be performed.\n";
    getch();
    }
    else if((front==rear-1)||((front==n-1)&&(rear==0)))
    {
    rear=front=-1;
    cout<<"Queue was completely emptied\n";
    getch();
    }
    else if(front==n-1)
    {
    front=0;
    cout<<"Front was at the end of the array and it was moved to 0\n";
    getch();
    }
    else
    {
    front++;
    cout<<"Front was incremented\n";
    getch();
    }
    }
    void disp()
    { int i=front;
    if(front==-1)
    {
    cout<<"No elements to display\n";
    getch();
    }
    else if(rearrear)
    {
    cout<<"Front is greater than rear. Displaying elements from front till end and then from beginning till rear.\n";
    while(i>h;
    switch(h)
    {
    case 1:cq.geta(); break;
    case 2:cq.dele(); break;
    case 3:cq.disp(); break;
    default:exit(0);
    }
    }while(1);
    }

    ReplyDelete