Home All posts

Sunday, December 10, 2017

PHP and AJAX

Comment
Test4.php:

 <?php

$q=$_GET['q'];

$c=new mysqli("localhost","root","naina","nearur");

if($c->connect_error){
    die("eror : ".$c->connect_error);
}else{
    $sql="Select * from bank";

    $result=$c->query($sql);
    $h="";
    if($result->num_rows>0){
        while ($row=$result->fetch_assoc()) {
            $n=$row['userid'];
            if(stristr($q, substr($n, 0,strlen($q)))){
                if($h == ""){
                    $h=$n;
                }else{
                    $h.=" , ".$n;               
                }
            }

        }
        echo $h;
    }   
}

 ?>

 Test4.html:

 <html>
<head>
    <title></title>
<script type="text/javascript">
   
    function show(){
        alert("hello");
       
    }

</script>

<script>
function showHint(str) {
   
    if(str.length==0){
            document.getElementById("h").innerHTML="";
        }else{
        var xmlhttp = new XMLHttpRequest();
        xmlhttp.onreadystatechange = function() {
            if (this.readyState == 4 && this.status == 200) {
                document.getElementById("h").innerHTML = this.responseText;
            }
        };
        xmlhttp.open("GET", "test4.php?q=" + str, true);
        xmlhttp.send();

            /*var xml=new XMLHttpRequest();


            xml.onreadystatechange=function(){
                if(this.readyState==4 && this.status==200){
                    alert("hello");
                    document.getElementById.("h").innerHTML=this.responseText;
                }
            };

            xml.open("POST","test4.php",true);
            xml.setRequestHeader("Content-type","application/x-www-form-urlencoded");
            xml.send("q="+str);*/
        }
}
</script>


</head>
<body>
<form>
<input type="text" onkeyup="showHint(this.value)">
</form>
<p id="h">Suggestions</p>
</body>
</html>


Using Json in AJAX Application

Comment
Test.php file:
<?php 

$c=new mysqli("localhost","root","naina","nearur");

$obj = json_decode($_POST["v"], false);

$sql="Select * from ".$obj->table;


$result=$c->query($sql);

if($result->num_rows>0){
   
    $r = $result->fetch_all(MYSQLI_ASSOC);//{
    //    $s .="<tr><td>".$r["name"]."</td><td>".$r["userid"]."</td></tr>";
    //}
    //$s .="</table>";
    echo json_encode($r);
}else{
    echo "0 rows";
}


?>

Test.html:

 <html>
<head>
    <title>WT</title>
<script type="text/javascript">
   
function g (a) {
    var my={"table":a};
    var json=JSON.stringify(my);
    var xml=new XMLHttpRequest();
    xml.onreadystatechange=function(){
        if(this.readyState==4&& this.status==200){
            var rjson=JSON.parse(this.responseText);
           
            txt="<table border='1'>";//<tr><th>ID</th><th>Name</th><th>Email</th><th>Roll</th><th>Gender</th><th>PINCODE</th><th>Mobile</th></tr>";
            for(x in rjson){
                txt+="<tr>";
                for (h in rjson[x]) {       
                txt+="<td>"+rjson[x][h]+"</td>";
                }
                txt+="</tr>";
            }
            document.getElementById("d").innerHTML=txt;
        }
    };

    xml.open("POST","test.php",true);
    xml.setRequestHeader("Content-type", "application/x-www-form-urlencoded");
    xml.send("v="+json);
   
}


</script>

</head>

<body>
    <select onchange="g(this.value)" size="1">
        <option>.....Select....</option>
        <option>Users</option>
        <option>Bank</option>
        <option>Auri</option>
        <option>Student</option>
        <option>Employees</option>
    </select>
    <p id="d">Here</p>
</body>
</html>

Saturday, November 11, 2017

Kruskal's Algoritm DAA

Comment
Question: Write a program to find the minimum cost of connecting all the engineering colleges in your state using Kruskal's algorithm.
Code:
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

public class Kruskal {

    static  class  edge{
        int distance,s,d;

        public edge(int distance, int s, int d) {
            this.distance = distance;
            this.s = s;
            this.d = d;
        }

        @Override        public String toString() {
            return "edge{" +
                    "distance=" + distance +
                    ", s=" + s +
                    ", d=" + d +
                    '}';
        }
    }

    public static void main(String[] nt){

        int graph[][]= {{0, 2, 0, 6, 0},
                {2, 0, 3, 8, 5},
                {0, 3, 0, 0, 7},
                {6, 8, 0, 0, 9},
                {0, 5, 7, 9, 0},
        };

        boolean[] visited=new boolean[graph.length];
        ArrayList<edge>edgeArrayList=new ArrayList<>();

        for(int i=0;i<graph.length;i++){
            visited[i]=false;
            for(int x=0;x<graph[i].length;x++){
                if(graph[i][x]!=0){
                    edgeArrayList.add(new edge(graph[i][x],i,x));
                }
            }
        }

        Collections.sort(edgeArrayList, new Comparator<edge>() {
            @Override            public int compare(edge edge, edge t1) {
                return edge.distance-t1.distance;
            }
        });
        int count=0;
        edge edgenow;
        int min=0;
        while (count!=graph.length-1){
            edgenow=edgeArrayList.get(0);
            edgeArrayList.remove(0);
            if(visited[edgenow.d]==false || visited[edgenow.s]==false){
                min+=edgenow.distance;
               System.out.println((edgenow.s+1)+" -> "+(edgenow.d+1)+" : "+edgenow.distance);
                visited[edgenow.d]=true;
                visited[edgenow.s]=true;
                count++;
            }
        }
        System.out.println("Cost is : "+min);
    }
}


Output:

Dijkstra’s algorithm.

Comment
Question: Write a program to find shortest path from your home to college using Dijkstra’s algorithm.

 Code:
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

public class Dijkstras {

    static class vertex{
        int distance;
        boolean visited;
        int no;
        int previous;

        @Override        public String toString() {
            return "vertex{" +
                    "distance=" + distance +
                    ", visited=" + visited +
                    ", no=" + (no+1) +
                    ", previous=" + (previous+1) +
                    '}';
        }

        public vertex(int distance, boolean visited, int no, int previous) {
            this.distance = distance;
            this.visited = visited;
            this.no = no;
            this.previous = previous;
        }


    }

    public static void main(String[] nt){
        ArrayList<vertex> arrayList=new ArrayList<>();
        ArrayList<vertex> result=new ArrayList<>();
       /* int graph[][] = new int[][]{{0, 4, 0, 0, 0, 0, 0, 8, 0},                {4, 0, 8, 0, 0, 0, 0, 11, 0},                {0, 8, 0, 7, 0, 4, 0, 0, 2},                {0, 0, 7, 0, 9, 14, 0, 0, 0},                {0, 0, 0, 9, 0, 10, 0, 0, 0},                {0, 0, 4, 14, 10, 0, 2, 0, 0},                {0, 0, 0, 0, 0, 2, 0, 1, 6},                {8, 11, 0, 0, 0, 0, 1, 0, 7},                {0, 0, 2, 0, 0, 0, 6, 7, 0}        };       */       int[][] graph={{0,4,8,0,0},{0,0,5,8,10},{0,4,0,0,3},{0,0,0,0,6},{0,0,0,7,0}};
       for (int i=0;i<graph.length;i++){
            arrayList.add(new vertex(Integer.MAX_VALUE,false,i,Integer.MAX_VALUE));
        }

        arrayList.get(0).distance=0;
        arrayList.get(0).previous=0;

        Comparator<vertex> com=new Comparator<vertex>() {
            @Override            public int compare(vertex vertex, vertex t1) {
                return vertex.distance-t1.distance;
            }
        };

        vertex poped;
        while (arrayList.size()!=0){
            Collections.sort(arrayList,com);
            poped=arrayList.get(0);
            arrayList.remove(0);


            if(poped.visited==false){
                for (int i=0;i<graph[poped.no].length;i++){
                    if(graph[poped.no][i]!=0&& find(arrayList,i)!=Integer.MAX_VALUE){
                        int x=find(arrayList,i);
                            if(graph[poped.no][i]+poped.distance<arrayList.get(x).distance){
                                arrayList.get(x).distance=graph[poped.no][i]+poped.distance;
                                arrayList.get(x).previous=poped.no;
                            }
                    }
                }
                poped.visited=true;
                result.add(poped);
            }
        }

        Comparator<vertex>comp2=new Comparator<vertex>() {
            @Override            public int compare(vertex vertex, vertex t1) {
                return vertex.no-t1.no;
            }
        };
        Collections.sort(result,comp2);
        for(int i=0;i<result.size();i++){

            System.out.println(result.get(i).toString());
        }

    }

    static int find(ArrayList<vertex> arrayList,int n){
        int i=Integer.MAX_VALUE;

        for (int x=0;x<arrayList.size();x++){
            if(arrayList.get(x).no==n){
                return x;
            }
        }
        return i;
    }
}


Output:






















                  

                

                

              

Sunday, November 5, 2017


                

              















Sutherland PolyGon CLipping
















 Comment 
















Code:



#include<iostream.h>

#include<conio.h>

#include<graphics.h>

#define round(a) ((int)(a+0.5))

int k;

float xmin,ymin,xmax,ymax,arr[20],m;

void clipl(float x1,float y1,float x2,float y2)

{

    if(x2-x1)

        m=(y2-y1)/(x2-x1);

    else

        m=100000;

    if(x1 >= xmin && x2 >= xmin)

    {

        arr[k]=x2;

        arr[k+1]=y2;

        k+=2;

    }

    if(x1 < xmin && x2 >= xmin)

    {

        arr[k]=xmin;

        arr[k+1]=y1+m*(xmin-x1);

        arr[k+2]=x2;

        arr[k+3]=y2;

        k+=4;

    }

    if(x1 >= xmin  && x2 < xmin)

    {

        arr[k]=xmin;

        arr[k+1]=y1+m*(xmin-x1);

        k+=2;

    }

}



void clipt(float x1,float y1,float x2,float y2)

{

    if(y2-y1)

        m=(x2-x1)/(y2-y1);

    else

        m=100000;

    if(y1 <= ymax && y2 <= ymax)

    {

        arr[k]=x2;

        arr[k+1]=y2;

        k+=2;

    }

    if(y1 > ymax && y2 <= ymax)

    {

        arr[k]=x1+m*(ymax-y1);

        arr[k+1]=ymax;

        arr[k+2]=x2;

        arr[k+3]=y2;

        k+=4;

    }

    if(y1 <= ymax  && y2 > ymax)

    {

        arr[k]=x1+m*(ymax-y1);

        arr[k+1]=ymax;

        k+=2;

    }

}



void clipr(float x1,float y1,float x2,float y2)

{

    if(x2-x1)

        m=(y2-y1)/(x2-x1);

    else

        m=100000;

    if(x1 <= xmax && x2 <= xmax)

    {

        arr[k]=x2;

        arr[k+1]=y2;

        k+=2;

    }

    if(x1 > xmax && x2 <= xmax)

    {

        arr[k]=xmax;

        arr[k+1]=y1+m*(xmax-x1);

        arr[k+2]=x2;

        arr[k+3]=y2;

        k+=4;

    }

    if(x1 <= xmax  && x2 > xmax)

    {

        arr[k]=xmax;

        arr[k+1]=y1+m*(xmax-x1);

        k+=2;

    }

}



void clipb(float x1,float y1,float x2,float y2)

{

    if(y2-y1)

        m=(x2-x1)/(y2-y1);

    else

        m=100000;

    if(y1 >= ymin && y2 >= ymin)

    {

        arr[k]=x2;

        arr[k+1]=y2;

        k+=2;

    }

    if(y1 < ymin && y2 >= ymin)

    {

        arr[k]=x1+m*(ymin-y1);

        arr[k+1]=ymin;

        arr[k+2]=x2;

        arr[k+3]=y2;

        k+=4;

    }

    if(y1 >= ymin  && y2 < ymin)

    {

        arr[k]=x1+m*(ymin-y1);

        arr[k+1]=ymin;

        k+=2;

    }

}



void main()

{

    int gdriver=DETECT,gmode,n,poly[20];

    float xi,yi,xf,yf,polyy[20];

    clrscr();

    cout<<"Coordinates of rectangular clip window :\nxmin,ymin             :";

    cin>>xmin>>ymin;

    cout<<"xmax,ymax             :";

    cin>>xmax>>ymax;

    cout<<"\n\nPolygon to be clipped :\nNumber of sides       :";

    cin>>n;

    cout<<"Enter the coordinates :";

    for(int i=0;i < 2*n;i++)

    cin>>polyy[i];

    polyy[i]=polyy[0];

    polyy[i+1]=polyy[1];

    for(i=0;i < 2*n+2;i++)

    poly[i]=round(polyy[i]);

    initgraph(&gdriver,&gmode,"C:\\TURBOC3\\BGI");

    setcolor(RED);

    rectangle(xmin,ymax,xmax,ymin);

    cout<<"\t\tUNCLIPPED POLYGON";

    setcolor(WHITE);

    fillpoly(n,poly);

  getch();

    cleardevice();

    k=0;

    for(i=0;i < 2*n;i+=2)

    clipl(polyy[i],polyy[i+1],polyy[i+2],polyy[i+3]);

    n=k/2;

    for(i=0;i < k;i++)

    polyy[i]=arr[i];

    polyy[i]=polyy[0];

    polyy[i+1]=polyy[1];

    k=0;

    for(i=0;i < 2*n;i+=2)

    clipt(polyy[i],polyy[i+1],polyy[i+2],polyy[i+3]);

    n=k/2;

    for(i=0;i < k;i++)

    polyy[i]=arr[i];

    polyy[i]=polyy[0];

    polyy[i+1]=polyy[1];

    k=0;

    for(i=0;i < 2*n;i+=2)

    clipr(polyy[i],polyy[i+1],polyy[i+2],polyy[i+3]);

    n=k/2;

    for(i=0;i < k;i++)

    polyy[i]=arr[i];

    polyy[i]=polyy[0];

    polyy[i+1]=polyy[1];

    k=0;

    for(i=0;i < 2*n;i+=2)

    clipb(polyy[i],polyy[i+1],polyy[i+2],polyy[i+3]);

    for(i=0;i < k;i++)

    poly[i]=round(arr[i]);

    if(k)

    fillpoly(k/2,poly);

    setcolor(RED);

    rectangle(xmin,ymax,xmax,ymin);

    cout<<"\tCLIPPED POLYGON";

    getch();

    closegraph();

}



Output:













This Program is taken from pracspedia.com we at gndecprogramming do not believe in copying but this is done because of less time.....

































Mid Point Eclipse Drawing Algoritm
















 Comment 
















Code:



#include<stdio.h>
#include<conio.h>
#include<graphics.h>
#include<math.h>
void disp();
float x,y;
int xc,yc;
void main()
{
int gd=DETECT,gm;
int a,b;
float p1,p2;
clrscr();
initgraph(&gd,&gm,"");
scanf("%d%d",&xc,&yc);
scanf("%d%d",&a,&b);
x=0;y=b;
disp();
p1=(b*b)-(a*a*b)+(a*a)/4;
while((2.0*b*b*x)<=(2.0*a*a*y))
{
x++;
if(p1<=0)
p1=p1+(2.0*b*b*x)+(b*b);
else
{
y--;
p1=p1+(2.0*b*b*x)+(b*b)-(2.0*a*a*y);
}
disp();
x=-x;
disp();
x=-x;
}
x=a;
y=0;
disp();
p2=(a*a)+2.0*(b*b*a)+(b*b)/4;
while((2.0*b*b*x)>(2.0*a*a*y))
{
y++;
if(p2>0)
p2=p2+(a*a)-(2.0*a*a*y);
else
{
x--;
p2=p2+(2.0*b*b*x)-(2.0*a*a*y)+(a*a);
}
disp();
y=-y;
disp();
y=-y;
}
getch();
closegraph();
}
void disp()
{
putpixel(xc+x,yc+y,10);
putpixel(xc-x,yc+y,10);
putpixel(xc+x,yc-y,10);
putpixel(xc+x,yc-y,10);
}



Output:











This Program is Taken from Studentcpu.com, We at gndecprogramming donot believe in copying but this time we did it because of less time .....



































Travelling Salesman Problem
















 Comment 
















Question:



Code:

Write a program to find minimum route for a newspaper distributer of your locality using
Greedy algorithm. 




public class Dmain {

    public static void main(String[] nt){

        int n=5;
        int[][] c={{0,3,Integer.MAX_VALUE,7,Integer.MAX_VALUE,3},{3,0,2,Integer.MAX_VALUE,6,Integer.MAX_VALUE},{Integer.MAX_VALUE,2,0,2,5,Integer.MAX_VALUE},
                {7,Integer.MAX_VALUE,2,0,1,Integer.MAX_VALUE},
                {Integer.MAX_VALUE,6,5,1,0,4},
                {3,Integer.MAX_VALUE,Integer.MAX_VALUE,Integer.MAX_VALUE,4,0}
                    };

        /*int[][] d={                {1,2,3,4},                {5,6,7,8},                {3,4,5,6},                {9,8,4,3}        };*/
        System.out.println("Shorest Path is : "+find(c));
    }

    static StringBuffer find(int[][] c){
        StringBuffer buffer=new StringBuffer();
        boolean [] present=new boolean[c.length];
        for(int i=0;i<c.length;i++){
            present[i]=false;
        }
        int count=1,node=0,cost=0,previous=0;
        present[node]=true;
        while(count!=c.length+1){
            int min=Integer.MAX_VALUE,minindex=0;
            for(int i=0;i<c[node].length;i++){
                if(present[i]==false && min>c[node][i]){
                        min=c[node][i];
                        minindex=i;
                }
            }
            present[minindex]=true;
            if(min!=Integer.MAX_VALUE){ cost+=min;}
            buffer.append((node+1)+"->");
            previous=node;
            node=minindex;
            count++;
        }
        buffer.append("1"+"\nMinimum Cost Is : "+(cost+c[previous][0]));
        return buffer;
    }

}






Output:

































              

            










Subscribe to:
Posts (Atom)