Lets Tutorial: program

Showing posts with label program. Show all posts

Sunday, February 15, 2015

Java program to find whether a number is armstrong or not

class Armstrong
{
public static void main(String...s)
{
int m,n,i,j=0;
n=Integer.parseInt(s[0]);

m=n;
while(n!=0)
{
i=n%10;
j+=(i*i*i);
n/=10;
}

if(j==m)
System.out.println("
Number is armstrong");
else
System.out.println("
Number is not armstrong");
}
}

C Program to calculate Factorial of any number

#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
unsigned long i,fac,n;
cout<<"Enter Number: ";
cin>>n;

for(i=1,fac=1;i<=n;++i)
{
fac=i*fac;
}
cout<<"Factorial 0f "<<n<<" is: "<<fac;
getch();
}

C++ program to print following trianlge using character *

#include<iostream.h>
#include<conio.h>

void main()
{
clrscr(); //to clear the screen
int i,j,k,n;

cout<<"How many lines?";
cin>>n;

for(i=0;i<n;++i)
{
cout<<"
";
for(j=0;j<i;++j)
cout<<" ";
for(k=n;k>i;--k)
cout<<"*";
}
getch(); //to stop the screen
}

C program to print the following design

#include<iostream.h>
#include<conio.h>

void main()
{
clrscr(); //to clear the screen
int i,j,k,n;

cout<<"How many lines?";
cin>>n;
n*=2;

for(i=0;i<n;i+=2)
{
for(j=n-2;j>i;j-=2)
cout<<" ";
for(k=0;k<=i;++k)
cout<<"*";
cout<<"
";
}

for(i=0;i<n;i+=2)
{
for(j=0;j<i;j+=2)
cout<<" ";
for(k=n-1;k>i;--k)
cout<<"*";
cout<<"
";
}
getch(); //to stop the screen
}

C program to create a loading bar

#include<iostream.h>
#include<conio.h>
#include<graphics.h>
#include<dos.h>

void main()
{
int x=170,i,gdriver=DETECT,gmode;
initgraph(&gdriver,&gmode,"c:\tc\bgi");
settextstyle(DEFAULT_FONT,HORIZ_DIR,2);
outtextxy(170,180,"LOADING,PLEASE WAIT");

for(i=0;i<300;++i)
{
delay(30);
line(x,200,x,220);
x++;
}
getch();
closegraph();
}

Program to Create Calculator Using Java Swing

The program to create a simple calculator in Swing is given below. Just try it and if you find any difficulty in understanding the program then mention it in the comment.

import javax.swing.*;
import java.awt.event.*;

class Calc implements ActionListener
{
JFrame f;
JTextField t;
JButton b1,b2,b3,b4,b5,b6,b7,b8,b9,b0,bdiv,bmul,bsub,badd,bdec,beq,bdel,bclr;

static double a=0,b=0,result=0;
static int operator=0;

Calc()
{
f=new JFrame("Calculator");
t=new JTextField();
b1=new JButton("1");
b2=new JButton("2");
b3=new JButton("3");
b4=new JButton("4");
b5=new JButton("5");
b6=new JButton("6");
b7=new JButton("7");
b8=new JButton("8");
b9=new JButton("9");
b0=new JButton("0");
bdiv=new JButton("/");
bmul=new JButton("*");
bsub=new JButton("-");
badd=new JButton("+");
bdec=new JButton(".");
beq=new JButton("=");
bdel=new JButton("Delete");
bclr=new JButton("Clear");

t.setBounds(30,40,280,30);
b7.setBounds(40,100,50,40);
b8.setBounds(110,100,50,40);
b9.setBounds(180,100,50,40);
bdiv.setBounds(250,100,50,40);

b4.setBounds(40,170,50,40);
b5.setBounds(110,170,50,40);
b6.setBounds(180,170,50,40);
bmul.setBounds(250,170,50,40);

b1.setBounds(40,240,50,40);
b2.setBounds(110,240,50,40);
b3.setBounds(180,240,50,40);
bsub.setBounds(250,240,50,40);

bdec.setBounds(40,310,50,40);
b0.setBounds(110,310,50,40);
beq.setBounds(180,310,50,40);
badd.setBounds(250,310,50,40);

bdel.setBounds(60,380,100,40);
bclr.setBounds(180,380,100,40);

f.add(t);
f.add(b7);
f.add(b8);
f.add(b9);
f.add(bdiv);
f.add(b4);
f.add(b5);
f.add(b6);
f.add(bmul);
f.add(b1);
f.add(b2);
f.add(b3);
f.add(bsub);
f.add(bdec);
f.add(b0);
f.add(beq);
f.add(badd);
f.add(bdel);
f.add(bclr);

f.setLayout(null);
f.setVisible(true);
f.setSize(350,500);
f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
f.setResizable(false);

b1.addActionListener(this);
b2.addActionListener(this);
b3.addActionListener(this);
b4.addActionListener(this);
b5.addActionListener(this);
b6.addActionListener(this);
b7.addActionListener(this);
b8.addActionListener(this);
b9.addActionListener(this);
b0.addActionListener(this);
badd.addActionListener(this);
bdiv.addActionListener(this);
bmul.addActionListener(this);
bsub.addActionListener(this);
bdec.addActionListener(this);
beq.addActionListener(this);
bdel.addActionListener(this);
bclr.addActionListener(this);
}

public void actionPerformed(ActionEvent e)
{
if(e.getSource()==b1)
t.setText(t.getText().concat("1"));

if(e.getSource()==b2)
t.setText(t.getText().concat("2"));

if(e.getSource()==b3)
t.setText(t.getText().concat("3"));

if(e.getSource()==b4)
t.setText(t.getText().concat("4"));

if(e.getSource()==b5)
t.setText(t.getText().concat("5"));

if(e.getSource()==b6)
t.setText(t.getText().concat("6"));

if(e.getSource()==b7)
t.setText(t.getText().concat("7"));

if(e.getSource()==b8)
t.setText(t.getText().concat("8"));

if(e.getSource()==b9)
t.setText(t.getText().concat("9"));

if(e.getSource()==b0)
t.setText(t.getText().concat("0"));

if(e.getSource()==bdec)
t.setText(t.getText().concat("."));

if(e.getSource()==badd)
{
a=Double.parseDouble(t.getText());
operator=1;
t.setText("");
}

if(e.getSource()==bsub)
{
a=Double.parseDouble(t.getText());
operator=2;
t.setText("");
}

if(e.getSource()==bmul)
{
a=Double.parseDouble(t.getText());
operator=3;
t.setText("");
}

if(e.getSource()==bdiv)
{
a=Double.parseDouble(t.getText());
operator=4;
t.setText("");
}

if(e.getSource()==beq)
{
b=Double.parseDouble(t.getText());

switch(operator)
{
case 1: result=a+b;
break;

case 2: result=a-b;
break;

case 3: result=a*b;
break;

case 4: result=a/b;
break;

default: result=0;
}

t.setText(""+result);
}

if(e.getSource()==bclr)
t.setText("");

if(e.getSource()==bdel)
{
String s=t.getText();
t.setText("");
for(int i=0;i<s.length()-1;i++)
t.setText(t.getText()+s.charAt(i));
}

}

public static void main(String...s)
{
new Calc();
}
}

Polynomial addition, multiplication (8th degree polynomials) using arrays

#include<math.h>
#include<stdio.h>
#include<conio.h>
#define MAX 17
void init(int p[]);
void read(int p[]);
void print(int p[]);
void add(int p1[],int p2[],int p3[]);
void multiply(int p1[],int p2[],int p3[]);

/*Polynomial is stored in an array, p[i] gives coefficient of x^i .
a polynomial 3x^2 + 12x^4 will be represented as (0,0,3,0,12,0,0,....)
*/

void main()
{
int p1[MAX],p2[MAX],p3[MAX];
int option;
do
{
printf("

1 : create 1st polynomial");
printf("
2 : create 2nd polynomial");
printf("
3 : Add polynomials");
printf("
4 : Multiply polynomials");
printf("
5 : Quit");
printf("
Enter your choice :");
scanf("%d",&option);
switch(option)
{
case 1:read(p1);break;
case 2:read(p2);break;
case 3:add(p1,p2,p3);
printf("
1st polynomial -> ");
print(p1);
printf("
2nd polynomial -> ");
print(p2);
printf("
Sum = ");
print(p3);
break;
case 4:multiply(p1,p2,p3);
printf("
1st polynomial -> ");
print(p1);
printf("
2nd polynomial -> ");
print(p2);
printf("
Product = ");
print(p3);
break;
}
}while(option!=5);
}
void read(int p[])
{
int n, i, power,coeff;
init(p);
printf("
Enter number of terms :");
scanf("%d",&n);
/* read n terms */
for (i=0;i<n;i++)
{ printf("
enter a term(power coeff.)");
scanf("%d%d",&power,&coeff);
p[power]=coeff;
}
}
void print(int p[])
{
int i;
for(i=0;i<MAX;i++)
if(p[i]!=0)
printf("%dX^%d ",p[i],i);
}
void add(int p1[], int p2[], int p3[])
{
int i;
for(i=0;i<MAX;i++)
p3[i]=p1[i]+p2[i];
}

void multiply(int p1[], int p2[], int p3[])
{
int i,j;
init(p3);
for(i=0;i<MAX;i++)
for(j=0;j<MAX;j++)
p3[i+j]=p3[i+j]+p1[i]*p2[j];
}
void init(int p[])
{
int i;
for(i=0;i<MAX;i++)
p[i]=0;
}

Also Read: C Program for Addition of two Sparse Matrices
Also Read: C Program for Array Representation of Stack [Push, Pop and Display]

Polynomial addition, multiplication (8th degree polynomials) using linked list

#include<math.h>

#include<stdio.h>

#include<conio.h>

#define MAX 17

typedef struct node

{

int coeff;

struct node *next;

}node;

node * init();

void read(node *h1);

void print(node *h1);

node * add(node *h1,node *h2);

node * multiply(node *h1,node *h2);

/*Polynomial is stored in a linked list, ith node gives coefficient of x^i .

a polynomial 3x^2 + 12x^4 will be represented as (0,0,3,0,12,0,0,....)

void main()

{

node *h1=NULL,*h2=NULL,*h3=NULL;

int option;

{

printf("

1 : create 1st polynomial");

printf("
2 : create 2nd polynomial");

printf("
3 : Add polynomials");

printf("
4 : Multiply polynomials");

printf("
5 : Quit");

printf("
Enter your choice :");

scanf("%d",&option);

switch(option)

{

case 1:h1=init();read(h1);break;

case 2:h2=init();read(h2);break;

case 3:h3=add(h1,h2);

printf("
1st polynomial -> ");

print(h1);

printf("
2nd polynomial -> ");

print(h2);

printf("
Sum = ");

print(h3);

break;

case 4:h3=multiply(h1,h2);

printf("
1st polynomial -> ");

print(h1);

printf("
2nd polynomial -> ");

print(h2);

printf("
Product = ");

print(h3);

break;

}

}while(option!=5);

}

void read(node *h)

{

int n,i,j,power,coeff;

node *p;

p=init();

printf("
Enter number of terms :");

scanf("%d",&n);

/* read n terms */

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

{ printf("
enter a term(power coeff.)");

scanf("%d%d",&power,&coeff);

for(p=h,j=0;j<power;j++)

p=p->next;

p->coeff=coeff;

}

void print(node *p)

{

int i;

for(i=0;p!=NULL;i++,p=p->next)

if(p->coeff!=0)

printf("%dX^%d ",p->coeff,i);

}

node * add(node *h1, node *h2)

{

node *h3,*p;

h3=init();

p=h3;

while(h1!=NULL)

{

h3->coeff=h1->coeff+h2->coeff;

h1=h1->next;

h2=h2->next;

h3=h3->next;

}

return(p);

}

node * multiply(node *h1, node *h2)

{

node *h3,*p,*q,*r;

int i,j,k,coeff,power;

h3=init();

for(p=h1,i=0;p!=NULL;p=p->next,i++)

for(q=h2,j=0;q!=NULL;q=q->next,j++)

{

coeff=p->coeff * q->coeff;

power=i+j;

for(r=h3,k=0;k<power;k++)

r=r->next;

r->coeff=r->coeff+coeff;

}

return(h3);

}

node * init()

{

int i;

node *h=NULL,*p;

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

{

p=(node*)malloc(sizeof(node));

p->next=h;

p->coeff=0;

h=p;

}

return(h);

}

C Program for Addition and Multiplication of Polynomial Using Arrays or Linked List

How to Program Google Android

LEARN TO PROGRAM

Lets Tutorial

Sunday, February 15, 2015

Java program to find whether a number is armstrong or not

Saturday, February 14, 2015

C Program to calculate Factorial of any number

C program to print following trianlge using character

Friday, February 13, 2015

C program to print the following design

Thursday, February 12, 2015

C program to create a loading bar

Wednesday, February 11, 2015

Program to Create Calculator Using Java Swing

C Program for Addition and Multiplication of Polynomial Using Arrays or Linked List

Polynomial addition, multiplication (8th degree polynomials) using arrays

Polynomial addition, multiplication (8th degree polynomials) using linked list

Tuesday, February 3, 2015

How to Program Google Android

How to Program Google Android