CODING DATA STRUCTURE

SINGLE LINKED LST

2012-03-26T05:49:00.001-07:00

codingdatastructure.blogspot.com

//Insertion and Deletion in Single Linked List

#include<conio.h>

#include<stdio.h>

#include<stdlib.h>

#include<alloc.h>

struct sll

{int info;sll*next;};

sll *create(sll**sl)

{*sl=NULL;return *sl;}

sll*alloc()

{return (sll*)malloc(sizeof(sll));}

void insert(sll**sl,int loc,int item)

{sll* temp,*ptr;

ptr=alloc();

ptr=*sl;

temp=alloc();

temp->info=item;

if(*sl==NULL)

{temp->next=NULL;(*sl)=temp;}

else if(loc==0)

{temp->next=(*sl);(*sl)=temp;}

else if(loc==-1)

{while(ptr->next!=NULL)

{ptr=ptr->next; }

temp->next=NULL;

ptr->next=temp;

}

else{for(int i=1;i<loc;i++)

ptr=ptr->next;

temp->next=ptr->next;

ptr->next=temp;

}

int deletion(sll**sl,int loc)

{sll*temp,*ptr; int c; temp=alloc();

ptr=alloc();ptr=*sl ;

if(*sl==NULL)

{printf("sll is empty");getch();exit(0);}

if(loc==0)

{c=(*sl)->info;*sl=(*sl)->next;}

else if(loc==-1)

{while(ptr->next->next!=NULL)

ptr=ptr->next;

c=ptr->next->info;

ptr->next=NULL;

}

else

{ for(int i=1;i<loc;i++)

{ptr=ptr->next;}

temp=ptr->next;

c=temp->info;

ptr->next=temp->next;

}return c;

}

void display(sll**sl)

{printf("\n");sll*temp;temp=alloc();temp=*sl;

while(temp!=NULL)

{printf("%d",temp->info);temp =temp->next;}

}

void main()

{clrscr();

sll*s;int r;s=create(&s);

//loc=0 =>beg,loc=-1 =>last,loc=n => after nth node(n=1,2..)

insert(&s,0,4);display(&s); //loc=0

insert(&s,0,5) ;display(&s); //loc=0

insert(&s,-1,8);display(&s); //loc=-1

insert(&s,0,9);display(&s); //loc=0

insert(&s,2,10);display(&s); //loc=2

r=deletion(&s,0);printf("\nDeleted element %d",r);//loc=0

r=deletion(&s,1);printf("\nDeleted element %d",r);//loc=1

getch();

}

ADT_BINARY SEARCH TREE

2012-03-26T05:42:00.001-07:00

codingdatastructure.blogspot.com

#include<stdio.h>

#include<conio.h>

#include<alloc.h>

#include<process.h>

struct node

{node *left,*right;

int info;

};

node *create(node* *r)

{(*r)=NULL; return (*r);}

node *alloc()

{return (node*) malloc(sizeof(node));}

void in_traverse(node **r)

{if(*r!=NULL)

{in_traverse(&(*r)->left);

printf(" %d-> ",(*r)->info);

in_traverse(&(*r)->right);}

}

void pre_traverse(node **r)

{if((*r)!=NULL)

{printf(" %d->",(*r)->info);

pre_traverse(&(*r)->left);

pre_traverse(&(*r)->right);}

}

void post_traverse(node **r)

{if((*r)!=NULL)

{post_traverse(&(*r)->left);

post_traverse(&(*r)->right);

printf(" %d->",(*r)->info);}

}

void preorder(node**r)

{node*stack[20],*ptr;

int top=0;

stack[top]=NULL;

ptr=(*r);

while(ptr!=NULL)

{ printf(" %d->",ptr->info);

if(ptr->right!=NULL)

{ top++; stack[top]=ptr->right;}

if(ptr->left!=NULL)

ptr=ptr->left;

else

{ ptr=stack[top]; top--;}

}

void inorder(node**r)

{node*stack[20],*ptr; int top=0;

stack[top]=NULL; ptr=(*r);

again:while(ptr!=NULL)

{top++; stack[top]=ptr; ptr=ptr->left;}

ptr=stack[top];top--;

while(ptr!=NULL)

{printf(" %d->",ptr->info);

if(ptr->right!=NULL)

{ptr=ptr->right;

goto again;

}

ptr=stack[top];top--;

}

typedef struct

{node*pr;

char status;

}pnode;

pnode *alloc1()

{return (pnode*)malloc(sizeof(pnode));}

void postorder(node**r)

{pnode*stack[20],*temp,*myptr=NULL; int top=0;

node*ptr=NULL; stack[top]=NULL; ptr=(*r);

again: while(ptr!=NULL)

{top++; temp=alloc1();

temp->pr=ptr;

temp->status='p';

stack[top]=temp;

if(ptr->right!=NULL)

{top++; temp=alloc1();

temp->pr=ptr->right;

temp->status='n';

stack[top]=temp;

}

ptr=ptr->left;

}

myptr=stack[top]; ptr=myptr->pr; top--;

while(myptr->status=='p')

{printf(" %d->",ptr->info); myptr=stack[top];

ptr=myptr->pr; top--;

}

if(myptr->status=='n')

{myptr->status='p';ptr=myptr->pr;goto again; }

}

void insert(node**r,int data)

{node*temp,*save,*ptr;

if((*r)==NULL)

{ (*r)=alloc();(*r)->left=NULL;

(*r)->info=data;(*r)->right=NULL;

}

else

{ if(data<(*r)->info) insert(&((*r)->left),data);

else insert(&((*r)->right),data);

}

void del(node**r,int data)

{node*ptr,*ptr1,*ptr2,*ptr3;

ptr=alloc();ptr1=alloc();ptr2=alloc();ptr3=alloc();

ptr=ptr1=(*r);

ptr2=ptr3=NULL ;

while(ptr!=NULL)

{ if(ptr->info==data)

{if(ptr->left!=NULL&&ptr->right!=NULL)

{ptr2=ptr->right;

ptr3=ptr;

while(ptr2->left!=NULL)

{ptr3=ptr2; ptr2=ptr2->left;}

ptr->info=ptr2->info;

if(ptr2->right!=NULL)

{ptr3->left=ptr2->right;}

else {if(ptr==ptr3)ptr3->right=NULL;else ptr3->left=NULL; }

}

else if((ptr->left==NULL&&ptr->right!=NULL)||(ptr->left!=NULL&&ptr->right==NULL))

{if(ptr->left==NULL)

{ptr1->right=ptr->right; ptr=NULL;}

else {ptr1->right=ptr->left;ptr=NULL;}

}

else {

if(ptr1->right->info==data)

{ptr1->right=NULL;ptr=NULL;}

else

{ptr1->left=NULL;ptr=NULL;}

}

else if(ptr->info>data)

{ptr1=ptr;ptr=ptr->left;}

else

{ptr1=ptr;ptr=ptr->right;}

}

void main()

{ clrscr(); int ch1; int i,ch;

node* r1; r1=alloc(); r1=create(&r1);

do{ printf("OPERATIONS ON BINARY SEARCH TREE");

printf("\n1.Insertion\t2.Traversal\t3.Deletion\t4.exit");

printf("\nEnter your choice");

scanf("%d",&ch);

switch(ch)

{case 1:printf("enter element to insert");

scanf("%d",&i);

insert(&r1,i);

break;

case 2: printf("Traversal using 1.stacks\t2.recursion");

scanf("%d",&i);

if(i==1)

{ printf("\nPREORDER USING STACKS");preorder(&r1);

printf("\nPOSTORDER USING STACKS");postorder(&r1);

printf("\nINORDER USING STACKS");inorder(&r1);

}

else

{ printf("\nPREORDER USING RECURSION");pre_traverse(&r1);

printf("\nPOSTORDER USING RECURSION");post_traverse(&r1);

printf("\nINORDER USING RECURSION");in_traverse(&r1);

}

break;

case 3: printf("enter element to delete");

scanf("%d",&i);

del(&r1,i);

break;

case 4:exit(0);

default:printf("wrong choice");

}

printf("Do you want to continue(1 for yes\t0 for no)");

scanf("%d",&ch1);

}while(ch1==1) ;

getch();

}

HYBRID INHERITANCE

2011-12-26T19:11:00.001-08:00

codingdatastructure.blogspot.com
/*PROGRAM To show hybrid inheritance*/
#include<iostream.h>
#include<conio.h>
class student
{protected:int roll_num;
public:
void get_num(int a)
{roll_num=a;}
void put_num()
{cout<<"Roll number: "<<roll_num<<"\n";}
};
class test:public student
{protected:float sub1,sub2;
public:
void get_marks(float x,float y)
{sub1=x; sub2=y;}
void put_marks()
{cout<<"Marks in subject 1: "<<sub1<<"\n";
cout<<"Marks in subject 2: "<<sub2<<"\n";
}
};
class sports
{protected:float score;
public:
void get_score(float s)
{score=s;}
void put_score()
{cout<<"Sports weightage: "<<score<<"\n\n";}
};
class result:public test,public sports
{float total;
public:
void display();
};
void result::display()
{total=sub1+sub2+score;
put_num();
put_marks();
put_score();
cout<<"Total Score: "<<total<<"\n";
}
int main()
{
clrscr();
result s;
s.get_num(25);
s.get_marks(92.3,94.8);
s.get_score(7);
s.display();
getch();return 0;
}

MULTILEVEL INHERITANCE

2011-12-26T19:05:00.001-08:00

codingdatastructure.blogspot.com
//Program to show multilevel inheritance
#include<iostream.h>

class student
{
protected:
int roll_num;
public:
void get_num(int a)
{
roll_num=a;
}
void put_num()
{
cout<<"Roll number: "<<roll_num<<"\n";
}
};

class test:public student
{
protected:
float sub1;
float sub2;
public:
void get_marks(float x,float y)
{
    sub1=x;
    sub2=y;
}
void put_marks()
{
    cout<<"Marks in sub1: "<<sub1<<"\n";
    cout<<"Marks in sub2: "<<sub2<<"\n";
}
};

class result:public test
{
float total;
public:
void display()
{
total= sub1+sub2;
put_num();
put_marks();
cout<<"Total: "<<total<<"\n";
}
};

int main()
{
result s;
s.get_num(81);
s.get_marks(87.0,91.5);
s.display();
return 0;
}

MULTIPLE INHERITANCE

2011-12-26T19:03:00.001-08:00

codingdatastructure.blogspot.com
//Program to show multiple inheritance
#include<iostream.h>
class A
{
protected:
int a;
public:
void get_a(int x)
{
a=x;
}
};

class B
{
protected:
int b;
public:
void get_b(int y)
{
b=y;
}
};

class C: public A,public B
{
public:
void display()
{
cout<<"a= "<<a<<"\n";
cout<<"b= "<<b<<"\n";
cout<<"a*b= "<<a*b<<"\n";
}
};

int main()
{
C c;
c.get_a(24);
c.get_b(5);
c.display();
return 0;
}

SINGLE INHERITANCE

2011-12-26T19:00:00.001-08:00

codingdatastructure.blogspot.com
//Program to show single inheritance
#include<iostream.h>
#include<conio.h>
class B
{
int a;
public:
int b;
void input_ab()
{
a=10;b=20;
}
int get_a()
{
return a;
}
void display_a()
{
cout<<"a= "<<a<<"\n";
}
};

class D:public B
{
int c;
public:
void sum()
{
c = b+get_a();
}
void display();
};

void D :: display()
{
cout<<"a= "<<get_a()<<"\n";
cout<<"b= "<<b<<"\n";
cout<<"c= "<<c<<"\n";
}

int main()
{
D d;
d.input_ab();
d.get_a();
d.display();
d.b=30;
d.sum();
d.display();
return 0;
}

Program to create a class city to store the details such as name, area, population, latitude, longitude of the city.

2011-12-26T18:54:00.001-08:00

codingdatastructure.blogspot.com

/*Create a class city to store the details such as name, area, population,
latitude, longitude of the city. Also,create functions to find neighbouring cities
having similar lattitudes and longitudes.*/
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
class city

{
char name[30];
float area;
int population;
float latitude, longitude;
public:
void getdata();
float getlatitude();
float getlongitude();
void putdata();
}c[2];

void city::getdata()
{
cout<<"Enter The name of the city";
cin>>name;
cout<<"\n Enter the area , population, latitude, longitude of the city";
cin>>area;
cin>>population;
cin>>latitude;
cin>>longitude;
}
void city::putdata()
{
cout<<name;
}
float city::getlatitude()
{
return(latitude);
}
float city::getlongitude()
{
return(longitude);
}
void find_similar_city()
{
int j,k;
float a,b,d,e;
for(j=0;j<2;j++)
{
for(k=j+1;k<2;k++)
a=c[j].getlatitude();
b=c[k].getlatitude();
d=c[j].getlongitude();
e=c[k].getlongitude();
if(a==b)
{cout<<"\n The cities ";
c[j].putdata();
cout<<"and";
c[k].putdata();
cout<<"have same latitude";}
else
if (d==e)
{cout<<"\n The cities ";
c[j].putdata();
cout<<"and";
c[k].putdata();
cout<<"have same longitude";

}
else continue;
} }
int main()
{
for(int i=0;i<2;i++)
{
c[i].getdata();
}
find_similar_city();
getch();
return 0;
}

Program to create a class student to store the name,rollno and marks of the students in various subjects and calculate the average,percentage.

2011-12-26T18:48:00.001-08:00

codingdatastructure.blogspot.com

/*Create a class student to store the name,rollno and marks of the students in various subjects,
create function to calculate the average percentage of the students and print whether the
student is pass or fail.( for n students.)*/
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
#include<string.h>
class student
{
char name[30];
int rollno;
int marks[5];
public:
void getdata();
float calculate();
void result();
};
void student::getdata()
{
cout<<"\n enter the name of the student :";
cin>>name;
cout<<"\n enter the roll number ";
cin>>rollno;
cout<<"\n Now enter the marks in five subjects";
for(int i=0;i<5;i++)
cin>>marks[i];
}
float student::calculate()
{
float avg=0.0;
float tot=0;
for(int i=0;i<5;i++)
tot+=marks[i];
avg=tot/5;
return(avg);
}
int main()
{
int n;
float perc;
cout<<"enter number of studnets";
cin>>n;
student s[n];
for(int i=0;i<n;i++)
{
s[i].getdata();
perc=s[i].calculate();
if(perc>50)cout<<"\n PASS CONGRATULATIONS";

else
cout<<"\n YOU ARE FAILED ";
}
getch();
return 0;
}

Program to create a class time to add two times in hours and minutes.

2011-12-26T18:31:00.001-08:00

codingdatastructure.blogspot.com

//Program to create a class time to add two times in hours and minutes.
#include<iostream.h>
#include<stdio.h>
#include<conio.h>
class addtime
{
int hours;
int minutes;
public:
addtime()
{}
addtime(int t)
{
hours=t/60;
minutes=t%60;
}
addtime operator +(addtime t1);
void show()
{
cout<<"The time added is :"<<hours<<"."<<minutes;
}
};
addtime addtime::operator +(addtime t)
{
addtime temp;
temp.hours = hours+ t.hours;
temp.minutes= minutes+ t.minutes;
return(temp);
}
int main()
{ int a,b;
addtime t1,t2,t3;
cout<<"TIME ADDITION USING OPERATOR OVERLOADING: ";
cout<<"\n enter the times to be added";
cin>>a>>b;
t1=addtime(a);
t2=addtime(b);
t3=t1 +t2;
t3.show();
getch();
return 0;
}

program on employee salary details.

2011-12-26T18:03:00.001-08:00

codingdatastructure.blogspot.com

/*Create a class employee to store the personal and salary details. Make functions to enter and show the employee details. Also create a function to calculate the net salary of an employee. given HRA=5%of base salary, PF=7% of base salary and TAX=10% if salary < 2 lakh P.A. or 15% if salary>2Lakh per annum

Health Reimbursement Accounts or Health Reimbursement Arrangements (HRAs) are sanctioned programs that allow an employer to set aside funds to reimburse medical expenses paid by participating employees.

PF:PROVIDENT FUND*/

#Include<iostream.h>
#include<conio.h>
#include<stdio.h>
class employee
{
char name[30];
int age;
float basic,hra,pf,tax,sal;
public:
void get();
void pay_sal();
void put();
};
//class employee
void employee::get()
{
cout<<"Enter the name of the employee";
gets(name);
cout<<"\n Enter the age of the employee";
cin>>age;
cout<<"\n Enter the basic salary per month";
cin>>basic;
}
void employee::pay_sal()
{
pf=0.07*basic;
hra=.05*basic;
if((12*basic)>200000)
tax=.1*basic;
else
tax=.15*basic;
sal=(12*basic+hra+pf-tax);
cout<<"\nNet annual income:"<<sal;
}
void employee::put()
{
cout<<"Employee Details";
cout<<"\n NAME";
puts(name);
cout<<"\n AGE"<<age;
cout<<"\nNet salary"<<sal;
}
int main()
{
employee e;
e.get();
e.pay_sal();
e.put();
getch();
return 0;
}

ROMAN NUMBER TO DECIMAL

2011-12-26T17:38:00.001-08:00

codingdatastructure.blogspot.com

/*C++ Program to convert a Roman numeral to its decimal equivalent.*/

#include<iostream.h>

#include<stdio.h>

#include<conio.h>

#include<string.h>

#include<stdlib.h>

void main()

{

int *a,len,i,j,k;

char *rom;

clrscr();

cout<<"Enter the Roman Numeral : ";

gets(rom);

len=strlen(rom);

for(i=0;i<len;i++)

{

if(rom[i]=='I')

a[i]=1;

else if(rom[i]=='V')

a[i]=5;

else if(rom[i]=='X')

a[i]=10;

else if(rom[i]=='L')

a[i]=50;

else if(rom[i]=='C')

a[i]=100;

else if(rom[i]=='D')

a[i]=500;

else if(rom[i]=='M')

a[i]=1000;

else

{

cout<<"\nInvalid Value";

getch();

exit(0);

}

k=a[len-1];

for(i=len-1;i>0;i–-)

{

if(a[i]>a[i-1])

k=k-a[i-1];

else if(a[i]==a[i-1] || a[i]<a[i-1])

k=k+a[i-1];

}

cout<<"\nIts Decimal Equivalent is : ";

cout<<k;

getch();

}

C++ program on arithmetic operations on complex number

2011-12-26T17:28:00.001-08:00

codingdatastructure.blogspot.com

/*C++ Program that uses functions to perform the following operations using structures:

i) Reading a complex number

ii) Writing a complex number

iii) Addition of two complex numbers

iv) Multiplication of two complex numbers*/

#include<iostream.h>

#include<stdio.h>

#include<math.h>

void arithmetic(int opern);

struct comp

{

double realpart;

double imgpart;

};

void main()

{

int opern;

clrscr();

cout<<"\n\n \t\t\t***** MAIN MENU *****";

cout<<"\n\n Select your option: \n 1 : ADD\n 2 : MULTIPLY\n 0 : EXIT \n\n\t\t Enter your Option [ ]\b\b";

cin>>opern;

switch(opern)

{

case 0:

exit(0);

case 1:

case 2:

arithmetic(opern);

default:

main();

}}

void arithmetic(int opern)

{

struct comp w1, w2, w;

cout<<"\n Enter two Complex Numbers (x+iy):\n Real Part of First Number:";

cin>>w1.realpart;

cout<<"\n Imaginary Part of First Number : ";

cin>>w1.imgpart;

cout<<"\n Real Part of Second Number : ";

cin>>w2.realpart;

cout<<"\n Imaginary Part of Second Number : ";

cin>>w2.imgpart;

switch(opern)

{

/*addition of complex number*/

case 1:

w.realpart = w1.realpart+w2.realpart;

w.imgpart = w1.imgpart+w2.imgpart;

break;

/*multiplication of complex number*/

case 2:

w.realpart=(w1.realpart*w2.realpart)-(w1.imgpart*w2.imgpart);

w.imgpart=(w1.realpart*w2.imgpart)+(w1.imgpart*w2.realpart);

break;

}

cout<<"\n Answer = "<<w.realpart<<w.imgpart;

getch();

main();//to ask user again and again .

}

2's complement

2011-11-10T18:46:00.001-08:00

codingdatastructure.blogspot.com

/*program to find 2's complement*/
#include<conio.h>
#include<iostream.h>
#include<process.h>
int main()
{

int i,a[20],z,n;
cout<<"Enter the number of bits<20\n";
cin>>n;

cout<<"Enter the binary no.\n";
for(i=0;i<n;i++)
cin>>a[i];
for(i=0;i<n;i++)
{
if(a[i]==0)
{
a[i]=1;
}
else
{
a[i]=0;
}
}
for(i=n-1;i>=0;i++)
{
if(a[i]==0)
{
a[i]=1;
break;
}
else
{
a[i]=0;
}
}

cout<<"The 2's complement is : ";
for(i=0;i<n;i++)
{
cout<<a[i];
}

getch();
return 0;
}

Virtual base classes

2011-11-10T18:41:00.001-08:00

codingdatastructure.blogspot.com

/*Program to illustrate virtual base classes*/
#include<iostream.h>
class student
{
protected:
int roll;
public:
void getnumber(int a)
{
roll=a;
}
void putnumber()
{
cout<<"\nRoll no.:"<<roll<<"\n";
}

};
class test:virtual public student
{
protected:
float part1,part2;
public:
void getmarks(float x,float y)
{
part1=x;
part2=y;
}
void putmarks()
{
cout<<"\n Marks obtained\n";
cout<<"Part1: "<<part1<<endl;
cout<<"Part2: "<<part2;
}

};
class sports: public virtual student
{
protected:
float score;
public:
void getscore(float s)
{
score=s;
}
void putscore()
{
cout<<"\nSports wt: "<<score<<endl;
}
};
class result:public test,public sports
{
float total;
public:
void display()
{
total= part1+part2+score;
putnumber();
putmarks();
putscore();
cout<<"\ntotal score: "<<total<<endl;
}
};
int main()
{
result student1;
student1.getnumber(678);
student1.getmarks(30.5,25.5);
student1.getscore(7.0);
student1.display();
return 0;
}

THIS pointer

2011-11-10T18:34:00.001-08:00

codingdatastructure.blogspot.com

/*program to illustrate this pointer*/
#include<iostream.h>
#include<conio.h>
#include<string.h>
class person
{
char name[20];
float age;
public:
person(char *s,float a)
{
strcpy(name,s);
age=a;
}
person &person::greater(person &x )
{
if(x.age>age)
{
return x;
}
else
{
return *this;
}
}
void display()
{
cout<<"\nName: "<<name<<"\n";
cout<<"\nAge: "<<age;
}
};
int main()
{
person p1("John",37.50),p2("Ahmed",29.0),p3("hebber",40.25);
person p=p1.greater(p3);
cout<<"\nElder person is: ";
p.display();
p=p1.greater(p2);
cout<<"\nElder person is: ";
p.display();
return 0;
}

Runtime polymorphism

2011-11-10T18:23:00.000-08:00

codingdatastructure.blogspot.com

/*program to illustrate run time polymorphism*/

cout<<"\nmedia details";
cout<<"\n....book....";
list[0]->display();
cout<<"\n....tape....";
list[1]->display();
getch();return 0;
}

RUNTIME POLYMORPHISM

2011-11-10T18:14:00.001-08:00

codingdatastructure.blogspot.com

/*program to illustrate run time polymorphism*/

#include<iostream.h>
#include<conio.h>
#include<string.h>
class media
{
protected:
      char title[50];
      float price;
public: media(char *s,float a)
         {
   strcpy(title,s);
   price=a;
         }
   virtual void display(){}
};
class book:public media
{
      int pages;
      public:
      book(char *s,float a,int p):media(s,a)
      {
       pages =p;
      }
     void display();
};
class tape:public media
{
     float time;
     public:
     tape(char *s,float a,float t):media(s,a)
     {
             time=t;
            }
                   void display();
};
     void book::display()
         {
   cout<<"\ntitle: "<<title;
   cout<<"\npages: "<<pages;
   cout<<"\nprice: "<<price;
  }
     void tape::display()
         {
          cout<<"\ntitle: "<<title;
   cout<<"\nplay time: "<<time<<"mins";
   cout<<"\nprice: "<<price;
  }
   int main()
                 {
                     char *title=new char[30];
                     float price,time;
                     int pages;
                     cout<<"\nEnter the book details\n";
                     cout<<"\ntitle: ";
                     cin>>title;
                     cout<<"\npages: ";
                     cin>>pages;
                     cout<<"\nprice: ";
                     cin>>price;
                     book book1(title ,price ,pages);
       cout<<"\nEnter the tape details\n";
       cout<<"\ntitle: ";
       cin>>title;
       cout<<"\nplay time in min: ";
       cin>>time;
       cout<<"\nprice: ";
       cin>>price;
       tape tape1(title,price,time);
       media *list[2];
       list[0]=&book1;
       list[1]=&tape1;

cout<<"\nmedia details";
cout<<"\n....book....";
list[0]->display();
cout<<"\n....tape....";
list[1]->display();
getch();return 0;
}

Template based program to determine if a particular value occurs in an array of values.

2011-11-06T23:29:00.001-08:00

codingdatastructure.blogspot.com

/*Template based program that determines if a

particular value occurs in an array of values.*/

#include<iostream.h>

#include<conio.h>

template <class T>

void search(T arr[])

{ T a;int flag=0;

cout<<"Enter the element which you want to search:";

cin>>a;

for(T i=0;i<10;i++)

if(a==arr[i])

{flag=1;break;}

if(flag==1) cout<<"\nElement is present in the array.";

else cout<<"\nElement is not present in the array.";

}

void main()

{ clrscr();

int arri[10],ch,i;char arrc[11];float arrf[10];

cout<<"Program to search element in an array.\nWhich array you want to make?\n";

cout<<"Enter your choice:\n1.integer\n2.characters\n3.Real number\n";

cin>>ch;

switch(ch)

{

case 1: cout<<"Enter array of 10 integers:";

for(i=0;i<10;i++)

cin>>arri[i];

search(arri);

break;

case 2: cout<<"Enter array of 10 characters:";

for(i=0;i<10;i++)

cin>>arrc[i];

search(arrc);

break;

case 3: cout<<"Enter array of 10 real no.:";

for(i=0;i<10;i++)

cin>>arrf[i];

search(arrf);

break;

default:cout<<"WRONG CHOICE...!!";

}

getch();

}

To count the characters,lines and words in the text file

2011-11-06T23:27:00.001-08:00

codingdatastructure.blogspot.com

/*Program to that counts the characters,

lines and words in the text file.*/

#include<fstream.h>

#include<conio.h>

#include<stdio.h>

void main()

{

clrscr();

char s;int w,c,l;

w=c=l=0;

fstream f;

f.open("E:\\count1.txt",ios::in|ios::out);

cout<<"Write a small paragraph:(Enter 0 in a new line to terminate)\n";

while((s=getchar())!='0')

{f<<s;}

f.seekg(0);

f.get(s);

while(!f.eof())

{

if(s==' ')

w++;

else if(s=='\n')

{ l++;w++; }

else c++;

f.get(s);

}

cout<<"\nNumber of characters:"<<c;

cout<<"\nNo. of lines:"<<l;

cout<<"\nNo of words:"<<w;

f.close();

getch();

}

To delete all duplicate characters in the given string.

2011-11-06T23:25:00.001-08:00

codingdatastructure.blogspot.com

/*Program that uses a function to delete all

duplicate characters in the given string.*/

#include<iostream.h>

#include<conio.h>

#include<string.h>

#include<stdio.h>

void main()

{ clrscr();

char str[30],str1[30];

int flag,k=0;

cout<<"Enter a string:";

gets(str);

for(int i=0;str[i]!='\0';i++)

{ flag=0;

for(int j=i-1;j>=0;j--)

if(str[i]==str[j])

{flag=1;}

if(flag==0){ str1[k]=str[i];str1[++k]='\0';}

}

cout<<"\nAfter removing duplicate characters string is ";

for( k=0;str1[k]!='\0';k++)

cout<<str1[k];

getch();

}

To find largest,smallest number and sort given numbers using template function

2011-11-06T23:24:00.001-08:00

codingdatastructure.blogspot.com

/*Program to find largest,smallest number and

sort given numbers using template function*/

#include<iostream.h>

#include<conio.h>

template<class T>

void larsmal(T *no,int n)

{T temp;

for(int i=1;i<n;i++)

for(int j=0;j<i;j++)

if(no[j]>no[i])

{

temp=no[j];

no[j]=no[i];

no[i]=temp;

}

cout<<"After Sorting:";

for(i=0;i<n;i++)

cout<<" "<<no[i];

cout<<"\nLargest no is "<<no[n-1];

cout<<"\nSmallest no is "<<no[0];

delete []no;

}

void main()

{

clrscr();

int n,ch;

cout<<"How many numbers you want to Enter?\n";

cin>>n;

cout<<"Enter your choice:\n1.integer\n2.Real number\n";

cin>>ch;

switch(ch)

{

case 1:int *noi=new int[50];

cout<<"Enter array of n integers:";

cout<<"\nEnter the terms:";

for(int i=0;i<n;i++)

cin>>noi[i];

larsmal(noi,n);

break;

case 2:float *nof=new float[50];

cout<<"Enter array of n real no.:";

cout<<"\nEnter the terms:";

for(i=0;i<n;i++)

cin>>nof[i];

larsmal(nof,n);

break;

default:cout<<"WRONG CHOICE...!!";

}

getch();

}

To show a reversed string

2011-11-06T23:22:00.001-08:00

codingdatastructure.blogspot.com

/*Program to show a reversed string*/

#include<iostream.h>

#include<conio.h>

#include<stdio.h>

#include<string.h>

void revstr(char ch[])

{ int l=strlen(ch);

cout<<"\nReversed string:\n";

for(int i=l-1;i>=0;i--)

cout<<ch[i];

}

void main()

{clrscr();

char ch[20];

cout<<"Enter a string:\n";

gets(ch);

revstr(ch);

getch();

}

Pyramid of numbers

2011-11-06T23:19:00.001-08:00

codingdatastructure.blogspot.com

/*Pyramid of numbers

2 2

3 3 3

4 4 4 4

5 5 5 5 5

6 6 6 6 6 6 and so on

#include<iostream.h>

#include<conio.h>

void main()

{ clrscr();

int n;

cout<<"Enter the value of n:";

cin>>n;

for(int i=0;i<=n;i++)

{

for(int k=n;k>=i;k--)

cout<<" ";

for(int j=0;j<i;j++)

cout<<i<<" ";

cout<<"\n";

}

getch();

}

Insert,delete a substring from a given position of mainstring

2011-11-06T23:18:00.001-08:00

codingdatastructure.blogspot.com

/*Program to insert,delete a substring from

a given position of mainstring*/

#include<iostream.h>

#include<conio.h>

#include<stdio.h>

void delstr(char *str);

void insstr(char *str);

void main()

{

clrscr();

int ch;

char *str;

cout<<"Enter a string:\n";

gets(str);

cout<<"\nPress 0 to delete some part of string.\n";

cout<<"Press 1 to enter some part into the string.\n";

cout<<"Enter your choice.\n";

cin>>ch;

switch(ch)

{

case 0: delstr(str);

break;

case 1: insstr(str);

break;

default: cout<<"Wrong Choice...Sorry..!!";

}

getch();

}

void delstr(char *str)

{ int pos,n,i=0;

cout<<"\nEnter the position no. after which you want to delete the string.\n";

cin>>pos;

cout<<"Enter the no of characters you want to delete.\n";

cin>>n;

while(str[i]!='\0')

{if(i<(pos-1) || i>=(pos+n-1))

cout<<str[i];

i++;

}

void insstr(char *str)

{int pos,n,i=0,j=0;

char *substr;

cout<<"\nEnter the position after which you want to insert the string:\n";

cin>>pos;

cout<<"Enter the string:";

gets(substr);

while(str[i]!='\0')

{ if(i<=(pos-1))

{ cout<<str[i];i++;}

else if(substr[j]!='\0')

{ cout<<substr[j];j++;}

else {cout<<str[i];i++;}

}

constructor and destructor invocation in inheritance

2011-11-06T23:17:00.001-08:00

codingdatastructure.blogspot.com

/*Program to illustrate constructor and

destructor invocation in inheritance*/

#include<iostream.h>

#include<conio.h>

class base1

{public:

base1()

{cout<<"Constructor of base1.\n";}

~base1()

{cout<<"Destructor of base1.\n";}

};

class base2

{public:

base2()

{cout<<"Constructor of base2.\n";}

~base2()

{cout<<"Destructor of base2.\n";}

};

class derived: public base1,public base2

{public:

derived()

{cout<<"Constructor of derived.\n";}

~derived()

{cout<<"Destructor of derived.\n";}

};

void main()

{clrscr();

derived d; //d is an object of derived class

getch();

}