programs | Student Projects

C++ programs for sorting numbers in ascending order using Quick sort method

Editorial Team — Thu, 11 Mar 2010 17:27:51 +0000

/* Write C++ programs for sorting a given list of elements in ascending order using Quick sort sorting methods */

#include
#include
int a[10],l,u,i,j;
void quick(int *,int,int);
void main()
{
clrscr();
cout <<"enter 10 elements";
for(i=0;i<10;i++)
cin >> a[i];
l=0;
u=9;
quick(a,l,u);
cout <<"sorted elements";
for(i=0;i<10;i++)
cout << a[i] << " ";
getch();
}

void quick(int a[],int l,int u)
{
   int p,temp;
   if(lp && i<=j )
	   j--;
      if(i<=j)
      {
      temp=a[i];
      a[i]=a[j];
      a[j]=temp;}
  }
  temp=a[j];
  a[j]=a[l];
  a[l]=temp;
  cout <<"\n";
  for(i=0;i<10;i++)
  cout <
OUTPUT
enter 10 elements5 2 3 16 25 1 20 7 8 61 14
1 2 3 5 25 16 20 7 8 61

1 2 3 5 25 16 20 7 8 61

1 2 3 5 25 16 20 7 8 61

1 2 3 5 25 16 20 7 8 61

1 2 3 5 25 16 20 7 8 61

1 2 3 5 8 16 20 7 25 61

1 2 3 5 7 8 20 16 25 61

1 2 3 5 7 8 16 20 25 61

1 2 3 5 7 8 16 20 25 61 
sorted elements1 2 3 5 7 8 16 20 25 61
The post C++ programs for sorting numbers in ascending order using Quick sort method first appeared on Student Projects.

C++ program that uses non-recursive functions to traverse a binary tree in In-order

Editorial Team — Thu, 11 Mar 2010 17:20:22 +0000

/* Write C++ program that uses non-recursive functions to traverse a binary tree in In-order */

#include
#include
#include
using namespace std;
class node
{
public:
class node *left;
class node *right;
int data;
};

class tree: public node
{
public:
int stk[50],top;
node *root;
tree()
{
root=NULL;
top=0;
}
void insert(int ch)
{
	node *temp,*temp1;
	if(root== NULL)
	{
		root=new node;
		root->data=ch;
		root->left=NULL;
		root->right=NULL;
		return;
	}
	temp1=new node;
	temp1->data=ch;
	temp1->right=temp1->left=NULL;
	temp=search(root,ch);
	if(temp->data>ch)
		temp->left=temp1;
	else
		temp->right=temp1;

}

node *search(node *temp,int ch)
{
	if(root== NULL)
	{
		cout <<"no node present";
		return NULL;
	}
	if(temp->left==NULL && temp->right== NULL)
		return temp;

	if(temp->data>ch)
	     {  if(temp->left==NULL) return temp;
		search(temp->left,ch);}
	else
	      { if(temp->right==NULL) return temp;
	      search(temp->right,ch);

}              }

void display(node *temp)
{
	if(temp==NULL)
	    return ;
	display(temp->left); 
	cout<data;
	display(temp->right);
}
void inorder( node *root)
{
	node *p;
	p=root;
	top=0;
	do
	{
		while(p!=NULL)
		{
			stk[top]=p->data;
			top++;
			p=p->left;
		}
		if(top>0)
		{
			p=pop(root);
			cout << p->data;
			p=p->right;
		}
	}while(top!=0 || p!=NULL);
}


node * pop(node *p)
{
	int ch;
	ch=stk[top-1];
	if(p->data==ch)
	{
		top--;
		return p;
	}
	if(p->data>ch)
		pop(p->left);
	else
		pop(p->right);
}
};

main()
{
	tree t1;
	int ch,n,i;
	while(1)
	{
		cout <<"\n1.INSERT\n2.DISPLAY 3.INORDER TRAVERSE\n4.EXIT\nEnter your choice:";
		cin >> ch;
		switch(ch)
		{
		case 1:   cout <<"enter no of elements to insert:";
			  cin >> n;
			  for(i=1;i<=n;i++)
			  {  cin >> ch;
			     t1.insert(ch);
			  }
			   break;
		case 2:   t1.display(t1.root);break;
		case 3:   t1.inorder(t1.root); break;
		case 4:   exit(1);
		}
	}
}

OUTPUT

1.INSERT
2.DISPLAY 3.INORDER TRAVERSE
4.EXIT
Enter your choice:1
enter no of elements to inser
5 24 36 11 44 2 21

1.INSERT
2.DISPLAY 3.INORDER TRAVERSE
4.EXIT
Enter your choice:3
251121243644

1.INSERT
2.DISPLAY 3.INORDER TRAVERSE
4.EXIT
Enter your choice:4

The post C++ program that uses non-recursive functions to traverse a binary tree in In-order first appeared on Student Projects.

Java program to read and display files

Editorial Team — Fri, 02 Oct 2009 17:44:29 +0000

Write a Java program that reads a file and displays the file on the screen, with a line number before each line.

import java.io.*;
class linenum
{
	public static void main(String[] args)throws IOException
	{
		FileInputStream fil;
		LineNumberInputStream line;
		int i;
		try
		{
			fil=new FileInputStream(args[0]);
			line=new LineNumberInputStream(fil);
		}
		catch(FileNotFoundException e)
		{
			System.out.println("No such file found");
			return;
		}
		do
		{
			i=line.read();
			if(i=='\n')
			{
				System.out.println();
				System.out.print(line.getLineNumber()+" ");
			}
			else
				System.out.print((char)i);
		}while(i!=-1);
		fil.close();
		line.close();
	}
}

Output:

Demo.java

class Demo
1 {
2 public static void main(java Demo beta gamma delta)
3 {
4 int n = 1 ;
5 System.out.println(“The word is ” + args[ n ] );
6 }
7 }
8?

The post Java program to read and display files first appeared on Student Projects.

C Program to for Midpoint Line algorithm

Editorial Team — Fri, 02 Oct 2009 09:51:23 +0000

Program to implement the Midpoint Line algorithm to generate a line of given slope and thickness. Implement the polyline (many lines) command using this algorithm as a routine that display a set of straight lines between N input points. For n=1 the routine displays a single point.

#include
#include
#include
#include
#include
#define MAX 10

void swap(int* a,int* b)
{
	int t=*a;
	*a=*b;
	*b=t;
}

void midpointline(int x1,int y1,int x2,int y2)
{
	int dx,dy,d,incry,incre,incrne,slopegt1=0;
	dx=abs(x1-x2);dy=abs(y1-y2);
	if(dy>dx)
	{
		swap(&x1,&y1);
		swap(&x2,&y2);
		swap(&dx,&dy);
		slopegt1=1;
	}
	if(x1>x2)
	{
		swap(&x1,&x2);
		swap(&y1,&y2);
	}
	if(y1>y2)
		incry=-1;
	else
		incry=1;
	d=2*dy-dx;
	incre=2*dy;
	incrne=2*(dy-dx);
	while(x1The post C Program to for Midpoint Line algorithm first appeared on Student Projects.

C program to for Moving Car

Editorial Team — Fri, 02 Oct 2009 09:17:14 +0000

#include
#include
#include
#include
#include

void main()
{
	int gd=DETECT,gm;
	int i=0,m=0;
	initgraph(&gd,&gm,"..\\bgi");
	while(!kbhit())
	{
		cleardevice();
		i++;
		if(i>getmaxx())
			i-=670;
		line(80+i,300,90+i,270);
		line(90+i,270,120+i,270);
		line(120+i,270,160+i,240);
		line(160+i,240,230+i,240);
		line(230+i,240,275+i,270);
		line(275+i,270,310+i,270);
		line(310+i,270,335+i,290);
		line(335+i,290,335+i,300);
		line(255+i,300,335+i,300);
		line(180+i,300,210+i,300);
		line(80+i,300,135+i,300);
		arc(232+i,300,0,180,23);
		arc(157+i,300,0,180,23);
		circle(232+i,300,18);
		circle(157+i,300,18);
		pieslice(232+i,300,0+m,90+m,18);
		pieslice(232+i,300,180+m,270+m,18);
		pieslice(157+i,300,0+m,90+m,18);
		pieslice(157+i,300,180+m,270+m,18);
		if(m<-360)
			m=90;
		m-=3;	
	delay(5);
	}
	getch();
	closegraph();
}

The post C program to for Moving Car first appeared on Student Projects.

C program to for Rotation of wheel

Editorial Team — Fri, 02 Oct 2009 09:01:17 +0000

#include
#include
#include
#include
#include

int xc=50,yc=200,r=35;
int x[15],y[15];
void drawcircles()
{
	setcolor(YELLOW);
	circle(xc,yc,r);
	circle(xc,yc,r+5);
}
void main()
{
	double angle=0,theta;
	int i,a;
	int gd=DETECT,gm;
	initgraph(&gd,&gm,"..\\bgi");
	a=xc+r;
	while(!kbhit())
	{
		while(a<=630)
		{
			theta=M_PI*angle/180;
			cleardevice();
			drawcircles();
			for(i=0;i<18;i++)
			{
				theta=M_PI*angle/180;
				x[i]=xc+r*cos(theta);
				y[i]=yc+r*sin(theta);
				angle+=20;
				line(xc,yc,x[i],y[i]);
			}
			angle+=2; xc+=2; a=xc+r;
			delay(50);
		}
		xc=50;	r=35; a=xc+r;
	}
	getch();
	closegraph();
}

The post C program to for Rotation of wheel first appeared on Student Projects.

C program to implement Spiral Model

Editorial Team — Fri, 02 Oct 2009 07:59:21 +0000

#include
#include
#include

void main()
{
	int r=5,n,i,x,y;
	int graphdriver = DETECT, graphmode;
	initgraph(&graphdriver, &graphmode, "..\\bgi");

	setcolor(YELLOW);
	printf("ENTER THE NUMBER OF RINGS IN THE SPIRAL MODEL\n");
	scanf("%d",&n);
	printf("Enter the origin point of the spiral");
	scanf("%d%d",&x,&y);
	clrscr();
	for(i=0;iThe post C program to implement Spiral Model first appeared on Student Projects.

C program to implement Bar Graph

Editorial Team — Fri, 02 Oct 2009 07:55:32 +0000

#include
#include
#include
#include
#include

void main()
{
	int i,n,a,b;
	void drawrect(int ,int);

	int graphdriver = DETECT, graphmode;
	initgraph(&graphdriver, &graphmode, "..\\bgi");

	setcolor(CYAN);
	printf("ENTER THE NUMBER OF DATA ELEMENTS\n");
	scanf("%d",&n);

	line(1,1,1,479);// Y axis
	line(1,479,640,479);// X axis

	for(i=1;i<=25;i++)
	{
		outtextxy(40*i,470,"|");
		outtextxy(1,479-40*i,"-");
	}

	printf("ENTER X AND Y CO-ORDINATES \n");
	for(i=1;i<=n;i++)
	{
		scanf("%d %d",&a,&b);
		b--;
		drawrect(a*40,b*40);
	}
	getch();
	closegraph();
}

void drawrect(int a,int b)
{
	 setfillstyle(SOLID_FILL,CYAN);
	 bar3d(a,478,a,430-b,5,1);
}

The post C program to implement Bar Graph first appeared on Student Projects.