ALGORITHM:

1) Start the process
2) Invoke the classes
3) Get the input for a,b,c;
4) Call the function getinfo() and display()
5) Check if a=0
a) True : compute c/b;
i) Print the value of a/c;
b) False: compute b*b-4*a*c;
i) If ( b*b-4*a*c)=0
ii) Call img();
iii) Otherwise : call real(a,b,c);
6) Stop the process

PROGRAM:

	#include
	#include
		class equation
		{
			private:float a,b,c;
			public: void getinfo(float  a, float b,float c );
				void display( );
				void equal(float  a, float b);
				void imag( );
				void real(float a,float b,float c);
		};
		void  equation :: getinfo(float aa,float bb,float cc)
		{
	                a=aa;
			b=bb;
		        c=cc;
		}
		void equation::display( )
		{
			cout<>aa>>bb>>cc;
			e.getinfo(aa,bb,cc);
			e.display( );
			if(aa = =0)
			{
				float temp;
				temp = cc/bb;
				cout<<” Linear Roots”<
OUTPUT:

	Enter the three numbers 2 4 1

	Roots are imaginary

	X1= - 0.292893

	X2= - 1.707107
The post C++ program for implementation of class first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-advanced/c-program-for-implementation-of-class/feed/
			0
		
		
			
		
		
		https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-implement-the-queue-adt-using-a-single-linked-list/
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-implement-the-queue-adt-using-a-single-linked-list/#comments
		
		
		Thu, 11 Mar 2010 14:05:19 +0000
				
		
		
		
		http://studentprojects.in/?p=1013

					/* Write C++ programs to implement the Queue ADT using a singly linked list */ #include #include #include using namespace std; class node { public: class node *next; int data; }; class queue : public node { node *head; int front,rare; public: queue() { front=-1; rare=-1; } void push(int x) { if (rare < 0

The post C++ program to implement the Queue ADT using a single linked list first appeared on Student Projects.
]]>
										/* Write C++ programs to implement the Queue ADT using a singly linked list */

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

class queue : public node
{
            node *head;
            int front,rare;
	public:
           queue()
           	{
            	front=-1;
             	rare=-1;
             }
           void push(int x)
           	{
            	if (rare < 0 )
             		{
               			head =new node;
                  		head->next=NULL;
                    	head->data=x;
                     	rare ++;
                     }
             else
                    {
                    	node *temp,*temp1;
                     	temp=head;
                      	if(rare >= 4)
                          {
                          	cout <<"queue over flow";
                           	return;
                           }
                        rare++;
                        while(temp->next != NULL)
                        	temp=temp->next;
                        temp1=new node;
                        temp->next=temp1;
                        temp1->next=NULL;
                        temp1->data=x;
                    }  }

           void display()
           	{
              node *temp;
              temp=head;
              if (rare < 0)
                {
                    cout <<" queue under flow";
                    return;
                 }
              while(temp != NULL)
               {
               	   cout <data<< " ";
                   temp=temp->next;
                }
             }
             void pop()
              {
              	node *temp;
               	temp=head;
                if( rare < 0)
                  {
                  	cout <<"queue under flow";
                   	return;
                   }
                if(front == rare)
                  {
                  	front = rare =-1;
                   	head=NULL;
                    return;
                   }
                front++;
                head=head->next;
                }
};
main()
{
	queue s1;
	int ch;
	while(1)
      {
		cout <<"\n1.PUSH\n2.POP\n3.DISPLAY\n4.EXIT\n enter ru choice:";
		cin >> ch;
		switch(ch)
		{
            case 1:
                 	cout <<"\n enter a element";
                  	cin >> ch;
                   	s1.push(ch); break;

            case 2: s1.pop();break;
            case 3: s1.display();break;
        	case 4: exit(0);
		  }
       }
return (0);
}

OUTPUT
1.PUSH 2.POP 3.DISPLAY 4.EXIT

 enter ru choice:1

 enter a element23
1.PUSH 2.POP 3.DISPLAY 4.EXIT

 enter ru choice:1

 enter a element54
1.PUSH 2.POP 3.DISPLAY 4.EXIT

 enter ru choice:3

23 54

1.PUSH 2.POP 3.DISPLAY 4.EXIT

 enter ru choice:2
1.PUSH 2.POP 3.DISPLAY 4.EXIT

 enter ru choice:2
1.PUSH 2.POP 3.DISPLAY 4.EXIT

 enter ru choice:2

queue under flow

1.PUSH 2.POP 3.DISPLAY 4.EXIT

 enter ru choice:4
The post C++ program to implement the Queue ADT using a single linked list first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-implement-the-queue-adt-using-a-single-linked-list/feed/
			9
		
		
			
		
		
		https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-perform-insert-delete-search-an-element-into-a-binary-search-tree/
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-perform-insert-delete-search-an-element-into-a-binary-search-tree/#comments
		
		
		Wed, 10 Mar 2010 15:14:15 +0000
				
		
		
		
		
		
		http://studentprojects.in/?p=995

					/* Write a C++ program to perform the following operations:

a) Insert an element into a binary search tree.

b) Delete an element from a binary search tree.

c) Search for a key element in a binary search tree. */

The post C++ program to perform Insert, Delete, Search an element into a binary search tree first appeared on Student Projects.
]]>
										/* Write a C++ Data structure program to perform the following operations:

a) Insert an element into a binary search tree.

b) Delete an element from a binary search tree.

c) for a key element in a binary search tree. */

#include
#include
#include
using namespace std;

void insert(int,int );
void delte(int);
void display(int);
int search(int);
int search1(int,int);
int tree[40],t=1,s,x,i;

main()
{
	int ch,y;
	for(i=1;i<40;i++)
	tree[i]=-1;
	while(1)
	{
cout <<"1.INSERT\n2.DELETE\n3.DISPLAY\n4.SEARCH\n5.EXIT\nEnter your choice:";
		cin >> ch;
		switch(ch)
		{
		case 1:
			cout <<"enter the element to insert";
			cin >> ch;
			insert(1,ch);
			break;
		case 2:
			cout <<"enter the element to delete";
			cin >>x;
			y=search(1);
			if(y!=-1) delte(y);
			else cout<<"no such element in tree";
			break;
		case 3:
			display(1);
			cout<<"\n";
			for(int i=0;i<=32;i++)
			cout <> x;
			y=search(1);
			if(y == -1) cout <<"no such element in tree";
			else cout <ch)
		tree[2*x]=ch;
	else
		tree[2*x+1]=ch;
	t++;
}
void delte(int x)
{
	if( tree[2*x]==-1 && tree[2*x+1]==-1)
		tree[x]=-1;
	else if(tree[2*x]==-1)
	      {	tree[x]=tree[2*x+1];
		tree[2*x+1]=-1;
	      }
	else if(tree[2*x+1]==-1)
	      {	tree[x]=tree[2*x];
		tree[2*x]=-1;
	      }
	else
	{
	  tree[x]=tree[2*x];
	  delte(2*x);
	}
	t--;
}

int search(int s)
{
if(t==1)
{
cout <<"no element in tree";
return -1;
}
if(tree[s]==-1)
return tree[s];
if(tree[s]>x)
search(2*s);
else if(tree[s] ch)
search1(2*s,ch);
else search1(2*s+1,ch);
}

OUTPUT

1.INSERT

2.DELETE

3.DISPLAY

4.SEARCH

5.EXIT

Enter your choice:3
no element in tree:

0123456789011121314151617181920212223242526272829303132
1.INSERT

2.DELETE

3.DISPLAY

4.SEARCH

5.EXIT

Enter your choice:1
Enter the element to insert 10

1.INSERT

2.DELETE

3.DISPLAY

4.SEARCH

5.EXIT

Enter your choice:4
Enter the element to search: 10

10 is in 1 position

1.INSERT

2.DELETE

3.DISPLAY

4.SEARCH

5.EXIT
Enter your choice:5
The post C++ program to perform Insert, Delete, Search an element into a binary search tree first appeared on Student Projects.
]]>
					
					https://studentprojects.in/software-development/cpp/cpp-programs/cpp-data-structure/c-program-to-perform-insert-delete-search-an-element-into-a-binary-search-tree/feed/
			7