Home All posts

Tuesday, October 10, 2017

MidPoint Circle Generation Algorithm

Comment
Question: Write a program to generate a complete moving wheel using Midpoint circle drawing algorithm and DDA line drawing algorithm.

Code:
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#include<graphics.h>
#include<dos.h>
#include<math.h>
int u=1;
void dda(int x1, int y1, int x2, int y2) {
  int s, dx, dy, m;
  float xi, yi, x, y;
  dx = x2 - x1;
  dy = y2 - y1;
  if (abs(dx) > abs(dy))
    s = abs(dx); else
    s = abs(dy);
  xi = dx / (float) s;
  yi = dy / (float) s;
  x = x1;
  y = y1;
  putpixel(x1 + 0.5, y1 + 0.5, 15);
  for (m = 0; m < s; m++) {
    x += xi;
    y += yi;
    putpixel(x + 0.5, y + 0.5, 15);
  }
}
void main(){

    int g=DETECT,gmode;
    initgraph(&g,&gmode,"C://TURBOC3//BGI");

    int r;
    cout<<"Enter Radius \n";
    cin>>r;

    int x=0,y=r;
    int p=1-r;
    int xc=50,yc=200;
    while(xc<750)
    {  cleardevice();
       x=0;y=r;p=1-r;
      while(x<y){

      if(p<=0){
p=p+2*x+3;
      }else{
p=p+2*(x-y)+5;
y--;
      }
      x++;
      putpixel(xc+x,yc+y,10);
      putpixel(xc+y,yc+x,10);
      putpixel(xc+x,yc-y,10);
      putpixel(xc-y,yc+x,10);
      putpixel(xc-x,yc-y,10);
      putpixel(xc+y,yc-x,10);
      putpixel(xc-x,yc+y,10);
      putpixel(xc-y,yc-x,10);


      if(u%20==0){
      dda(xc-x,yc+y,xc+x,yc-y);
      dda(xc+x,yc+y,xc-x,yc-y);
      dda(xc+y,yc+x,xc-y,yc-x);
      dda(xc-y,yc+x,xc+y,yc-x);
    }u++;
  }
  xc=xc+5;
  delay(90);
  }
getch();
}

Output:





Sunday, October 8, 2017

WT practicals 5,6,7

Comment

Login.html


 <html>
<title>Login</title>
<head><center><font size="20" color="aqua" face="Times New Roman">Login</font></center>
<script language="javascript">
function my(){
if(f.m1.value="9023074222" && f.p1.value="1507623"){
alert('Welcome Iron Man');
return true;
document.getElementById('demo').innerHtml="Hello";

 }else{
alert('Wrong Credentials');
return false;
}
}
</script>
</head>
<body background="t.jpg">
<center>
<p id="demo"></p>
<font size="5" color="red"><p>* Mandatory Fields</p></font>
<form name="f" action="" method="post">
<pre>
<font size="5" color="DarkTurquoise" face="Arial">
Mobile Number:<font color="red">*</font>    <input type="number" name="m1" required placeholder="Mobile Number" style="margin-left:-0.2in;"><br>
Password:<font color="red">*</font>    <input type="password" name="p1" required placeholder="Password" style="margin-left:0.3in;"><br><br>
<input type="submit" name="s"  value="Submit" onClick="my()">     <input type="reset" value="Reset" name="r1"><br>
<a href="forgot.html" >Forgot Password</a>
</font>
</pre>
</form>
</center>
<marquee direction="left" behavior="alternate"><img src="f.png" height=200 width=200>   <img src="i.png" height=200 width=200>    <img src="tw.png" height=200 width=200>
</marquee>

 </body>
</html>

 Output:

Registration.html


 <html>
<head><title>Register Nearur</title>
<center style="color:purple; font-size:50px;">Registration Form</center>
<img src="photo.jpg" width="200px" height="200px">
</head>
<style>
.b
{
font-size:25px;
}
</style>
<body>
<br>
<br>
<center>
<form method="post" action="reg.php">
<table style=" font-size:25px; margin-top:-2in;">
<tr><td>First Name:</td> <td><input type="text" required name="a1" class="b"></td></tr>
<tr><td>Last Name:</td> <td>  <input type="text" required name="a2"class="b"></td></tr>
<tr><td>Mobile Number:</td> <td> <input type="number" required name="a3"class="b"></td></tr>
<tr><td>Password:</td> <td> <input type="password" required name="a4"class="b"></td></tr>
<tr><td>Retype Password:</td> <td> <input type="password" required name="a5"class="b"></td></tr>
<tr><td>Address:</td> <td> <input type="text" required name="a6"class="b"></td></tr>
<tr><td>Security Question:</td> <td> <select required name="a7"class="b"><option>What is Your Nickname?</option><option>Who is your favourite Cricket Player?</option><option>What is your BirthPlace?</option><option>Which is your Favourite Dish?</option></select></td></tr>
<tr><td>Answer:</td> <td> <input type="text" required name="a8"class="b"></td></tr>
</table>
<br>
<input type="submit" name="a9" value="Register" class="b">&nbsp;<input type="reset" name="b" value="Reset" class="b">
</form>
</center>
<marquee behavior="alternate" scrollamount="9"><img src="b.jpg" width="300px" height="200px"><img src="c.jpg" width="300px" height="200px"><img src="d.jpg" width="300px" height="200px"></marquee>
</body>
</html>

 Output:

Link.html


 <html>
<head>
<title>Practical5</title>
</head>
<body background=""><center>
<h1 style="font-size:50px; font-family:Arial;">Nearur</h1>
<p style="font-size:25px; font-family:Arial;">Choose From Below Mobiles</p>
<a href="#8" title="#8"><img src="8.jpeg" align="left" /></a>
<a href="X.html" title="X.html"><img src="9.png" align="right" style="margin-right:1.5in;"></a>
</center>
</body>

 </html>

 Output:



Wednesday, October 4, 2017

Problem Array Sort Shuffle

Comment
Code:

 
public class Akhil {

    public static void main(String [] nt){

        int[] a={1,3,4,2};

        if(!sorted(a)){
            for (int i=0;i<a.length-2;i++){
                if(!sorteda(a[i],a[i+1],a[i+2])){
                    if(sorteda(a[i+1],a[i+2],a[i])){
                        int temp=a[i];
                        a[i]=a[i+1];
                        a[i+1]=a[i+2];
                        a[i+2]=temp;
                        continue;
                    }else {
                        if(sorteda(a[i+2],a[i],a[i+1])){
                            int temp=a[i];
                            a[i]=a[i+2];
                            a[i+2]=a[i+1];
                            a[i+1]=temp;
                            continue;
                        }else{
                            break;
                        }
                    }
                }
            }
        }

        if(sorted(a)){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }

    }

    static boolean sorted(int[] a){

        for(int i=0;i<a.length-1;i++){
            if(a[i]>a[i+1]){
                return false;
            }
        }

        return true;
    }

    static boolean sorteda(int a,int b,int c){
        if(a<b && b<c){
            return true;
        }
        return false;
    }

}



































Primorial Prime Numbers
















 Comment 

















Code:






import java.util.ArrayList;

public class PP {

    public static void main(String[] nt){

        // To avoid repetion of Primorial primes        ArrayList<Integer>integers=new ArrayList<>();

        //This is end Value        int x=11;


        for(int J=2;J<=x;J++) {
            int pn = 1;
//Calculating Primorial            for (int i = 2; i <= J; i++) {
                if (isprime(i)) {
                    pn = pn * i;
                }
            }
//Checking For Prime            if(isprime(pn-1)){
                if(!integers.contains(pn-1)){
                    integers.add(pn-1);
                }

            }if(isprime(pn+1)){
                if(!integers.contains(pn+1)){
                    integers.add(pn+1);
                }
            }
        }
//Printing all Primorial Primes        for (int a:integers){
            System.out.println(a);
        }


    }

    static boolean isprime(int n){

        for (int i=2;i<=n/2;i++){
            if(n%i==0){
                return false;
            }
        }
        return true;
    }

}







Output:

































                  

                

                

              

Tuesday, October 3, 2017


                

              















Bresenham VS DDA
















 Comment 
















Write a program to input the line coordinates from the user to generate a line using
Bresenham’s method and DDA algorithm. Compare the lines for their values on
theplotted line.



Code:





#include<iostream.h>

#include<conio.h>

#include<graphics.h>

void main(){



    int g=DETECT,gmode;

    initgraph(&g,&gmode,"C://TURBOC3//BGI");

    float x1,x2,y1,y2;

    cout<<"Enter coordinates\n";

    cout<<"x1:";

    cin>>x1;

    cout<<"y1:";

    cin>>y1;

    cout<<"x2:";

    cin>>x2;

    cout<<"y2:";

    cin>>y2;

    int x3=x1+100;

    int x4=x2+100;

    int y3=y1,y4=y2;

    int y=y2-y1;

    int x=x2-x1;

    float m=y/x;

    int d=2*y-x;

    putpixel(x1,y1,10);

    if(m<=1){

    while(x1!=x2){

      if(d>0){

 y1++;

 d=d+2*(y-x);

      }else{

      d=d+2*y;

      }

      x1++;

      putpixel(x1,y1,10);

    }}else{

      while(y1!=y2){

      if(d>0){

 x1++;

 d=d+2*(y-x);

      }else{

      d=d+2*y;

      }

      y1++;

      putpixel(x1,y1,10);

    }

    }

    if(m<=1){

    while(x3!=x4){

    x3++;

    y3=y3+m;

    putpixel(x3,y3,10);

    }

    }else{

    while(y3!=y4){

    y3++;

    x3=x3+1/m;

    putpixel(x3,y3,10);

    }



    }

    setcolor(15);

    settextstyle(1,HORIZ_DIR,2);

    outtextxy(x2+15,y2,"Bresenham");

    outtextxy(x2+135,y2,"DDA");

    getch();

}







   Output:

































                  

                

                

              

Sunday, September 24, 2017


                

              















DDA(Digital Differential Algorithm)
















 Comment 
















Code:



#include<iostream.h>

#include<conio.h>

#include<graphics.h>

void main(){



    int g=DETECT,gmode;

    initgraph(&g,&gmode,"C://TURBOC3//BGI");

    float x1,x2,y1,y2;

    cout<<"Enter coordinates\n";

    cout<<"x1:";

    cin>>x1;

    cout<<"y1:";

    cin>>y1;

    cout<<"x2:";

    cin>>x2;

    cout<<"y2:";

    cin>>y2;

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

    putpixel(x1,y1,10);

    if(m<=1){

    while(x1!=x2){

    x1++;

    y1=y1+m;

    putpixel(x1,y1,10);

    }

    }else{

    while(y1!=y2){

    y1++;

    x1=x1+1/m;

    putpixel(x1,y1,10);

    }



    }

    getch();

}











Output:





































                  

                

                

              

Thursday, September 21, 2017


                

              















Indeed Prime Challenge 2015
















 Comment 
















Problem:



For example, consider array A such that:

    A[0] = 1
    A[1] = 3
    A[2] = 2
    A[3] = 1
    A[4] = 2
    A[5] = 1
    A[6] = 5
    A[7] = 3
    A[8] = 3
    A[9] = 4
    A[10] = 2



The following picture illustrates the landscape after it has flooded:







The gray area is the rock floor described by the array A above and the blue area with dashed lines represents the water filling the low-lying areas with maximum possible volume. Thus, blocks 3 and 5 have a water depth of 2 while blocks 2, 4, 7 and 8 have a water depth of 1. Therefore, the maximum water depth of this area is 2.





Code:




public class Solution {

    public static void main(String[] nt){
        int[] a={1,3,2,1,2,1,5,3,3,4,2};
        System.out.print("Max Depth is : "+solution(a));
    }

    static int solution(int[] a){
        int i=Integer.MIN_VALUE;
        int[] left=new int[a.length];
        int[] right=new int[a.length];

        int max=a[0];
        for(int x=0;x<a.length;x++){
            if(a[x]>max){
                max=a[x];
            }
            left[x]=max;
        }

        max=a[a.length-1];
        for(int x=a.length-1;x>=0;x--){
            if(a[x]>max){
                max=a[x];
            }
            right[x]=max;
        }

        for(int x=0;x<a.length;x++){
            int z=min(left[x],right[x])-a[x];
            i=i<z?z:i;
        }

        return i;
    }

    static int min(int a,int b){
        if(a>b){
            return b;
        }return a;
    }
}






Output:





































              

            










Subscribe to:
Posts (Atom)