class | Student Projects

C++ program to implement Heap sort Algorithm

Editorial Team — Tue, 01 Feb 2011 13:38:53 +0000

#include 
const int MAX = 10 ;
class array
{
	private :
		int arr[MAX] ;
		int count ;
	public :
		array( ) ;
		void add ( int num ) ;
		void makeheap(int ) ;
		void heapsort( ) ;
		void display( ) ;
} ;
array :: array( )
{
	count = 0 ;
	for ( int i = 0 ; i < MAX ; i++ )
		arr[MAX] = 0 ;
}
void array :: add ( int num )
{
	if ( count < MAX )
	{
		arr[count] = num ;
		count++ ;
	}
	else
		cout << "\nArray is full" << endl ;
}
void array :: makeheap(int c)
{

	for ( int i = 1 ; i < c ; i++ )
	{
		int val = arr[i] ;
		int s = i ;
		int f = ( s - 1 ) / 2 ;
		while ( s > 0 && arr[f] < val )
		{
			arr[s] = arr[f] ;
			s = f ;
			f = ( s - 1 ) / 2 ;
		}
		arr[s] = val ;
	}
}
void array :: heapsort( )
{
	for ( int i = count - 1 ; i > 0 ; i-- )
	{
		int ivalue = arr[i] ;
		arr[i] = arr[0] ;
		arr[0]=ivalue;
		makeheap(i);

	}
}
void array :: display( )
{
	for ( int i = 0 ; i < count ; i++ )
		cout << arr[i] << "\t" ;
	cout << endl ;
}
void main( )
{
	array a ;

	a.add ( 11 ) ;
	a.add ( 2 ) ;
	a.add ( 9 ) ;
	a.add ( 13 ) ;
	a.add ( 57 ) ;
	a.add ( 25 ) ;
	a.add ( 17 ) ;
	a.add ( 1 ) ;
	a.add ( 90 ) ;
	a.add ( 3  ) ;
	a.makeheap(10) ;
	cout << "\nHeap Sort.\n" ;
	cout << "\nBefore Sorting:\n"  ;
	a.display( ) ;
	a.heapsort( ) ;
	cout << "\nAfter Sorting:\n" ;
	a.display( ) ;
}

The post C++ program to implement Heap sort Algorithm first appeared on Student Projects.

C++ program to implement Quick sort Algorithm using class

Editorial Team — Tue, 01 Feb 2011 13:35:44 +0000

#include 
const int MAX = 10 ;
class array
{
	private :

		int arr[MAX] ;
		int count ;
	public :

		array( ) ;
		void add ( int item ) ;
		int getcount( ) ;
		static int split ( int *, int, int ) ;
		void quiksort ( int lower, int upper ) ;
		void display( ) ;
} ;
array :: array( )
{
	count = 0 ;
	for ( int i = 0 ; i < MAX ; i++ )
		arr[i] = 0 ;
}
void array :: add ( int item )
{
	if ( count < MAX )
	{
		arr[count] = item ;
		count++ ;
	}
	else
		cout << "\nArray is full" << endl ;
}
int array :: getcount( )
{
	return count ;
}
void array :: quiksort ( int lower, int upper )
{
	if ( upper > lower )
	{
		int i = split ( arr, lower, upper ) ;
		quiksort ( lower, i - 1 ) ;
		quiksort ( i + 1, upper ) ;
	}
}
int array :: split ( int *a, int lower, int upper )
{
	int i, p, q, t ;

	p = lower + 1 ;
	q = upper ;
	i = a[lower] ;
	while ( q >= p )
	{
		while ( a[p] < i )
			p++ ;
		while ( a[q] > i )
			q-- ;
		if ( q > p )
		{
			t = a[p] ;
			a[p] = a[q] ;
			a[q] = t ;
		}
	}
	t = a[lower] ;
	a[lower] = a[q] ;
	a[q] = t ;
	return q ;
}
void array :: display( )
{
	for ( int i = 0 ; i < count ; i++ )
		cout << arr[i] << "  " ;
	cout << endl ;
}
void main( )
{
	array a ;
	a.add ( 11 ) ;
	a.add ( 2 ) ;
	a.add ( 9 ) ;
	a.add ( 13 ) ;
	a.add ( 57 ) ;
	a.add ( 25 ) ;
	a.add ( 17 ) ;
	a.add ( 1 ) ;
	a.add ( 90 ) ;
	a.add ( 3 ) ;
	cout << "\nQuik sort.\n" ;
	cout << "\nArray before sorting:" << endl ;
	a.display( ) ;
	int c = a.getcount( ) ;
	a.quiksort ( 0, c - 1 ) ;
	cout << "\nArray after quick sorting:" << endl ;
	a.display( ) ;
}

The post C++ program to implement Quick sort Algorithm using class first appeared on Student Projects.

C++ rogram to implement merge sort

Editorial Team — Tue, 01 Feb 2011 13:34:06 +0000

#include 
const int MAX = 5 ;
class array
{
	private :
		int *a ;
		int size ;
		int count ;
	public :
		array( ) ;
		array ( int sz ) ;
		void add ( int num ) ;
		void display( ) ;
		void merge_sort(int low,int high);
		void merge(int low,int mid,int high);
		~array( ) ;
} ;
array :: array( )
{
	count = size = 0 ;
	a = NULL ;
}
array :: array( int sz )
{
	count = 0 ;
	size = sz ;
	a = new int[sz] ;
}
void array :: add ( int num )
{
	if ( count < size )
	{
		a[count] = num ;
		count++ ;
	}
	else
		cout << "\nArray is full" << endl ;
}
void array :: display( )
{
	for ( int i = 0 ; i < count ; i++ )
		cout << a[i] << "\t" ;
	cout << endl ;
}
void array :: merge_sort(int low,int high)
{

	int mid;
	if(lowmid)
	{
		for(k=j;k<=high;k++)
		{
			b[i]=a[k];
			i++;
		}
	}
	else
	{
		for(k=h;k<=mid;k++)
		{
			b[i]=a[k];
			i++;
		}
	}
	for(k=low;k<=high;k++) a[k]=b[k];
}
array :: ~array( )
{
	delete a ;
}

void main( )
{
	array a ( MAX ) ;

	a.add ( 11 ) ;
	a.add ( 2 ) ;
	a.add ( 9 ) ;
	a.add ( 13 ) ;
	a.add ( 57 ) ;

	cout << "\nMerge sort.\n" ;

	a.merge_sort (0,4) ;

	cout << "\nArray after sorting: " << endl ;
	a.display( ) ;
}

The post C++ rogram to implement merge sort first appeared on Student Projects.

C++ program to implement Insertion sort using class

Editorial Team — Tue, 01 Feb 2011 13:27:51 +0000

#include 
const int MAX = 10 ;
class array
{
	private :
		int arr[MAX] ;
		int count ;
	public :
		array( ) ;
		void add ( int item ) ;
		void sort( ) ;
		void display( ) ;
} ;
array :: array( )
{
	count = 0 ;
	for ( int i = 0 ; i < MAX ; i++ )
		arr[i] = 0 ;
}
void array :: add ( int item )
{
	if ( count < MAX )
	{
		arr[count] = item ;
		count++ ;
	}
	else
		cout << "\nArray is full" << endl ;
}
void array :: sort( )
{
	int temp ;
	for ( int i = 1 ; i <= count - 1 ; i++ )
	{
		for ( int j = 0 ; j < i ; j++ )
		{
			if ( arr[j] > arr[i] )
			{
				temp = arr[j] ;
				arr[j] = arr[i] ;
				for ( int k = i ; k > j ; k-- )
					arr[k] = arr[k - 1] ;
				arr[k + 1] = temp ;
			}
		}
	}
}

void array :: display( )
{
	for ( int i = 0 ; i < count ; i++ )
		cout << arr[i] << "\t" ;
	cout << endl ;
}
void main( )
{
	array a ;
	a.add ( 25 ) ;
	a.add ( 17 ) ;
	a.add ( 31 ) ;
	a.add ( 13 ) ;
	a.add ( 2 ) ;
	cout << "\nInsertion sort.\n" ;
	cout << "\nArray before sorting:" << endl ;
	a.display( ) ;
	a.sort( ) ;
	cout << "\nArray after insertion sorting:" << endl ;
	a.display( ) ;
}

The post C++ program to implement Insertion sort using class first appeared on Student Projects.

C++ program to implement Selection sort using class

Editorial Team — Tue, 01 Feb 2011 12:33:33 +0000

#include 
const int MAX = 10 ;
class array
{
	private :
		int arr[MAX] ;
		int count ;
	public :
		array( ) ;
		void add ( int item ) ;
		void sort( ) ;
		void display( ) ;
} ;
array :: array( )
{
	count = 0 ;
	for ( int i = 0 ; i < MAX ; i++ )
		arr[i] = 0 ;
}
void array :: add ( int item )
{
	if ( count < MAX )
	{
		arr[count] = item ;
		count++ ;
	}
	else
		cout << "\nArray is full" << endl ;
}
void array :: sort( )
{
	int temp ;
	for ( int i = 0 ; i <= count - 2 ; i++ )
	{
		for ( int j = i + 1 ; j <= count - 1 ; j++ )
		{
			if ( arr[i] > arr[j] )
			{
				temp = arr[i] ;
				arr[i] = arr[j] ;
				arr[j] = temp ;
			}
		}
	}
}
void array :: display( )
{
	for ( int i = 0 ; i < count ; i++ )
		cout << arr[i] << "  " ;
	cout << endl ;
}
void main( )
{
	array a ;
	a.add ( 25 ) ;
	a.add ( 17 ) ;
	a.add ( 31 ) ;
	a.add ( 13 ) ;
	a.add ( 2 ) ;
	cout << "\nSelection sort.\n" ;
	cout << "\nArray before sorting:" << endl ;
	a.display( ) ;
	a.sort( ) ;
	cout << "\nArray after selection sorting:" << endl ;
	a.display( ) ;
}

The post C++ program to implement Selection sort using class first appeared on Student Projects.

C++ program using class to generate mark sheet using multiple inheritance

Editorial Team — Sun, 04 Apr 2010 15:17:28 +0000

Using multiple inheritances, prepare a Student Mark sheet, class marks for every student in three subjects. The inherited class generates mark sheet.

#include
#include
#include
class student 
{
	int roll;
	char name[25];
	char add [25];
	char *city;
	public: student()
	{
		cout<<"welcome in the student information system"<>roll;
		cout<<"\n enter the student name";
		cin>>name;
		cout<<\n enter ther student address";
		cin>>add;
		cout<<"\n enter the student city";
		cin>>city;
	}
	void putdata()
	{
		cout<,"\n the student roll no:"<>sub1:
		cout<<"\n enter the marks2:";
		cin>>sub2;
		cout<<\n enter the marks3:";
		cin>>sub3;
	}
	void output()
	{
		putdata();
		cout<<"\n marks1:"<>ch;
		switch (ch)
		{
			case 1:
			m1.input();
			count++;
			break;
			
                        case2:
			m1.output();
			break;

			case3:
			m1.calculate();
			break;
		}
	} while (ch!=4);
}

The post C++ program using class to generate mark sheet using multiple inheritance first appeared on Student Projects.

C++ program using class to multiply by 10 to every member of a list

Editorial Team — Sun, 04 Apr 2010 13:19:02 +0000

Write a program using class which reads a list of N number of integer type in an array. It modifies the list by multiplying 10 to every number of the list. The modified list is displayed.

#include
#include
class array
{
 public: void readarray();
         void multiply();
};
void array::readarray()
{
	int a[10];
	cout<<"Enter the elements of the Array"<>a[i];
}
void array::multiply()
{
	int i,j,a[10],temp[10];
	for(i=0;i<=9;i++)
	{
		for(j=0;j<=9;j++)
		temp[i]=(a[i]*10);
	}
	cout<<"Result are as follows"<The post C++ program using class to multiply by 10 to every member of a list first appeared on Student Projects.

C++ program to illustrate Multilevel Inheritance

Editorial Team — Sat, 13 Mar 2010 15:02:27 +0000

MULTILEVEL INHERITANCE

AIM:
A program to illustrate multilevel inheritance. we have three classes, student, test and result. Here class student is the base class. And the class test is derived from the base class student. And the another class result is derived from the class test.

ALGORITHM:

• Start the process
• Invoke the base class student
• Invoke the derived class test which in inherited by the class student
• Invoke the derived class result which in inherited by the class test
• Create an object student1 for the result class
• Call student1.getno(),assign the value of rno in student class
• Call student1.getmarks(),assign the marks in test class
• Call student1.display(),for displaying the result
• Stop the process

PROGRAM

#include
#include
class student
{
   		protected:
   		int rno;
   		public:
   		void getno(int);
   		void putno(void);
};
void student::getno(int a)
{
rno=a;
}
void student ::putno()
{
cout<<"rollno="<C++ program to illustrate Multilevel Inheritance first appeared on Student Projects.

C++ program to illustrate a Single Inheritance

Editorial Team — Sat, 13 Mar 2010 14:26:41 +0000

SINGLE INHERITANCE

AIM:
A program to illustrate a single inheritance. We have a base class B and a derived class D. The class B contains one private data member, one public data member and three public member functions. The class D contains one private data member and two public member functions

ALGORITHAM:

• Start the process
• Invoke the base class B
• Invoke the derived class D using public derivation
• Get the input data
• Display the inputted data
• Call the derived classes member functions
o Assign a new value for base classes data member
• Display the outputs
• Stop the process

PROGRAM

#include
#include
class B
{
int a;
public:
int b;
void get_ab();
int get_a();
void show_a();
};
class D: private B
{
int c;
public:
void mul();
void display();
};
void B::get_ab()
{
cout<<"Enter Values for a and b";
cin>>a>>b;
}
int B::get_a()
{
return a;
}
void B::show_a(){
			cout<<"a= "<
OUTPUT
A=5

A=5

B=10

C=50
A=5

B=20

C=100
The post C++ program to illustrate a Single Inheritance first appeared on Student Projects.

Java program using String Tokenizer class

Editorial Team — Fri, 02 Oct 2009 15:48:08 +0000

Write a Java program that reads a line of integers and displays each integer and sum of all integers using String Tokenizer class

import java.util.StringTokenizer;
import java.util.Scanner;
class tokens
{
	public static void main(String[] args)
	{
		Scanner input=new Scanner(System.in);
		String sentence=input.nextLine();
		String temp;
		int k,total=0;
		StringTokenizer s1=new StringTokenizer(sentence);
		System.out.println("Total Number of tokens:"+s1.countTokens());
		while(s1.hasMoreTokens())
		{
			temp=s1.nextToken();
			k=Integer.parseInt(temp);
			total+=k;
			System.out.print(k+"\t");
		}
		System.out.println("Sum of tokens :"+total);
	}
}

Output:

12 43 78 98
Total Number of tokens:4
12 43 78 98
Sum of tokens : 231

123 456 798
Total number of tokens:3
123 456 798
Sum of tokens:1377

The post Java program using String Tokenizer class first appeared on Student Projects.