Programming with C\C++ and java

HTML Layout source code

2012-02-13T23:11:00.000+05:30

<html><bodybackground="http://img.wallpaperstock.net:81/abstract-fantasy-land-wallpapers_10123_1600x1200.jpg">

<img src="http://lh3.ggpht.com/-flGvqUJT4Tc/TWeVrfVKntI/AAAAAAAAAaI/ODtm2kpIsJg/Dev.3.jpg" height="75" width="63" border="1" alt="Devesh"/>



<table width="800" height ="600" border="0" align="center">
<tr>
<td colspan="2" style="background-color: purple;">
<center> <h1><font color="white"> Main title of the webpage </font> </h1></center>
</td>
</tr>

<tr valign="top">
<td style="background-color:yellowgreen;width:100px;text-align:top;">
<br/>
<b>  Menu</b><br />
<font color="blue">
  HTML<br />
  CSS<br />
  JavaScript <br/>
  PHP </br>
  ASP
</font>
</td>
<td style="background-color:lightgray;height:500px;width:400px;text-align:top;">
  Page content goes here....</td>
</tr>

<tr>
<td colspan="2" style="background-color:skyblue;text-align:center;">
Copyright © 2012 <a href="http:\\www.deveshucer.blogspot.com">deveshucer.blogspot.com</a></td>
</tr>
</table>

</body>
</html>

Output look like this.........

Main title of the webpage
Menu HTML CSS JavaScript PHP ASP	Page content goes here....
Copyright © 2012 deveshucer.blogspot.com

How to use function ?

2011-12-25T16:37:00.001+05:30

#include<stdio.h>

#include<conio.h>
int header();
int sum; /* This is a global variable */
int main( )
{
int index;
header(); /* This calls the function named header */
for (index = 1;index <= 7;index++)
square(index); /* This calls the square function */
ending();
getch(); /* This calls the ending function */
}

header() /* This is the function named header */
{
sum = 0; /* initialize the variable "sum" */
printf("This is the header for the square program\n\n");
}

square(number) /* This is the square function */
int number;
{
int numsq;
numsq = number * number; /* This produces the square */
sum += numsq;
printf("The square of %d is %d\n",number,numsq);
}
ending() /* This is the ending function */
{
printf("\nThe sum of the squares is %d\n",sum);

}

Data Types in C

2011-12-25T16:31:00.002+05:30

A programming language is proposed to help programmer to process certain kinds of data and to

provide useful output. The task of data processing is accomplished by executing series of commands

called program. A program usually contains different types of data types (integer, float, character

etc.) and need to store the values being used in the program. C language is rich of data types. A C

programmer has to employ proper data type as per his requirements.

C has different data types for different types of data and can be broadly classified as:

1. Primary Data Types

2. Secondary Data Types

Primary Data Types:

Integer Data Types:

Integers are whole numbers with a range of values, range of values are machine dependent.

Generally an integer occupies 2 bytes memory space and its value range limited to -32768 to +32767

(that is, -215 to +215-1). A signed integer use one bit for storing sign and rest 15 bits for number.

To control the range of numbers and storage space, C has three classes of integer storage namely

short int, int and long int. All three data types have signed and unsigned forms. A short

int requires half the amount of storage than normal integer. Unlike signed integer, unsigned

integers are always positive and use all the bits for the magnitude of the number. Therefore, the

range of an unsigned integer will be from 0 to 65535. The long integers are used to declare a longer

range of values and it occupies 4 bytes of storage space.

Syntax:

int <variable name>;

int num1;

short int num2;

long int num3;

Example: 5, 6, 100, 2500.

Integer Data Type Memory Allocation:

Floating Point Data Types:

The float data type is used to store fractional numbers (real numbers) with 6 digits of precision.

Floating point numbers are denoted by the keyword float. When the accuracy of the floating point

number is insufficient, we can use the double to define the number. The double is same as float but with longer precision and takes double space (8 bytes) than float. To extend the precision

further we can use long double which occupies 10 bytes of memory space.

Syntax :

float <variable name>;

float num1;

double num2;

long double num3;

Example: 9.125, 3.1254.

Floating Point Data Type Memory Allocation :

Character Data Type:

Character type variable can hold a single character and are declared by using the keyword char. As

there are singed and unsigned int (either short or long), in the same way there are signed and

unsigned chars; both occupy 1 byte each, but having different ranges. Unsigned characters have

values between 0 and 255, signed characters have values from –128 to 127.

Syntax:

char <variable name>;

char ch = ‘a’;

Example: a, b, g, S, j.

Void Type:

The void type has no values therefore we cannot declare it as variable as we did in case of integer

and float. The void data type is usually used with function to specify its type.

Program to finding TRANSPOSE matrix of a matrix

2011-12-24T01:57:00.000+05:30

//program to transpose a matrix//

#include<stdio.h>
#include<conio.h>
#define max 5
void main()
{
int i,j,m,n,a[max][max],b[max][max];
clrscr();
printf("\t\t\t**** TRANSPOSE OF A MATRIX ****");
printf("\nEnter the no. of rows & coloumns:\n");
scanf("%d%d",&m,&n);
printf("Enter the elements of matrix:\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
scanf("%d",&a[i][j]);
b[j][i]=a[i][j];
}
}
printf("\nInputed Matrixes is:\n\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
{
printf("%-4d\t",a[i][j]); //4 digit right alignment
}
printf("\n");
}
printf("\nTransposed matrix is:\n\n");
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
printf("%-4d\t",b[i][j]); //4 digit right alignment
}
printf("\n");
}
getch();
}

//Snap shot of output...

MULTIPLICATION of Two Matrices

2011-12-24T01:50:00.001+05:30

// *****MULTIPLICATION of Two Matrices*****//
#include<stdio.h>
#include<conio.h>
void main()
{
int i,j,sum,a[10][10],b[10][10],c[10][10],m,n,k=0;
clrscr();
printf(" *** MULTIPLICATION OF TWO MATRIXES ***");
printf("\nEnter the no. of rows & coloumns :\n");
scanf("%d%d",&m,&n);
if(m!=n)
printf("\nEnter The same no. of rows & coloumns !");
else
{
printf("Enter the elements of 1st matrix :\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
printf("Enter the elements of 2nd matrix :\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&b[i][j]);
}
{
while(k<n)
{
sum=0;
for(i=0;i<m;i++)
{
for (j=0;j<n;j++)
{
for(k=0;k<n;k++)
sum=sum+a[i][k]*b[k][j];
c[i][j]=sum;
sum=0;
}
}
}
printf("Result- Multipliccation of two Matrixes :\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%d\t",c[i][j]);
{
printf("\n");
}
}
}
printf("\nThanks ! For using my Program.");
getch();
}
}

//Snap shot of output...

A Program for ADDITION of two matrix

2011-12-24T01:43:00.000+05:30

//*****A program for ADDITION of two matrixes*****//

#include<stdio.h>
#include<conio.h>
void main()
{
int i,j,a[10][10],b[10][10],c[10][10],m,n;
clrscr();
printf("\t\t *** ADDITION OF MATRIXES ***");
printf("\nEnter the no. of row & coloumn :\n");
scanf("%d%d",&m,&n);
printf("Enter the elements of 1st matrix:\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&a[i][j]);
}
printf("Enter the element of 2nd matrix :\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
scanf("%d",&b[i][j]);
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
c[i][j]=a[i][j]+b[i][j];
}
printf("Addition of both matirxes is :\n");
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%d\t",c[i][j]);
{
printf("\n");
}
}
printf("\nThanks! for using the programe.......@Devesh");
getch();

}

//output look like this....

BST Creation, Insertion and Display

2011-12-13T01:23:00.000+05:30

#include<stdio.h>
#include<stdlib.h>
#include<conio.h>

struct searchtree
{
int element;
struct searchtree *left,*right;
}*root;
typedef struct searchtree *node;
typedef int ElementType;

node insert(ElementType, node);
void makeempty();
void display(node, int);
void makeempty()
{
root = NULL;
}

void main()
{
int ch;
ElementType a;
makeempty();
while(1)
{

printf("\n1. Insert\n2. Display\n3. Exit\n");
printf("\nEnter Your Choice : ");
scanf("%d",&ch);
switch(ch)
{

case 1:
printf("Enter an element : ");
scanf("%d", &a);
root = insert(a, root);
break;
case 2: if(root==NULL)
printf("\nEmpty tree");
else display(root, 1);
break;
case 3: exit(0);
default:printf("Invalid Choice");
}
}
}
node insert(ElementType x, node t)
{
if( t == NULL)
{
t = (node)malloc(sizeof(node));
t->element = x;
t->left = t->right = NULL;

}else
{
if(x < t->element) t->left = insert(x, t->left);
else if(x > t->element) t->right = insert(x, t->right);
}
return t;
}

void display(node t,int level)
{
int i;
if(t)
{

display(t->right, level+1);
printf("\n");
for(i=0;i<level;i++)

printf(" ");
printf("%d", t->element);
display(t->left, level+1);

}

}

Output look like this :

Human face or Smiley program in java using Applet

2011-12-10T14:32:00.001+05:30

import java.awt.*;
import java.applet.*;

public class HumanFace extends Applet{
private int mouseX, mouseY;
private boolean mouseclicked = false;
public void init(){
setBackground(Color.GREEN);
}

public void paint(Graphics g)
{
g.setColor(Color.YELLOW);
g.fillOval(40,40,120,150);
g.setColor(Color.BLACK);
g.drawOval(57,75,30,30);
g.drawOval(110,75,30,30);
g.fillOval(68,81,10,10);
g.fillOval(121,81,10,10);
g.setColor(Color.RED);
g.drawLine(100,100,100,130);
g.fillRect(75,140,50,7);
if (mouseclicked) {
g.clearRect(75,140,50,7);
g.setColor(Color.BLUE);
g.fillRect(70,139,60,9);
//g.drawArc(40,100,100,50,0,-120);
mouseclicked = true;
}

}

public boolean mouseDown(Event e, int x, int y )
{
mouseX=x; mouseY=y;
mouseclicked = true;
repaint();
return true;
}
}
/* <applet code="HumanFace.class" height= "300" width="200" >
</applet> */

//Output look like this...

Clock applet program in java

2011-11-13T00:29:00.001+05:30

import java.util.*;
import java.awt.*;
import java.applet.*;
import java.text.*;

/**
* programmingwithdev.blogspot.com
* clock applet program
**/
public class Clock extends Applet implements Runnable {
private volatile Thread timer; // The thread that displays clock
private int lastxs, lastys, lastxm,
lastym, lastxh, lastyh; // Dimensions used to draw hands
private SimpleDateFormat formatter; // Formats the date displayed
private String lastdate; // String to hold date displayed
private Font clockFaceFont; // Font for number display on clock
private Date currentDate; // Used to get date to display
private Color handColor; // Color of main hands and dial
private Color numberColor; // Color of second hand and numbers

public void init() {
int x,y;
lastxs = lastys = lastxm = lastym = lastxh = lastyh = 0;
formatter = new SimpleDateFormat ("EEE MMM dd hh:mm:ss yyyy",
Locale.getDefault());
currentDate = new Date();
lastdate = formatter.format(currentDate);
clockFaceFont = new Font("Serif", Font.PLAIN, 14);
handColor = Color.blue;
numberColor = Color.red;

try {
setBackground(new Color(Integer.parseInt(getParameter("bgcolor"),
16)));
} catch (NullPointerException e) {
} catch (NumberFormatException e) {
}
try {
handColor = new Color(Integer.parseInt(getParameter("fgcolor1"),
16));
} catch (NullPointerException e) {
} catch (NumberFormatException e) {
}
try {
numberColor = new Color(Integer.parseInt(getParameter("fgcolor2"),
16));
} catch (NullPointerException e) {
} catch (NumberFormatException e) {
}
resize(300,300); // Set clock window size
}

// Paint is the main part of the program
public void paint(Graphics g) {
int xh, yh, xm, ym, xs, ys;
int s = 0, m = 10, h = 10;
int xcenter = 80, ycenter = 55;
String today;

currentDate = new Date();

formatter.applyPattern("s");
try {
s = Integer.parseInt(formatter.format(currentDate));
} catch (NumberFormatException n) {
s = 0;
}
formatter.applyPattern("m");
try {
m = Integer.parseInt(formatter.format(currentDate));
} catch (NumberFormatException n) {
m = 10;
}
formatter.applyPattern("h");
try {
h = Integer.parseInt(formatter.format(currentDate));
} catch (NumberFormatException n) {
h = 10;
}

// Set position of the ends of the hands
xs = (int) (Math.cos(s * Math.PI / 30 - Math.PI / 2) * 45 + xcenter);
ys = (int) (Math.sin(s * Math.PI / 30 - Math.PI / 2) * 45 + ycenter);
xm = (int) (Math.cos(m * Math.PI / 30 - Math.PI / 2) * 40 + xcenter);
ym = (int) (Math.sin(m * Math.PI / 30 - Math.PI / 2) * 40 + ycenter);
xh = (int) (Math.cos((h*30 + m / 2) * Math.PI / 180 - Math.PI / 2) * 30
+ xcenter);
yh = (int) (Math.sin((h*30 + m / 2) * Math.PI / 180 - Math.PI / 2) * 30
+ ycenter);

// Draw the circle and numbers
g.setFont(clockFaceFont);
g.setColor(Color.blue);
g.drawArc(xcenter-50, ycenter-50, 100, 100, 10, 360);
g.setColor(numberColor);
g.drawString("9", xcenter-45, ycenter+3);
g.drawString("3", xcenter+40, ycenter+3);
g.drawString("12", xcenter-5, ycenter-37);
g.drawString("6", xcenter-3, ycenter+45);

// Get the date to print at the bottom
formatter.applyPattern("EEE MMM dd HH:mm:ss yyyy");
today = formatter.format(currentDate);

// Erase if necessary
g.setColor(getBackground());
if (xs != lastxs || ys != lastys) {
g.drawLine(xcenter, ycenter, lastxs, lastys);
g.drawString(lastdate, 5, 125);
}
if (xm != lastxm || ym != lastym) {
g.drawLine(xcenter, ycenter-1, lastxm, lastym);
g.drawLine(xcenter-1, ycenter, lastxm, lastym);
}
if (xh != lastxh || yh != lastyh) {
g.drawLine(xcenter, ycenter-1, lastxh, lastyh);
g.drawLine(xcenter-1, ycenter, lastxh, lastyh);
}

// Draw date and hands
g.setColor(Color.black);
g.drawString(today, 5, 125);
g.drawLine(xcenter, ycenter, xs, ys);
g.setColor(handColor);
g.drawLine(xcenter, ycenter-1, xm, ym);
g.drawLine(xcenter-1, ycenter, xm, ym);
g.drawLine(xcenter, ycenter-1, xh, yh);
g.drawLine(xcenter-1, ycenter, xh, yh);
lastxs = xs; lastys = ys;
lastxm = xm; lastym = ym;
lastxh = xh; lastyh = yh;
lastdate = today;
currentDate = null;
}

public void start() {
timer = new Thread(this);
timer.start();
}

public void stop() {
timer = null;
}

public void run() {
Thread me = Thread.currentThread();
while (timer == me) {
try {
Thread.currentThread().sleep(100);
} catch (InterruptedException e) {
}
repaint();
}
}

public void update(Graphics g) {
paint(g);
}

public String getAppletInfo() {
return "Title: A Clock \n"
+ "Author: Rachel Gollub, 1995 \n"
+ "An analog clock.";
}

public String[][] getParameterInfo() {
String[][] info = {
{"bgcolor", "hexadecimal RGB number",
"The background color. Default is the color of your browser."},
{"fgcolor1", "hexadecimal RGB number",
"The color of the hands and dial. Default is blue."},
{"fgcolor2", "hexadecimal RGB number",
"The color of the second hand and numbers. Default is dark gray."}
};
return info;
}
}

/* <applet code="Clock.class" height = "300" width = "200" >
</applet>
*/

My Clock

My Applet Clock

Binary Search Tree (BST) Operations

2011-11-08T23:08:00.003+05:30

// BST.cpp : Defines the entry point for the console application.
//
#include "stdafx.h"
#include <iostream>
#include <cstdlib>
using namespace std;

class BinarySearchTree
{
private:
struct tree_node
{
tree_node* left;
tree_node* right;
int data;
};
tree_node* root;
public:
BinarySearchTree()
{
root = NULL;
}
bool isEmpty() const { return root==NULL; }
void print_inorder();
void inorder(tree_node*);
void print_preorder();
void preorder(tree_node*);
void print_postorder();
void postorder(tree_node*);
void insert(int);
void remove(int);
void search(int);
};

// Smaller elements go left
// larger elements go right
void BinarySearchTree::insert(int d)
{
tree_node* t = new tree_node;
tree_node* parent;
t->data = d;
t->left = NULL;
t->right = NULL;
parent = NULL;
// is this a new tree?
if(isEmpty()) root = t;
else
{
//Note: ALL insertions are as leaf nodes
tree_node* curr;
curr = root;
// Find the Node's parent
while(curr)
{
parent = curr;
if(t->data > curr->data) curr = curr->right;
else curr = curr->left;
}

if(t->data < parent->data)
parent->left = t;
else
parent->right = t;
}
}

void BinarySearchTree::remove(int d)
{
//Locate the element
bool found = false;
if(isEmpty())
{
cout<<" This Tree is empty! "<<endl;
return;
}
tree_node* curr;
tree_node* parent;
curr = root;
while(curr != NULL)
{
if(curr->data == d)
{
found = true;
break;
}
else
{
parent = curr;
if(d>curr->data) curr = curr->right;
else curr = curr->left;
}
}
if(!found)
{
cout<<" Data not found! "<<endl;
return;
}

// 3 cases :
// 1. We're removing a leaf node
// 2. We're removing a node with a single child
// 3. we're removing a node with 2 children

// Node with single child
if((curr->left == NULL && curr->right != NULL)|| (curr->left != NULL&& curr->right == NULL))
{
if(curr->left == NULL && curr->right != NULL)
{
if(parent->left == curr)
{
parent->left = curr->right;
delete curr;
}
else
{
parent->right = curr->right;
delete curr;
}
}
else // left child present, no right child
{
if(parent->left == curr)
{
parent->left = curr->left;
delete curr;
}
else
{
parent->right = curr->left;
delete curr;
}
}
return;
}

//We're looking at a leaf node
if( curr->left == NULL && curr->right == NULL)
{
if(parent->left == curr) parent->left = NULL;
else parent->right = NULL;
delete curr;
return;
}

//Node with 2 children
// replace node with smallest value in right subtree
if (curr->left != NULL && curr->right != NULL)
{
tree_node* chkr;
chkr = curr->right;
if((chkr->left == NULL) && (chkr->right == NULL))
{
curr = chkr;
delete chkr;
curr->right = NULL;
}
else // right child has children
{
//if the node's right child has a left child
// Move all the way down left to locate smallest element

if((curr->right)->left != NULL)
{
tree_node* lcurr;
tree_node* lcurrp;
lcurrp = curr->right;
lcurr = (curr->right)->left;
while(lcurr->left != NULL)
{
lcurrp = lcurr;
lcurr = lcurr->left;
}
curr->data = lcurr->data;
delete lcurr;
lcurrp->left = NULL;
}
else
{
tree_node* tmp;
tmp = curr->right;
curr->data = tmp->data;
curr->right = tmp->right;
delete tmp;
}

}
return;
}

}

void BinarySearchTree::print_inorder()
{
inorder(root);
}

void BinarySearchTree::inorder(tree_node* p)
{
if(p != NULL)
{
if(p->left) inorder(p->left);
cout<<" "<<p->data<<" ";
if(p->right) inorder(p->right);
}
else return;
}

void BinarySearchTree::print_preorder()
{
preorder(root);
}

void BinarySearchTree::preorder(tree_node* p)
{
if(p != NULL)
{
cout<<" "<<p->data<<" ";
if(p->left) preorder(p->left);
if(p->right) preorder(p->right);
}
else return;
}

void BinarySearchTree::print_postorder()
{
postorder(root);
}

void BinarySearchTree::postorder(tree_node* p)
{
if(p != NULL)
{
if(p->left) postorder(p->left);
if(p->right) postorder(p->right);
cout<<" "<<p->data<<" ";
}
else return;
}

int main()
{
BinarySearchTree b;
int ch,tmp,tmp1;
while(1)
{
cout<<endl<<endl;
cout<<" Binary Search Tree Operations "<<endl;
cout<<" ----------------------------- "<<endl;
cout<<" 1. Insertion/Creation "<<endl;
cout<<" 2. In-Order Traversal "<<endl;
cout<<" 3. Pre-Order Traversal "<<endl;
cout<<" 4. Post-Order Traversal "<<endl;
cout<<" 5. Removal "<<endl;
cout<<" 6. Exit "<<endl;
cout<<" Enter your choice : ";
cin>>ch;
switch(ch)
{
case 1 : cout<<" Enter Number to be inserted : ";
cin>>tmp;
b.insert(tmp);
break;
case 2 : cout<<endl;
cout<<" In-Order Traversal "<<endl;
cout<<" -------------------"<<endl;
b.print_inorder();
break;
case 3 : cout<<endl;
cout<<" Pre-Order Traversal "<<endl;
cout<<" -------------------"<<endl;
b.print_preorder();
break;
case 4 : cout<<endl;
cout<<" Post-Order Traversal "<<endl;
cout<<" --------------------"<<endl;
b.print_postorder();
break;
case 5 : cout<<" Enter data to be deleted : ";
cin>>tmp1;
b.remove(tmp1);
break;
case 6 : system("pause");
return 0;
break;
}
}
}

/*Note :: This solution works on visual studio platform if you want to run in another platform then be careful it needs some modification in main */

Data Types in C Language

2011-10-15T02:45:00.000+05:30

A programming language is proposed to help programmer to process certain kinds of data and to
provide useful output. The task of data processing is accomplished by executing series of commands
called program. A program usually contains different types of data types (integer, float, character
etc.) and need to store the values being used in the program. C language is rich of data types. A C
programmer has to employ proper data type as per his requirements.
C has different data types for different types of data and can be broadly classified as:
1. Primary Data Types
2. Secondary Data Types