//person class which is derived in student’s class and teacher’s class#include<iostream.h>#include<conio.h>#include<stdio.h>class person{char name[50];int age;int dob;char add[100];protected:void in(){cout<<"Name ";gets(name);cout<<"Age ";cin>>age;cout<<"DOB ";cin>>dob;cout<<"Address ";gets(add);}void out(){cout<<"\n\nName "<<name;cout<<"\nAge "<<age;cout<<"\nDOB "<<dob;cout<<"\nAddress "<<add;}};class student :private person{long int rno,clss,fees;public:void input(){in();cout<<"Roll no ";cin>>rno;cout<<"Class ";cin>>clss;cout<<"Fees ";cin>>fees;}void output(){out();cout<<"\nRoll no "<<rno;cout<<"\nclass "<<clss;cout<<"\nFees "<<fees;}} ;class teacher :private person{long int id,salary;char sub[40];public:void input(){in();cout<<"Teacher Id ";cin>>id;cout<<"Salary ";cin>>salary;cout<<"subject ";gets(sub);}

void output(){out();cout<<"\nTeacher Id "<<id;cout<<"\nSalary "<<salary;cout<<"\nSubject "<<sub;}

};void main(){clrscr();char choice;cout<<"Student or teacher(s/t) ";cin>>choice;if(choice=='s'){student s1;s1.input();s1.output();}else{teacher s1;s1.input();s1.output();}getch();}

//employee class which is derived in manager’s class#include<iostream.h>#include<conio.h>#include<stdio.h>class emp{char name[50];unsigned long enumb;protected:public:void in(){cout<<"Name ";gets(name);cout<<"Employee Number ";cin>>enumb;}void out(){cout<<"\nName "<<name;cout<<"\nEmployee Number "<<enumb;cout<<"\nBasic Salary "<<bas;}protected:float bas;void getbas(){cout<<"Enter Basic: ";cin>>bas;}};class man :public emp{private:char tit[50];public:void input(){in();getbas();cout<<"Enter Title ";gets(tit);}void output(){out();cout<<"\nTitle "<<tit<<"\n";}} ;void main(){clrscr();man m1,m2;cout<<"Manager 1\n";m1.input();cout<<"Manager 2\n";m2.input();cout<<"\nManager 1 Details";m1.output();cout<<"\nManager 2 Details";m2.output();

getch();}

//Program to explain the concept of pointers#include<iostream.h>#include<stdlib.h>#include<conio.h>void main(){clrscr();int a[]={12,23,34,45};int *ptr=a;int val=*ptr; cout<<val<<endl;val=*ptr++; cout<<val<<endl;val=*ptr; cout<<val<<endl;val=*++ptr; cout<<val<<endl;val=++*ptr; cout<<val<<endl;getch();}

//Program to explain the concept of pointers#include<iostream.h>#include<stdlib.h>#include<conio.h>void main(){clrscr();int m=5,n=6;int *p1,*p2,**q;p1=&n; p2=&n; q=&p1;cout<<m<<" "<<n<<" "<<*p1<<" "<<*p2<<" "<<**q<<endl;*q=&m;cout<<m<<" "<<n<<" "<<*p1<<" "<<*p2<<" "<<**q<<endl;**q=12;cout<<m<<" "<<n<<" "<<*p1<<" "<<*p2<<" "<<**q<<endl;m=24; n=36;cout<<m<<" "<<n<<" "<<*p1<<" "<<*p2<<" "<<**q<<endl;q=&p2;cout<<m<<" "<<n<<" "<<*p1<<" "<<*p2<<" "<<**q<<endl;**q=48;cout<<m<<" "<<n<<" "<<*p1<<" "<<*p2<<" "<<**q<<endl;m=60; n=72;cout<<m<<" "<<n<<" "<<*p1<<" "<<*p2<<" "<<**q<<endl;getch();}

//Insertion in an array#include"ayush.h"void main(){clrscr();int a[20],x,size,pos;cout<<"Enter the size of the array ";cin>>size;for(int i=0;i<size;i++){cin>>a[i];}cout<<"Enter the element to be inserted ";cin>>x;if(x<a[0])pos=0;else{for(i=0;i<size;i++){if((a[i]<=x)&&(x<a[i+1])){pos=i+1;break;}}if(i==size-1)pos=size;}for(i=size;i>pos;i--){a[i]=a[i-1];}a[pos]=x;size+=1;for(i=0;i<size;i++){cout<<a[i]<<endl;}getch();}

//Binary Search#include"ayush.h"void main(){clrscr();int a[50],k=0,beg,mid,end,x;int size;cout<<"Enter the Size ";cin>>size;for(int i=0;i<size;i++)cin>>a[i];cout<<"Enter the element to be searched ";cin>>x;beg=0;end=size-1;while(beg<=end){mid=(beg+end)/2;if(x==a[mid]){k=1;cout<<"\n\n\nfound at position "<<mid+1;break;}else if(x>mid){beg=mid+1;}else{end=mid-1;}}if(k==0){cout<<"\n\n\nNot Found";}getch();}

//Bubble sort#include<iostream.h>#include<conio.h>#include<stdio.h>void main(){clrscr();int a[50],size,pos,temp;cout<<"Size of the Array ";cin>>size;for(int i=0;i<size;i++){cin>>a[i];}for(i=0;i<size;i++){for(int j=0;j<size-1;j++){if(a[j]>a[j+1]){temp=a[j+1];a[j+1]=a[j];a[j]=temp;}}}cout<<"New array\n";for(i=0;i<size;i++){cout<<a[i]<<endl;}

getch();}

//Insertion sort#include<iostream.h>#include<conio.h>#include<stdio.h>#include<limits.h>void main(){clrscr();int a[50],size,temp,j;cout<<"Enter the size ";cin>>size;for(int i=1;i<=size;i++){cin>>a[i];}a[0]=INT_MIN;for(i=1;i<=size;i++){temp=a[i];j=i-1;while(temp<a[j]){a[j+1]=a[j];j--;}a[j+1]=temp;}cout<<"New array\n";for(i=1;i<=size;i++){cout<<a[i]<<endl;}getch();}

//Selection sort#include<iostream.h>#include<conio.h>#include<stdio.h>void main(){clrscr();int a[10],size,pos,sml,temp;cout<<"Enter the Size ";cin>>size;for(int i=0;i<size;i++){cin>>a[i];}for(i=0;i<size;i++){sml=a[i];pos=i;for(int j=i+1;j<size;j++){if(a[j]<a[i]){sml=a[j];pos=j;}}temp=a[i];a[i]=a[pos];a[pos]=temp;}cout<<"New array\n";for(i=0;i<size;i++){cout<<a[i]<<endl;}getch();}

//Linear search#include<iostream.h>#include<stdio.h>#include<conio.h>void main(){clrscr();int size,a[20],x,b=0;cout<<"Enter the size ";cin>>size;for(int i=0;i<size;i++){cin>>a[i];}cout<<"Enter the element to be searched ";cin>>x;for(i=0;i<size;i++){if(x==a[i]){b=1;cout<<"\n\nfound at position "<<i+1;}}if(b==0){cout<<"\nNot found";}getch();}

//Deletion in an array#include<iostream.h>#include<conio.h>#include<stdio.h>void main(){clrscr();int a[50],x,pos,size;cout<<"Enter The size ";cin>>size;for(int i=0;i<size;i++)cin>>a[i];cout<<"Enter The element to be deleted ";cin>>x;int k=0;for(i=0;i<size;i++){if(a[i]==x){k=1;pos=i;}}if(k==0)cout<<"Not found\n";else{for(i=pos;i<size;i++){a[i]=a[i+1];}cout<<"New array"<<endl;for(i=0;i<size-1;i++)cout<<a[i]<<endl;}getch();}

//program to explain Linked list#include<iostream.h>#include<conio.h>#include<process.h>struct node{int info;node*next;}*start,*newptr,*save,*ptr,*rear;node *create_node(int a){ptr=new node;ptr->info=a;ptr->next=NULL;return ptr;}void insert_end(node*np){if(start==NULL){start=rear=np;}else{rear->next=np;rear=np;}}void insert_beg(node*np){if(start==NULL){start=np;}else{

save=start;start=np;np->next=save;}}void display(node*np){while(np!=NULL){cout<<np->info<<"->";np=np->next;}}void delete_node(){if(start==NULL){cout<<"Underflow!!";}else{ptr=start;start=start->next;delete ptr;}}int j;void disp(){cout<<"1.Insert at beginning ";cout<<endl<<"2.Insert at end ";cout<<endl<<"3.Delete ";cout<<endl<<"4.Insert specified "<<endl;cout<<"Enter your choice ";cin>>j;}void main(){clrscr();start=NULL;rear=NULL;char c='y';disp();int a;if(j==1){while(c=='y'){cin>>a;newptr=create_node(a);if(newptr!=NULL){cout<<"\nNode created ";getch();}else{cout<<"Cannot create node";exit(0);}cout<<" Inserting node at beginning";getch();insert_beg(newptr);cout<<endl<<"Now the list is:" ;cout<<endl;display(start);cout<<endl<<endl<<"Enter y or n ";

cin>>c;}if(c=='n'){getch();clrscr();cout<<endl<<"Now the list is ";display(start);cout<<endl;disp();}}if(j==2){while(c=='y'){cout<<"Enter value:";cin>>a;newptr=create_node(a);if(newptr!=NULL){cout<<"\n Node created";getch();}else{cout<<"Cannot create node"; getch();exit(0);}cout<<" Inserting node at end";getch();insert_end(newptr);cout<<endl<<"Now the list is:"<<endl;display(start);cout<<endl<<endl<<"Enter y or n ";cin>>c;}if(c=='n'){getch();clrscr();cout<<endl<<"Now the list is ";display(start);cout<<endl;disp();}}if(j==3){char k;cout<<" Want to delete first node(y/n)? ";cin>>k;if(k=='y'){do{delete_node();cout<<endl;display(start);cout<<endl;cout<<"Want to delete first node(y/n)? ";cin>>k;}while(k=='y');}}if(j==4){

int q=0;int l;cout<<"Enter node info";cin>>a;cout<<"Enter value";cin>>l;newptr=create_node(l);ptr=start;while(ptr->next!=NULL){if(ptr->info==a){q=1;newptr->next=ptr->next;ptr->next=newptr;break;}ptr=ptr->next;}if(q==0){cout<<"Node info not found";getch();disp();}elsedisplay(start);}getch();}

//Program to explain the concepts of matrices#include<iostream.h>#include<conio.h>void main(){clrscr();int r1,r2,c1,c2,c[50][50],a[50][50],b[50][50],ch1,ch2;cout<<"enter the row of first matrice ";cin>>r1;cout<<"enter the coloumns of first matrice ";cin>>c1;for(int i=0;i<r1;i++){for(int j=0;j<c1;j++)cin>>a[i][j];}cout<<"enter the row of second matrice ";cin>>r2;cout<<"enter the coloumns of second matrice ";cin>>c2;for(i=0;i<r2;i++){for(int j=0;j<c2;j++)cin>>b[i][j];}cout<<"Choose operations\n1.Addition\n2.subtraction\n3.Multiplication\n";cin>>ch1;if(ch1==1) { cout<<"\nAddition of matrices\n\n"; for(i=0;i<r1;i++) { for(int j=0;j<c1;j++) c[i][j]=a[i][j]+b[i][j]; }

for(i=0;i<r1;i++) { for(int j=0;j<c1;j++) cout<<c[i][j]<<" "; cout<<endl; } }else if(ch1==2) { cout<<"\nSubtraction of matrices\n\n"; for(i=0;i<r1;i++) { for(int j=0;j<c1;j++) c[i][j]=a[i][j]-b[i][j]; } for(i=0;i<r1;i++) { for(int j=0;j<c1;j++) cout<<c[i][j]<<" "; cout<<endl; } }else if(ch1==3) { cout<<"\nMultiplication of matrices\n\n"; for(i=0;i<r1;i++) { for(int j=0;j<c2;j++) { c[i][j]=0; for(int k=0;k<c1;k++) c[i][j]+=(a[i][k]*b[k][j]); } } for(i=0;i<r1;i++) { for(int j=0;j<c2;j++) cout<<c[i][j]<<" "; cout<<endl; } }getch(); }

//program to explain the concept of stacks#include<iostream.h>#include<conio.h>#include<process.h>int push(int a[],int &top,int e){if(top==39) return -1;else{top++;a[top]=e;}return 0;}void display(int a[],int top){cout<<a[top]<<endl;for(int i=top-1;i>=0;i--)cout<<a[i]<<endl;}void main(){clrscr();int a[40],n,top=-1;char c='y';while(c=='y'){cout<<"Enter element: ";cin>>n;int r=push(a,top,n);if(r==-1)exit(0);cout<<endl<<"The stack now is: "<<endl;

display(a,top);cout<<"Want to enter more elements? ";cin>>c;}getch();}