Advanced programs | Student Projects

Program to implement Kruskal algorithm in c++

surbhi — Tue, 24 May 2022 08:55:07 +0000

// kruskal minimum spanning tree
#include

#include

//structure for graph

struct str {
  int edge, n1, n2;
}
s0[20], s1[20];

//structure for checking nodes

struct st {
  int val, flag;
}
s2[20];

void input();
void filter();
void sort();
void min();
void update(int, int, int);

int n, e, cnt = 0, Tcost = 0;
int link[10][10];

void main() {
  clrscr();
  input();
  cout << “this is filtered output\ n”;
  filter();
  cout << “this is sorted output\ n”;
  sort();
  min();
  cout << “\nTcost is“ << Tcost;
  getch();
}

void input() {
  cout << “enter no.of nodes and edges\ n”;
  cin >> n >> e;
  cout << “enter input
  for upper triangle matrix\ n”;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (i != j && j > i) {
        cout << “enter link of node“ << i << ”to node“ << j << endl;
        cin >> link[i][j];
      } else {
        if (i == j)
          link[i][j] = 0;
        else
          link[i][j] = link[j][i];
      }
    }
  }
}

int k = 0, count = 0;

void filter() {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (link[i][j] != 0) {
        s0[k].edge = link[i][j];
        s0[k].n1 = i;
        s0[k].n2 = j;
        k++;
        count++;
      }
    }
  }
  i = 0;
  int j = 0;
  int flag = 1;
  for (int l = 0; l < count; l++) {
    if (i == 0) {
      s1[j].edge = s0[i].edge;
      s1[j].n1 = s0[i].n1;
      s1[j].n2 = s0[i].n2;
      i++;
      j++;
    } else {
      k = 0;
      while (k < j) {
        if (s1[k].edge == s0[i].edge && s1[k].n1 == s0[i].n2 && s1[k].n2 == s0[i].n1) {
          flag = 0;
          break;
        } else
          k++;
      }
      if (flag) {
        s1[j].edge = s0[i].edge;
        s1[j].n1 = s0[i].n1;
        s1[j].n2 = s0[i].n2;
        i++;
        j++;
        cnt++;
      } else {
        i++;
        flag = 1;
      }
    }
  }
  for (i = 0; i <= cnt; i++)
    cout << s1[i].edge << “\t” << s1[i].n1 << “\t” << s1[i].n2 << endl;
}

void sort() {
  for (int i = 0; i <= cnt - 1; i++) {
    for (int j = 0; j <= cnt - i - 1; j++) {
      if (s1[j].edge > s1[j + 1].edge) {
        int t = s1[j].edge;
        s1[j].edge = s1[j + 1].edge;
        s1[j + 1].edge = t;

        int t1 = s1[j].n1;
        s1[j].n1 = s1[j + 1].n1;
        s1[j + 1].n1 = t1;

        int t2 = s1[j].n2;
        s1[j].n2 = s1[j + 1].n2;
        s1[j + 1].n2 = t2;
      }
    }
  }
  for (i = 0; i < cnt; i++)
    cout << s1[i].edge << “\t” << s1[i].n1 << “\t” << s1[i].n2 << endl;

}

void min() {

  //initialize s2 structure

  for (int i = 0; i < n; i++) {
    s2[i].val = i;
    s2[i].flag = i + 1;
  }

  int u, v, y, z;
  int cur = n;

  for (i = 0; i < e; i++) {
    y = s1[i].n1;
    z = s1[i].n2;
    //cout<<“y & z “< ” << z;
    }
    cur = cur + 1;
    update(y, z, cur);
  }
}

void update(int y, int z, int cur) {
  for (int i = 0; i < n; i++) {
    if (i != y) {
      if (s2[y].flag == s2[i].flag)
        s2[i].flag = cur;
    }

    if (i != z) {
      if (s2[z].flag == s2[i].flag)
        s2[i].flag = cur;
    }
  }
  s2[y].flag = cur;
  s2[z].flag = cur;
}

The post Program to implement Kruskal algorithm in c++ first appeared on Student Projects.

How to multiply a number by 7 without using * and + operator

Chitra — Tue, 12 Apr 2022 13:41:06 +0000

NewNum = Num << 3; // multiplied by 2 ^ 3 = 8

	NewNum = NewNum - Num; // 8 – 1 = 7

The post How to multiply a number by 7 without using * and + operator first appeared on Student Projects.

Palindrome checking using function overloading

sathish kumar — Wed, 17 Apr 2013 06:36:42 +0000

#include "iostream"
using namespace std;
#include "conio.h"
#include "string.h"
class func
{
	public:
		void pal(int );
		void pal(char c[]);
};
void func :: pal(int n)
{
	int n1,sum,a;
	n1=n;
	sum=0;

	do
	{
		sum=sum*10;
		a=n%10;
		sum=sum+a;
		n=n/10;
	}while(n>0);
	if(sum==n1)
		cout<<"\n it is Palindrom";
	else
		cout<<"\n it is not a palindrom";

}
void func :: pal(char c[])
{
	int l=strlen(c);
	char b[10];
	int i,j;
	for(i=0,j=l-1;i>r;
		switch(r)
		{
			case 1:
				cout<<"Enter the number";
				cin>>k;
				p.pal(k);
				break;

			case 2:
				cout<<"\nEnter the string to be checked"<>c;
				p.pal(c);
				break;
		}
		cout<<"\ndo you want to continue? (1/0)"<>v;
	}while(v==1);
	getch();
}

The post Palindrome checking using function overloading first appeared on Student Projects.

Find the Area of shapes using function overloading

sathish kumar — Wed, 17 Apr 2013 06:07:48 +0000

Here is a program which will find the Area of shapes using function overloading.

#include "iostream"
#include "conio.h"
using namespace std;
class measure
{
	public:
		void shape(int r);
		void shape(int l,int b);
		void shape(float t,int d,int e);
		void shape(long a);
		void shape(float c, long int g);
		void shape(double j);
		void shape(float h, double f);
};
void measure::shape(int r)
{
	cout<<"area of the circle is "<<3.14*r*r;
}
void measure::shape(int l,int b)
{
	cout<<"area of the rectangle is"<>ch;
	switch(ch)
	{
		case 1:
			cout<<"enter the value of radius of the circle \n";
			cin>>r;
			obj.shape(r);
			break;
		case 2:
			cout<<"enter the sides of rectangle \n";
			cin>>l>>b;
			obj.shape(l,b);
			break;
		case 3:
			cout<<"enter the sides of triangle \n";
			cin>>d>>e;
			obj.shape(0.5,d,e);
			break;
		case 4:
			cout<<"enter the sides of square";
			cin>>a;
			obj.shape(a);
			break;
		case 5:
			cout<<"\nEnter the radius of the cone";
			cin>>c;
			cout<<"\nEnter the height of the cone";
			cin>>g;
			obj.shape(c,g);
			break;
		case 6:
			cout<<"\nEnter the radius";
			cin>>b;
			obj.shape(b);
			break;
		case 7:
			cout<<"\nEnter the radius";
			cin>>f;
			cout<<"\nEnter the height";
			cin>>h;
			obj.shape(h,f);
			break;
		default:
			cout<<"\nThe choice entered is a wrong choice";
	}
	getch();
}

The post Find the Area of shapes using function overloading first appeared on Student Projects.

C++ program to implement circular queue using array

Editorial Team — Wed, 02 Feb 2011 12:16:03 +0000

#include 
class cqueue
{
	private :
		int *arr ;
		int front, rear ;
		int MAX;
	public :
		cqueue( int maxsize = 10 ) ;
		void addq ( int item ) ;
		int delq( ) ;
		void display( ) ;
} ;
cqueue :: cqueue( int maxsize )
{
	MAX = maxsize ;
	arr = new int [ MAX ];
	front = rear = -1 ;
	for ( int i = 0 ; i < MAX ; i++ )
		arr[i] = 0 ;
}
void cqueue :: addq ( int item )
{
	if ( ( rear + 1 ) % MAX == front )
	{
		cout << "\nQueue is full" ;
		return ;
	}
	rear = ( rear + 1 ) % MAX;
	arr[rear] = item ;
	if ( front == -1 )
		front = 0 ;
}
int cqueue :: delq( )
{
	int data ;
	if ( front == -1 )
	{
		cout << "\nQueue is empty" ;
		return NULL ;
	}

	data = arr[front] ;
	arr[front] = 0 ;
	if ( front == rear )
	{
		front = -1 ;
		rear = -1 ;
	}
	else
		front = ( front + 1 ) % MAX;
	return data ;
}
void cqueue :: display( )
{
	cout << endl ;
	for ( int i = 0 ; i < MAX ; i++ )
		cout << arr[i] << "  " ;
	cout << endl ;
}
void main( )
{
	cqueue a ( 10 ) ;
	a.addq ( 14 ) ;
	a.addq ( 22 ) ;
	a.addq ( 13 ) ;
	a.addq ( -6 ) ;
	a.addq ( 25 ) ;
	cout << "\nElements in the circular queue: " ;
	a.display( ) ;
	int i = a.delq( ) ;
	cout << "Item deleted: " << i ;
	i = a.delq( ) ;
	cout << "\nItem deleted: " << i ;
	cout << "\nElements in the circular queue after deletion: " ;
	a.display( ) ;
	a.addq ( 21 ) ;
	a.addq ( 17 ) ;
	a.addq ( 18 ) ;
	a.addq ( 9 ) ;
	a.addq ( 20 ) ;
	cout << "Elements in the circular queue after addition: " ;
	a.display( ) ;
	a.addq ( 32 ) ;
	cout << "Elements in the circular queue after addition: " ;
	a.display( ) ;
}

The post C++ program to implement circular queue using array first appeared on Student Projects.

Program to implement Binary Search Algorithm

Editorial Team — Tue, 01 Feb 2011 11:44:15 +0000

#include 
template
int binarySearch(T a[], int n, T& x)
{
	int left = 0;                       // left end of segment
	int right = n - 1;                  // right end of segment
	while (left <= right)
	{
		int middle = (left + right)/2;   // middle of segment
		if (x == a[middle]) return middle;
		if (x > a[middle]) left = middle + 1;
		else right = middle - 1;
	}
	return -1; // x not found
}
int main()
{
	int a[10],n,t;
	cout<<"Enter the size:";
	cin>>n;
	cout<<"enter the elements in sorted order:";
	for(int i=0;i>a[i];
	cout<<"enter the element to search:";
	cin>>t;
	int f=binarySearch(a,n,t);
	if(f==-1)
		cout<<"element not found";
	else
		cout<<"element found at index:"<The post Program to implement Binary Search Algorithm first appeared on Student Projects.

C++ programs to implement Graph Traversal Techniques – Depth First Search/Breadth First Search

Editorial Team — Mon, 31 Jan 2011 12:38:55 +0000

a)Program to implement Breadth first Search algorithm.

#include
#include
#include
int cost[10][10],i,j,k,n,queue[10],front,rear,v,visit[10],visited[10];
void main()
{
	int m;
	clrscr();
	cout <<"enterno of vertices";
	cin >> n;
	cout <<"ente no of edges";
	cin >> m;
	cout <<"\nEDGES \n";
	for(k=1;k<=m;k++)
	{
		cin >>i>>j;
		cost[i][j]=1;
	}
	cout <<"enter initial vertex";
	cin >>v;
	cout <<"Visitied vertices\n";
	cout << v;
	visited[v]=1;
	k=1;
	while(k
b)Program to implement Depth First Search Algorithm.
#include
#include
#include
int cost[10][10],i,j,k,n,stack[10],top,v,visit[10],visited[10];
void main()
{
	int m;
	cout <<"enterno of vertices";
	cin >> n;
	cout <<"ente no of edges";
	cin >> m;
	cout <<"\nEDGES \n";
	for(k=1;k<=m;k++)
	{
		cin >>i>>j;
		cost[i][j]=1;
	}
	cout <<"enter initial vertex";
	cin >>v;
	cout <<"ORDER OF VISITED VERTICES";
	cout << v <<" ";
	visited[v]=1;
	k=1;
	while(k=1;j--)
			if(cost[v][j]!=0 && visited[j]!=1 && visit[j]!=1)
			{
				visit[j]=1;
				stack [top]=j;
				top++;
			}
		v= stack [--top];
		cout<The post C++ programs to implement Graph Traversal Techniques – Depth First Search/Breadth First Search first appeared on Student Projects.

Program to implement Linear Search algorithm

Editorial Team — Sun, 30 Jan 2011 11:41:44 +0000

#include
#include
void read(int a[10],int n)
{
	cout<<"reading\n";
	for(int i=0;i>a[i];
}
void display(int a[10],int n)
{
	for(int i=0;i>k;
	for(int i=0;i>n;
	linearsearch(a,n);
	getch();
}

The post Program to implement Linear Search algorithm 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++ class program to perform complex arithmetic using operator overloading

Editorial Team — Sun, 04 Apr 2010 14:04:26 +0000

Write a program to perform complex arithmetic using operator overloading

#include
#include
#include
#include
class complex
{
	int real;
	float image;
	public:
	void getdata()
	{
		cout<<"\n enter the real part of the complex";
		cin>>real;
		cout<<"\n enter the imaginary part of the complex";
		cin>>image;
	}
	void operator + (complex);
	void operator - (complex);
};

void complex :: operator +  (complex c1)
{
	complex temp;
	temp.real=real+c1.real;
	temp.image=image+c1.image;
	if (temp.image>=0);
	{
		cout<<"\n complex no. after addition:";
		cout<=0)
	{
		cout<<"\n complex no. after subtraction";
		cout<<"\n temp.real<<"+"<>n;
		switch(n)

		{ 
			 case1:
			 cout<The post C++ class program to perform complex arithmetic using operator overloading first appeared on Student Projects.