C, C++, WML, ASP.NET, Jquery, HTML, Javascript: 2017

Friday, November 24, 2017

Using jquery to move image to different portion of the window

<!Doctype html>
<html>

<head>
<script src="query.min.js"></script>
<script>

$("document").ready(function(){

$("#move").click(function(){
$("#image").animate({left: "+=500"}, 2000);
});

$("#move2").click(function(){
$("#image").animate({left: "-=500"}, 2000);
});

});

</script>
</head>

<body>

<button id="move" > move right </button>
<button id="move2" > move LEFT </button>
<br />
</br />
<img id="image" src="Tulips.jpg" width ="400" height="400" style="position:absolute" />
</body>
</html>

instructions :
1. download latest jQuery library and save in a folder
2. rename the jQuery file to query.min.js
3. copy paste the codes in notepad and save in the same folder with .html extention

output

jquery program to change the value or text of a pragraph

<!Doctype html>
<html>

<head>
<script src="query.min.js"></script>
<script>

$("document").ready(function(){

    $("#btn1").click(function(){
        $("#para1").text("hello text");
    });
     $("#btn2").click(function(){
        $("#para2").text("hello html");
    });


});

</script>
</head>

<body>
<p id="para1" > pragraph 1 </p>
<p id="para2" > paragraph 2 </p>
<button id="btn1" > set text </button> || <button id="btn2" > set html </button>
</body>
</html>

instructions :

1. download latest jQuery library and save in a folder
2. rename the jQuery file to query.min.js
3. copy paste the codes in notepad and save in the same folder with .html extention

Friday, May 26, 2017

Vendora Encryption (public prototyped version) advanced not for public. For Password authentication

/*--------->copy wrights @ www.wetheprogrammer.blogspot.in,@www.hackersonlineclub.com
@www.codechef.com, @nimbus soft tech
vendora_encryption for passwords
proto type in c++.
other prototypes in c,vb.net,php,and java in more complex format are available not shareable
unless with full publicity written and signed approval
Author : Ameer tataroo Ameer ( Abdulkadir Salihu Tataru )
<-------------------*/
#include <conio.h>//getch()     function
#include <iomanip> //setw() function
#include <iostream>// cout,cin functions required
#include <windows.h>//system("cls") function
#include <iterator> //for iterative reversing and sorting
#include <string>//for string function
#include <algorithm> //for the sort and rev functions
#define Max 10 //define key for encryption
#include <cstdio>
#include <stdlib.h>//for random character
using namespace std;
void getValue();
class Password
{
int begining, center , ending;
string s,s1;
int key=Max, recur=0;
public:
        void Pass_sort(string pass)
{
// sorting of the password characters starts here
s = s1=   pass;
if(cout<<"\n pass word before sorting "<<setw(15)<<s<<endl){// this will print the password as it's given, without sorting or reversing.
sort(s.begin(), s.end());
cout <<"\n this is what the password will look like after sorting "<<setw(20)<<s<< endl;
}
EncryptPass(s);
}
//function that holds the hash value
void EncryptPass(string sort_Pass)
{
//reversing the value till Max time (Max is pre-processor) which i defined in above as global is the key for the encryption
int i=0;
if(cout<<" encrypting the value to be saved with "<<(sizeof(Max)*sizeof(sort_Pass))*8<<" bit "<< endl)
{
       std::reverse_iterator<std::string::iterator> r = sort_Pass.rbegin();
       while (i <key) {
            r [0]='^';// i am replacing the very first value in the string to ^
            r [2] = rand();//random character replaces what ever value is at 2nd position, on console 3rd position
          //r [6] = rand();
std::string rev(r,   sort_Pass.rend());
   s1=rev;
i++;
}
func_analys("hashed value");
system("cls");
   std::cout << setw(25)<<" hashed value to be saved in db in implementation don't show this\n you can not down this value & run again give,\n   the same pass and compare the new hashed     value \n:" <<"\n"<< s1 << '\n';

         }
}
void func_analys(string p)
{
    int i,j,k,a=0;
    cout<<"\n\n\n please wait analyzing \n     "<<setw(20)<< p;
delay : for (i=0;i<100;i++)   //time delay loops 1-3
        for(j=0;j<100;j++)
            for(k=0;k<14000;k++)
            ;
        a++;
        if(a<25)
        {
            char c=177;
            cout <<c;
            goto delay;
        }
}
};

int main()
{
    Password p;
    string pass, *temp;
char arr[10],password[15] ,ch;int i =0 ,counter=0;
       if(cout<<" Password Not More than 10 or less than 3 char. and no space (i.e hackers or hackers_@3) :"<<setw(15))
{
        cin>> pass;
cout<<"\n\n given pass : ";
    cout<<pass;
    }
       //swapping the index of the given string before passing it for sorting and encrypting
for (i=0;i<sizeof(pass) ;i++)
{
arr[i]= pass[i];
   pass[i] = pass[i+1];
   pass[i+1]=arr[i];
      cout <<"\n Iterator_encrypt " <<i<<setw(20)<<pass;
}
p.Pass_sort(pass);

}

Thursday, May 4, 2017

HTML 5

<!DOCTYPE html>
<html>
    <head>
        <meta charset="utf-8">
        <meta name="viewport" content="initial-scale=1, maximum-scale=1, user-scalable=no, width=device-width">
        <title>Blank App</title>
        <style>
        #allbutton{
        margin-left:400px;
        }
        </style>
                <script type="text/javascript" src="cordova.js">
</script>
    </head>
    <body>

<p style="font-family:arial; font-size:50px;color:green; text-align:center; font-weight:bold;">YO Practise going on </p>

        <br>
        <canvas id="mycanvas" style="height:500px; width:800px; background-color:pink; border:4px solid black; margin-left:300px;"></canvas>
        <img src="bikash.jpg" height=200 width=200 id="image1" style="display:none">
        <br>
        <div id="allbutton">
        <button onclick="drawline()">Draw Line</button>
        <button onclick="drawcircle()">Draw Circle</button>
        <button onclick="drawrect()">Draw Rectangle</button>
        <button onclick="drawimage()">Draw Image</button>
        <button onclick="drawtext()">Draw Text</button>
        <button onclick="clearall()">Clear All</button></div>
        <script>
        function drawrect()
        {
        var canvas=document.getElementById('mycanvas');
        var gt=canvas.getContext("2d");
        gt.fillStyle="red";
        gt.fillRect(0,0,50,50);
        }
        function drawline()
        {
        var canvas=document.getElementById('mycanvas');
        var gt=canvas.getContext("2d");
        gt.fillStyle="red";
        gt.moveTo(0,0);
        gt.lineTo(100,200);
        gt.stroke();
        }
        function drawcircle()
        {
        var canvas=document.getElementById('mycanvas');
        var gt=canvas.getContext("2d");
        gt.strokeStyle="blue";
        gt.beginPath();
        gt.arc(100,100,50,0,2*Math.PI);
        gt.stroke();
        }
        function drawimage()
        {
        var canvas=document.getElementById('mycanvas');
        var gt=canvas.getContext("2d");
        var image1=document.getElementById("image1");
        gt.drawImage(image1,0,0,200,200);
        }
        function clearall()
        {
        var canvas=document.getElementById("mycanvas");
        var gt=canvas.getContext("2d");
        gt.clearRect(0,0,canvas.width,canvas.height);

        }
        function drawtext()
        {
        var canvas=document.getElementById("mycanvas");
        var gt=canvas.getContext("2d");
        gt.font = "30px Arial";
        var text1=prompt("Enter Text to display","");
        gt.strokeText(text1,20,20);
        }
        </script>
        <br>    <br>    <br>    <br>
            <svg height=300 width=800 style="background-color:yellow">
        <line x1=30 y1=20 x2=50 y2=100 style="stroke:pink; stroke-width:5;"></line>
        <circle cx=600 cy=100 r=30 style="stroke:red; stroke-width:10;"></circle>
        <rect x=100 y=100 height=100 width=200 style="stroke:blue; stroke-width:5;"></rect>
        <ellipse cx=600 cy=200 rx=20 ry=40 style="stroke:red; stroke-width:2;"></ellipse>
        <text x=0 y=40 fill=red>i love u</text>
        <polyline points=200,50,60,80,95,2,25,65,60,1 style="fill:none; stroke:blue;"></polyline>
        <polygon points="300,10 250,190 160,310" style="fill:lime;stroke:purple;stroke-width:1" ></polygon>
        </svg>
        <br>
        <audio src="1.mp3" controls id="audio1"></audio>
    <button onclick="document.getElementById('audio1').play()">Play</button>
    <button onclick="document.getElementById('audio1').pause()">Pause</button>
    <button onclick="document.getElementById('audio1').pause(); document.getElementById('audio1').currentTime=0;">Stop</button>
   <br>
<iframe width="560" height="315" src="https://www.youtube.com/embed/Xy3rcoz-8rU" frameborder="0" allowfullscreen></iframe>
    <br>
    <embed src="https://www.youtube.com/embed/PT2_F-1esPk" width="600" height="500" frameborder="2"/>
    <object widht="400" height="400" data="https://www.youtube.com/embed/PT2_F-1esPk"></object>
    </body>
</html>

Tuesday, May 2, 2017

Binary Search

#include<stdio.h>
#include<conio.h>
void main()
{
    int a[20],size,i,j,mid,temp,value;
    printf("Enter size of array\n");
    scanf("%d",&size);
    printf("Enter %d value\n",size);
    for(i=0;i<size;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=0;i<size-1;i++)
    {
        for(j=i+1;j<size;j++)
        {
            if(a[i]>a[j])
            {
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
    }
    printf("\nThe list of sorted data is\n");
    for(i=0;i<size;i++)
    {
        printf("\n%d",a[i]);
    }
    printf("\nEnter value to search\n");
    scanf("%d",&value);
    i=0;
    j=size-1;
do
{
    mid=(i+j)/2;
    if(a[mid]<value)
    {
        i=mid+1;
    }
    else if(a[mid]>value)
    {
        j=mid-1;
    }

}while(a[mid]!=value && i<=j);
if(a[mid]==value)
{
    printf("value found");
}
else
{
    printf("value not found");
}
}

Operations on Queue !

#include<stdio.h>
#include<conio.h>
#define max 10
void insert(int);
int deletee();
void display();
int f=-1;
int r=-1;
int a[max];
void main()
{
    int ch,value;
    while(1)
    {
    printf("\n1.Insert Data");
    printf("\n2.Delete Data");
    printf("\n3.Display Data");
    printf("\n4.Exit");
    printf("\nEnter Choice\n");
    scanf("%d",&ch);
    switch(ch)
    {
    case 1:
        if(r==9)
        {
            printf("\nQueue Overflow");
        }
        else{
            printf("\nEnter Value to Insert\n");
            scanf("%d",&value);
            insert(value);
        }
        break;
    case 2:
        if(f==-1)
        {
            printf("\nQueue Underflow");
        }
        else{
        int n=deletee();
        f++;
        printf("value %d deleted",n);
        }
        break;
    case 3:
        display();
        break;
    case 4:
        exit(1);
        break;
    default:
        printf("\Invalid Input");
        break;
    }
    }
}
void insert(int value)
{
    if(f==-1 && r==-1)
    {
        f++;
        r++;
        a[r]=value;
    }
    else{
        r++;
        a[r]=value;
    }
}

int deletee()
{
    return a[f];
}
void display()
{
    int i;
    printf("\n The list of Data are:\n");
    for(i=f;i<=r;i++)
    {
        printf("\n%d",a[i]);
    }
}

Merging of two array element

#include<stdio.h>
#include<conio.h>
void main()
{
    int a[10],b[10],c[50],n1,n2,n3,i,j;
    printf("Enter Size of first Array\n");
    scanf("%d",&n1);
    printf("Enter %d value\n",n1);
    for(i=0;i<n1;i++)
    {
        scanf("%d",&a[i]);
    }
    printf("Enter size of Second Array\n");
    scanf("%d",&n2);
    printf("Enter %d value\n",n2);
    for(i=0;i<n2;i++)
    {
        scanf("%d",&b[i]);
    }
    n3=n1+n2;
    for(i=0;i<n3;i++)
    {
        if(i<n1)
        {
            c[i]=a[i];
        }
        else
        {
            for(j=0;j<n2;j++)
            {
        c[i]=b[j];
        i++;
        }
        }
    }

    printf("\nArray After merging are:\n");
    for(i=0;i<n3;i++)
    {
        printf("\n%d",c[i]);
    }
    getch();
}

Tuesday, April 18, 2017

LINEAR SEARCH- C PROGRAM

#include<stdio.h>
#include<conio.h>
void main()
{
    int i,c=0, value, n, a[20];
    printf("Enter size of array\n");
    scanf("%d",&n);
    printf("Input % value\n",n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    printf("Enter Value to Search\n");
    scanf("%d",&value);
    for(i=0;i<n;i++)
    {
        if(a[i]==value)
        {
            printf("\n%d found at position %d",a[i],i+1);
        c++;
        }
    }
    if(c==0)
    {
        printf("\nValue not found in list");
    }
getch();
}

SELECTION SORT - C PROGRAM

#include<stdio.h>
#include<conio.h>
void main()
{
    int i,j, temp, n, a[20];
    printf("Enter size of array\n");
    scanf("%d",&n);
    printf("Enter %d value\n",n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=0;i<n-1;i++)
    {
        for(j=i+1;j<n;j++)
        {
            if(a[i]>a[j])
            {
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
    }
    printf("sorted array is:\n");
    for(i=0;i<n;i++)
    {
        printf("%d\n",a[i]);
    }
    getch();
}

INSERTION SORT- C PROGRAM

#include<stdio.h>
#include<conio.h>
void main()
{
    int i,j,n,a[20],temp;
    printf("Enter size of array\n");
    scanf("%d",&n);
    printf("\nInput %d value\n",n);
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=0;i<n;i++)
    {
        j=i;
        while(j>0 && a[j-1]>a[j])
        {
            temp=a[j];
            a[j]=a[j-1];
            a[j-1]=temp;
            j--;
        }
    }
    printf("\nValue after sorted are:\n");
    for(i=0;i<n;i++)
    {
        printf("%d\n",a[i]);

    }
getch();
}

BUBBLE SORT - C PROGRAM

#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],size,i,j,temp;
printf("Enter Size of Array\n");
scanf("%d",&size);
printf("Input %d value",size);
for(i=0;i<size;i++)
{
    scanf("%d",&a[i]);
}
for(i=size;i>1;i--)
{
    for(j=0;j<i-1;j++)
    {
        if(a[j]>a[j+1])
        {
            temp=a[j+1];
            a[j+1]=a[j];
            a[j]=temp;
        }
    }
}
printf("\nThe array element after sorting is\n");
for(i=0;i<size;i++)
{
    printf("%d\n",a[i]);
}
getch();
}

Monday, March 27, 2017

Binary Tree -Data Structure using C Language

#include<stdio.h>
#include<conio.h>
struct node
{
    int data;
    struct node *left;
    struct node *right;
};
struct node *root=NULL;
struct node *insert(struct node*,int);
void displayPreorder(struct node*);
void displayInorder(struct node*);
void displayPostorder(struct node*);
int count=1;
void main()
{
    int value,choice;
    while(1)
    {
        printf("\n1.Insert");
        printf("\n2.Display in pre order");
        printf("\n3.Display in In-order");
        printf("\n4.Display in Post order");
        printf("\n5.Exit");
        printf("\nEnter your choice\n");
        scanf("%d",&choice);
        switch(choice)
        {
        case 1:
            printf("Enter Value\n");
            scanf("%d",&value);
            root=insert(root, value);
            break;
        case 2:
            displayPreorder(root);
            break;
        case 3:
            displayInorder(root);
            break;
        case 4:
            displayPostorder(root);
            break;
        case 5:
            exit(1);
            break;
        default:
            printf("\nInvalid Input");
            break;

        }
    }
}

struct node *insert(struct node *r, int v)
{
    if(r==NULL)
    {
        r=(struct node*)malloc(sizeof(struct node));
        r->left=NULL;
        r->right=NULL;
        r->data=v;
        count++;
    }
    else{
        if(count%2==0)
        {
            r->left=insert(r->left,v);
        }
        else{
            r->right=insert(r->right,v);
        }
    }
    return r;
}
void displayPreorder(struct node *r)
{
    if(r!=NULL)
    {
        printf("%d\n",r->data);
        displayPreorder(r->left);
        displayPreorder(r->right);
    }
}

void displayInorder(struct node *r)
{
    if(r!=NULL)
    {
        displayInorder(r->left);
        printf("%d\n",r->data);
        displayInorder(r->right);
    }
}
void displayPostorder(struct node *r)
{
    if(r!=NULL)
    {
        displayPostorder(r->left);
        displayPostorder(r->right);
        printf("%d\n",r->data);
    }
}

Friday, March 24, 2017

Shoes Store Sample program using C language !

#include<stdio.h>
#include<conio.h>
void main()
{
    int a[100],i,n,value,loc1,loc2,counter;
    char ch;
    printf("Enter the Quantity of Shoes\n");
    scanf("%d",&n);
    printf("Enter the shoes to put in store\n");
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    printf("The Shoes Available in store are\n");
    for(i=0;i<n;i++)
    {
        printf("%d\n",a[i]);
    }
    do{
            counter=0;
    loc1=0;
    loc2=0;
    printf("Enter the shoes you want to buy\n");
    scanf("%d",&value);
    for(i=0;i<n;i++)
    {
        if(value==a[i])
        {
            counter++;
            if(counter==1)
            {
             loc1=i;
            }
            else if(counter==2)
            {
                loc2=i;
            }
        }

    }
    if(counter>=2)
    {
        n--;
        for(i=loc1;i<n;i++)
        {
            a[i]=a[i+1];
        }
        n--;
        loc2--;
        for(i=loc2;i<n;i++)
        {
            a[i]=a[i+1];
        }
        printf("\nYou bought Shoes Successfully\n");
    }
    else if(counter==1)
    {
        printf("\nShoes is not available in pairs");
    }
    else
    {
        printf("\nShoes is out of Stock\n");
    }
    printf("\nNow Available shoes are\n");
    for(i=0;i<n;i++)
    {
        printf("%d\n",a[i]);
    }
    printf("To Buy more shoes Press 'y' or Any key to Terminate\n");
    ch=getch();
    }while(ch=='y' || ch=='Y');
}

Monday, March 6, 2017

Various operation in Stack !

#include<stdio.h>
#include<conio.h>
#define max 5
void push(int);
int pop(void);
void traverse(void);
   int val,ch,value;
    int stack[max];
    int top=-1;
void main()
{

    while(1)
    {
    printf("\n1.Push data");
    printf("\n2. pop Data");
    printf("\n3. Traverse");
    printf("\n4. Exit");
    printf("\nEnter your choice\n");
    scanf("%d",&ch);
switch(ch)
{
case 1:
    if(top==max-1)
    {
        printf("\Stack overflow");
    }
    else{
    printf("\nEnter Data to Push in stack\n");
    scanf("%d",&value);
    top++;
    push(value);
    }
    break;
case 2:
    if(top==-1)
    {
        printf("\n stack underflow");
    }
    else
        {
    val=pop();
    printf("\n%d is Removed",val);
    top--;
    }
    break;
case 3:
    if(top==-1)
    {
        printf("\nNO Record Found");
    }
    else{
    traverse();}
    break;
case 4:
    exit(1);
    break;
default:
    printf("\nWrong Input\n");
}
    }
}
void push(int value)
{
    stack[top]=value;
}
int pop()
{
    return(stack[top]);
}
void traverse()
{
    int i;
    for(i=top;i>=0;i--)
    {
        printf("\n%d",stack[i]);
    }
}

Sunday, February 19, 2017

hotel bill in c.

#include<stdio.h>
#include<conio.h>
#include<windows.h>
void bill(char name[], char add[], int o[],char *s[],int p[]);
void main()
{
int i,o[10],p[]={40,60,55,85,95,90,130,25,20,10};
char *s[]={"Rice       ","Fried Rice  ","Sahi Paneer  ","Chicken Kosa  ","Chicken Kabab","Chilli Chicken","Mutton Kosa","Salad       ","Soft Drinks","Sweets        "};
char name[20],add[20];
char a,b;
printf("\t ****************WELCOME TO HOTEL LOVELY***************** \n");
printf("\t\t\tNH-1, PHAGWARA, PUNJAB\n");
printf("\t\t\t MOBILE-+91-9872300000\n");
printf("\n\t Enter Your Name:\t ");
gets(name);
printf("\t Enter Your Address:\t");
gets(add);
printf("\n\t **** DEAR CUSTOMER, TODAY WE HAVE SPECIALY ITEM FOR YOU ****\n\n");
printf(" \t ITEMS \t\t\t PRICE\n");
for(i=0;i<10;i++)
{
printf(" %d. %s \t\t %d (Per Plate)\n",i+1,s[i],p[i]);
}
printf("\nDear customer, would you like to give order?(y for yes/ n for no) : ");
scanf("%c",&a);
 if(a=='y'||a=='Y')
 {
 printf("\n\t Your Order ......");
 printf("\n \t Please Select Your Order(Enter Quantity only):\n");

  for(i=0;i<10;i++)
  {
  printf("\n  %d  \t   %s   \t\t   :\t",i+1,s[i]);
  scanf("%d",&o[i]);
  }
 printf("\n\n \t In 10 Minutes, food will be on the Table");
 printf("\n \t Please Wait....!\n");
 printf("\n\n\n\t Want bill, Sir...?(y for yes)\t:\t ");
 scanf(" %c",&b);

  if(b=='y'||b=='Y')
  {
      bill(name,add,o,s,p);
      }
  }
 printf("\n\n\n\t\t Thank You Sir, Visit Again...!");
 printf("\n___________________________________________________DEVELOPED BY BIKASH THAPA\n");
}
 void bill(char name[], char add[], int o[],char *s[],int p[])
      {
          int i,tot=0;
          system("cls");
          printf("\n\t******************WELCOME TO HOTEL LOVELY********************* \n");
 printf("\t\t\t NH-1, PHAGWARA, PUNJAB\n");
 printf("\t\t\t MOBILE-+91-9872350000\n");
 printf("\n\t Customer Name: \t");
 puts(name);
 printf("\t Customer Address: \t");
 puts(add);
  printf("\n\t Your Today's Bill is.....\n");
  printf(" \t\t\t    ITEMS       \t\t\t\t TOTAL");
  printf("\n\t____________________________________________________________________");
   for(i=0;i<10;i++)
   {
    if(o[i]!=0)
    {
    printf("\n\t\t    %s    \t(%d X %d)\t\t    %d",s[i],o[i],p[i],o[i]*p[i]);
    }
   }
   printf("\n\t____________________________________________________________________");
    for(i=0;i<10;i++)
    {
    tot=tot+o[i]*p[i];
    }
  printf("\n\t Your Total Billing amount is\t:\t\t\t    %d\n",tot);
}

#Program to insert data and display data using double linked list

#include<stdio.h>
#include<conio.h>
struct node
{
    int data;
    struct node *p;
    struct node *n;
};
struct node *first=NULL;
struct node *last=NULL;
void insert(void);
void displayB(void);
void displayL(void);
void main()
{
    while(1)
    {
    int ch;
    printf("1.To insert Data\n");
    printf("2.To Display Data From beginning\n");
    printf("3. To Display Data from End\n");
    printf("4. Exit\n");
    printf("Enter Choice\n");
    scanf("%d",&ch);
    switch(ch)
    {
    case 1:
        insert();
        break;
    case 2:
        displayB();
        break;
    case 3:
        displayL();
        break;
    case 4:
        exit(1);
        break;
    default:
        printf("Wrong input\n");
        break;
    }
    }
}
void insert(void)
{
    int v;
    printf("Enter value\n");
    scanf("%d",&v);
    struct node *ptr;
    ptr=(struct node *)malloc(sizeof(struct node));
    ptr->data=v;
    if(first==NULL)
    {
        ptr->p=NULL;
        ptr->n=NULL;
        first=last=ptr;
    }
    else{
               ptr->p=last;
        ptr->n=NULL;
        last->n=ptr;
         last=ptr;
    }
}
void displayB()
{
    struct node *ptr;
    ptr=first;
    printf("\nThe list of Data from Beginning are;");
    while(ptr->n!=NULL)
    {
        printf("\n%d",ptr->data);
    ptr=ptr->n;
    }
    printf("\n%d\n",ptr->data);

}
void displayL(void)
{
    struct node *ptr;
    ptr=last;
    printf("\nThe list of data from Last are:");
    while(ptr->p!=NULL)
    {
        printf("\n%d",ptr->data);
        ptr=ptr->p;
    }
    printf("\n%d\n",ptr->data);
}

Tuesday, February 7, 2017

//program to add node in a link list
#include<stdio.h>
#include<conio.h>
struct node
{
int data;
struct node *next;
};
struct node *first=NULL;
struct node *last=NULL;
void insert(int);
void display(void);
void main()
{
int v,ch;
while(1)
{
printf("1. Insert Data\n");
printf("2. Display List \n");
printf("3. Exit\n");
printf("Enter your choice\n");
scanf("%d",&ch);
switch(ch)
{
case 1:
    printf("Enter Value to insert\n");
    scanf("%d",&v);
    insert(v);
    break;
case 2:
    printf("The list is\n");
    display();
    break;
case 3:
    exit(1);
    break;
default:
    printf("Wrong input");
    break;

}
}
}
void insert(int v)
{
    struct node *ptr;
    ptr=(struct node*)malloc(sizeof(struct node));
    ptr->data=v;
    if(first==NULL)
    {
        first=last=ptr;
        ptr->next=NULL;
    }
    else
    {
        last->next=ptr;
        ptr->next=NULL;
        last=ptr;
    }
}
void display()
{
struct node *ptr;
if(first==NULL)
{
    printf("No Record Found\n");
}
else if(first==last)
    {
        printf("%d\n",first->data);
    }
    else
    {
        for(ptr=first;ptr!=last;ptr=ptr->next)
        {
            printf("%d\n",ptr->data);
        }
        printf("%d\n",last->data);
    }
}

Tuesday, January 31, 2017

DELETION OF ARRAY ELEMENT IN C

#include<stdio.h>
#include<conio.h>
void main()
{
int a[20],i,p,n;
printf("Enter size of array\n");
scanf("%d",&n);
printf("Enter the value in array\n");
for(i=0;i<n;i++)
{
    scanf("%d",&a[i]);
}
printf("The value you entered in array are:\n");
for(i=0;i<n;i++)
{
    printf("%d\n",a[i]);
}
printf("Enter the position of element to delete\n");
scanf("%d",&p);
for(i=p;i<n;i++)
{
a[i-1]=a[i];
}
printf("Array after deletion is:\n");
for(i=0;i<n-1;i++)
{
    printf("%d\n",a[i]);
}
getch();
}

Tuesday, January 17, 2017

C++ PROGRAM TO FIND SUM OF ROW AND COLUMN IN MATRIX FORM

#include<iostream>
#include<conio.h>
using namespace std;
int main()
{
int a[3][3],i,j,c1,c2;
cout<<"Enter 3*3 matrix"<<endl;
for(i=0;i<3;i++)
{
for(j=0;j<3;j++)
{
    cin>>a[i][j];
    cout<<"    ";
}
cout<<endl;
}
for(i=0;i<3;i++)
{
    c1=0;
for(j=0;j<3;j++)
{
    cout<<a[i][j]<<"    ";
    c1+=a[i][j];
}
cout<<c1;
cout<<endl;
}
for(i=0;i<3;i++)
{
    c2=0;
for(j=0;j<3;j++)
{
c2+=a[j][i];
}
cout<<c2<<"    ";
}
return 0;
}

C, C++, WML, ASP.NET, Jquery, HTML, Javascript

HOME