Technocraks

Multiple Inheritance in C++.

2020-01-02T11:16:00.002+05:30

In this tutorial Multiple Inheritance in c++.

On the basis of Inheritance concept the another type of inheritance is the Multiple Inheritance.

This type inheritance use to create a new class from multiple base class.In this technique two or more class use to create new class.

By this you can use the code or data from the different class in derived class.

Syntax:

class base-class1

{

............;

}

class base-class2

{

...........;

}

class derived-class:base-class1,base-class2

{

...........;

}

Suppose the student is the derived class.And the Teacher and subject is the two different base.Then the Student class is derived form other two base class is known as Multiple inheritance.

Here following code shows the multiple inheritance.

#include<iostream.h>
#include<conio.h>
class area
{
    public:
        int area;
        void cal_area(int l,int b);
};
class perimeter
{
    public:
        int peri;
        void cal_peri(int l,int b);
};
class rectangle:public area,public perimeter
{
    public:
        void display();
};
void area::cal_area(int length, int breath)
{
    area=length*breath;
}
void perimeter::cal_peri(int length,int breath)
{
    peri=2*length+2*breath;
}
void rectangle::display()
{
    cout<<"\nArea="<<area<<"\nPerimeter="<<peri;
}
void main()
{
    rectangle r;
    int l,b;
    clrscr();
    cout<<"\nEnter length & breath:";
    cin>>l>>b;
    r.cal_area(l,b);
    r.cal_peri(l,b);
    r.display();
    getch();
}

Output:

Single Inheritance in c++.

Single Inheritance in c++

2020-01-02T10:42:00.000+05:30

In this tutorial we learn the concept of Inheritance in c++.

Inheritance is the most powerful feature in the c++ language that allows us to the code re usability. That is better for every programmer when we are required the data again and again then instead of writing that code again use inheritance. This feature save the time as well as money and also increases the reliability.

Que:What is mean by Inheritance?

Ans: The inheritance is the creating a new class form already exiting class. The old or existing class is known as Base class (super class or parent class) and the new class is known as Derived class(child class or sub class.

Types of Inheritance:

1)Single Inheritance

2)Multiple Inheritance

3)Multilevel Inheritance

4)Hierarchical Inheritance

5)Hybrid Inheritance

Here we learn first Single Inheritance:

This type of Inheritance is done when the new class is creating only a one Base class. The Inheritance feature is allows us to use the data of the parent class.

Syntax:

Class base-Class

{

…………………

………………..

};

Class derived-class:base-class

…………………….;

……………………;

}

The following code shows the single inheritance of student and teacher class in this code Teacher is the super class and the Student is the drived class. The Student class is uses the feature of the Teacher class.

#include<iostream.h>

#include<conio.h>

#include<stdio.h>

class Teacher

{

char name[20];

public:

char sub[20];

void getdata()

{

cout<<"\nFor Teacher:";

cout<<"\nEnter Teacher Name:";

gets(name);

cout<<"\nEnter subject:";

gets(sub);

}

void display()

{

cout<<"\n*****Teacher Information*****";

cout<<"\nName:"<<name;

cout<<"\nSubject:"<<sub;

}

};

class Student:public Teacher

{

char sname[20],cls[20];

int rno;

public:

void getinfo()

{

getdata();

cout<<"\nFor Student:";

cout<<"\nEnter Student Name:";

gets(sname);

cout<<"\nEnter class of Student:";

gets(cls);

cout<<"\nEnter roll no of Student:";

cin>>rno;

}

void show()

{

display();

cout<<"\n*****Student Information*****";

cout<<"\nName:"<<sname;

cout<<"\nClass:"<<cls;

cout<<"\nRoll No.:"<<rno;

}

};

void main()

{

Student s1;

clrscr();

s1.getinfo();

s1.show();

getch();

}

The following code shows the OUTPUT:

Multiple Inheritance in C++.

Function overloding in cpp.

2019-12-21T16:11:00.000+05:30

Function overloading in cpp.
   In this tutorial we learn how to overload the function in c++.
Firstly,

What is mean by function overloading?

Ans:Function overloading is the feature of cpp language.It means that the two or more function having same name.It can be one of the example of Polymorphism.The function name is same but the return type and parameter given to the function is different.

Syntax:
   function-return-type function name(parameter)
declare another function as same name but different parameter

For Example:
suppose we have a function for calculate addition of two number and three number.
   int add(int num1,num2);
and another is,
   int add(int num1,int num2 int num3);

Here following code shows a area function overloading concept to calculate the different area for different shape.

#include<iostream.h>
#include<conio.h>
int area(int s);
int area(int l,int b);
double area(double bs,double hg);
double area(double r);
int main()
{
    clrscr();
    cout<<"\nArea of square="<<area(5)<<endl;
    cout<<"\nArea of Rectangle="<<area(10,5)<<endl;
    cout<<"\nArea of Triangle="<<area(4.0,10.0)<<endl;
    cout<<"\nArea of circle="<<area(6.0);
    getch();
    return(0);
}
int area(int s)
{
    return(s*s);
}
int area(int l,int b)
{
    return(l*b);
}
double area(double bs,double hg)
{
    return(bs*hg/2);
}
double area(double r)
{
    return(3.14*r*r);
}

OUTPUT:

Reverse number using cpp.

2019-12-16T10:27:00.000+05:30

Reverse number using cpp.

        In this tutorial we learn how to print reverse number of any digit using cpp programming language.
A number contained any digit then by following technique we convert its into reverse order.
        suppose we take a 3 digit integer number and we want to print its into the reverse order then,the number is mod,add reminder and divide operation until number is 0.If number reach to 0 then terminate the execution.

example:

number is 123
step 1:
   //here we taking a mod of number i.e 3
   mod=123%10
step 2:
   //here we add the reminder into mod that multiplied by 10
   reminder=reminder*10+mod
step 3:
   //finally number dividation.
       number=number/10

code:

#include<iostream.h>
#include<conio.h>
void main()
{
    int num,mod,reminder=0,i;
    clrscr();
    cout<<"\nEnter any 3 digit number:";
    cin>>num;
    while(num!=0)
    {
        mod=num%10;
        reminder=reminder*10+mod;
        num=num/10;
    }
    cout<<"\nReverse number:"<<reminder;
    getch();
}

Output:

You may also like:
Dynamic Memory Management in cpp.
Manipulators in cpp.
This is the program constructor overloding in cpp

Dynamic Memory Management in CPP

2019-12-08T16:30:00.001+05:30

Dynamic Memory Management in cpp.

In this tutorial we learn Dynamic Memory Management operator in cpp.This operator use to real time memory of the variable.Memory not allocated statically.This operator use only for Memory allocation and deallocation.

1)New :
      This operator is use to newly allocate memory of any data type.

syntax:
    pointer_variable=new data-type;

Here we use pointer-variable to allocate memory.new is the keyword and followed that data-type of data to store.The data type could be use any built-in data type.It also int user defined data type like structure and class.

Example:
        p=new student;

2)delete:
        This operator use to deallocate the memory.It free up the memory that as already allocate.

syntax:
   delete variable-name;

This syntax use to delete the allocate memory.

example:
   delete p;

here p is the object of class when this statement is executed then the memory for this object free up.

code:
    #include<iostream.h>
    #include<conio.h>
    class student
    {
   char name[20];
         int rno;
         float avg;
         public:
       void getdata();
       void putdata();
    };
    void student::getdata()
    {
   cout<<"\nEnter the name of student:";
   cin>>name;
   cout<<"\nEnter the roll number of student:";
         cin>>rno;
   cout<<"\nEnter average of student:";
   cin>>avg;
    }
    void student::putdata()
    {
      cout<<"\n"<<name<<"\t"<<rno<<"\t"<<avg;
    }
    int main()
    {
      int n,i;
      student *p,*q;
clrscr();
cout<<"\nEnter number of student:";
cin>>n;
p=new student[n];
q=p;
for(i=1;i<=n;i++)
{
          cout<<"\nEnter "<<i<<" Student information";
          p->getdata();
    p++;
      }
      p=q;
      cout<<"\nStudent information:";
      cout<<"\nName\tRoll no\tAverage";
      for(i=1;i<=n;i++)
{
    p->putdata();
          p++;
      }
delete p;
        getch();
        return(0);
}

OUTPUT:

Manipulators in cpp

2019-12-08T16:04:00.003+05:30

Manipulators in cpp.

In this tutorial we learn Manipulators in cpp.These are the function that helps to modify the input/output stream.It does not change any value or data of the variable but it only modify the data as programmer wants.

Types of Manipulators:

1)Manipulator without argument:

endl:This manipulator defined in ostream.It used to instead of using \n.It is use to enter the new line.
ws:This manipulator use to ignore the all whitespaces in the line.It is defined in istream.
ends:It includes the null character into the ostream.It is belonging in ostream.

flush:It is also in ostream.It flushes output stream in the line.

2)Manipulators with Arguments:

setw (val): It is used to sets the field width in output stream.
setfill (x): It is used to fill the character ‘x’ on output stream.

setprecision (val): It sets val as the new value for the precision of floating-point values.

code:

#include<iostream.h>
#include<conio.h>
#include<iomanip.h>
int main()
{
    int m1,m2;
    double f=3.14159;
    clrscr();
    cout<<"\nEnter two number:";
    cin>>m1>>m2;
    cout<<"\nDisplay the number:";
    cout<<"\nN1:="<<m1;
    cout<<"\nN2:="<<m2;
    cout<<"\nN1="<<setw(8)<<m1<<endl;
    cout<<"\nN2="<<setw(5)<<m2<<endl;
    cout<<setfill('x')<<setw(10);
    cout<<77<<endl;
    cout<<setprecision(4)<<f;
    getch();
    return(0);
}

OUTPUT:

Binary search using cpp.

2019-12-06T12:28:00.001+05:30

Binary Search using cpp.

In this tutorial we learn how to search element from given array.This technique is best technique for searching element in large amount of data is given.This techniques is based on the Divide and Conquer.But main condition for this technique is that the data given input is sorted.This approach divide the array in two part and then search the element where the small by middle element or greater.

Code:

#include<iostream.h>
#include<conio.h>
void main()
{
    int n,i,arr[50],search,first,last,middle;
    clrscr();
    cout<<"\nEnter total number of element:";
    cin>>n;
    cout<<"\nEnter the element:";
    for(i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    cout<<"\nEnter searchable element:";
    cin>>search;
    first=0;
    last=n-1;
    middle=(first+last)/2;
    while(first<=last)
    {
        if(arr[middle]<search)
        {
            first=middle+1;
        }
        else if(arr[middle]==search)
        {
            cout<<search<<" found at position:"<<middle+1<<"\n";
            break;
        }
        else
        {
            last=middle-1;
        }
        middle=(first+last)/2;
    }
    if(first>last)
    {
        cout<<"\nElement not found:";
    }
    getch();
}

OUTPUT:

for video demonstration follow:

https://youtu.be/qFpjuqX1gAQ

linear search using cpp.

2019-12-03T11:09:00.003+05:30

Linear search using cpp.

In this tutorial we learn how to search element in linear searching technology.Linear search is a technique searching element in linear order.This technique checks each element of the list until a match is found.

Complexity:

worst complexity: O(n)

Average complexity: O(n)

Space complexity: O(1)

Code:

#include<iostream.h>
#include<conio.h>
void main()
{
    int arr[10],i,num,n,c=0,pos;
    clrscr();
    cout<<"\nEnter the size of array:";
    cin>>n;
    cout<<"\nEnter the element:";
    for(i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    cout<<"\nEnter searchable number:";
    cin>>num;
    for(i=0;i<n;i++)
    {
        if(arr[i]==num)
        {
            c=1;
            pos=i+1;
            break;
        }

    }
    if(c==0)
    {
        cout<<"\nNumber is not found;";
    }
    else
    {
        cout<<num<<"\nFound at position"<<pos;
    }
    getch();
}

OUTPUT:

Insertion sort using cpp.

2019-11-27T10:47:00.000+05:30

Insertion sort using CPP.

In this tutorial we learn another sorting technique that is insertion sort.
this technique comparing element in the array each other and then when smaller element is found then
change to its proper position.
complexity:
worst complexity:n^2
average complexity:n^2
best complexity:n

example:

we are sorting this array element in ascending order.
suppose we have a unsorted array of element 5
arr[5]=43 25 12 73 39

//in the first iteration compare 1st and 2nd position in array if smaller element is found then change to its proper position.
//after iteration first array become
arr[5]=25 43 12 73 39

//after first iteration compare 1st and 2nd position of element with 3rd position of element and then sort element.
//after iteration array become.
arr[5]=12 25 43 73 39

//now compare all previous element with 4th position of element.
in this iteration no change because no smaller element is found.
array element become as it is.

//for last iteration it compare all previous positin with 5th position of element.
array become.
arr[5]=12 25 39 43 73

//finally we get a sorted array in ascending order.

This is the simple code for sort array in ascending order by using insertion sort.

#include<iostream.h>
#include<conio.h>
//declare the function for insertion sort.
void insertsort(int *arr,int size)
{
    int i,j,index;
    for(i=1;i<size;i++)
    {
        index=arr[i];
        j=i;
        while((j>0)&&(arr[j-1]>index))
        {
            arr[j]=arr[j-1];
            j=j-1;
        }
        arr[j]=index;
    }
}
void main()
{
    int *arr,size;
    clrscr();
    //Enter array size dynamically.
    cout<<"\nEnter the size of array:";
    cin>>size;
    cout<<"\nEnter the element:";
    for(int i=0;i<size;i++)
    {
        cin>>arr[i];
    }
    insertsort(arr,size);
    cout<<"\nSorted element are:";
    for(i=0;i<size;i++)
    {
        cout<<arr[i]<<"\n";
    }
    getch();
}

OUTPUT:

Selection Sort

2019-11-11T11:28:00.001+05:30

In this tutorial learn how sort the data using Selection Sort Technique.

This sorting technique is combination of searching and sorting.Its working per iteration in unsorted element with smallest or largest element.The number of iteration for this sort is n-1.

Example:
arr[]=42 63 47 87 11

/*after first iteration
arr[]=11 63 47 87 42

/*after Second iteration
arr[]=11 42 47 87 63

/*after Third iteration
arrr[]=11 42 47 87 63
/*in this iteration array element remains unchanged because no smallest element found unsorted at postion 3rd.

/*after fourth iteraation
arr[]=11 42 47 63 87

Following code shows the Selection Sort:-

#include<iostream.h>
#include<conio.h>
void selsort(int numbers[],int n)
{
int i,j,min,temp;
for(i=0;i<n-1;i++)
{
min=i;
for(j=i+1;j<n;j++)
{
if(numbers[j]<numbers[min])
{
min=j;
}
}
temp=numbers[i];
numbers[i]=numbers[min];
numbers[min]=temp;
}
}
void main()
{
int *numbers,n;
clrscr();
cout<<"\nEnter the size of array:";
cin>>n;
numbers=new int[n];
cout<<"\nEnter the array element:";
for(int i=0;i<n;i++)
{
cin>>numbers[i];
}
selsort(numbers,n);
cout<<"\nSorted element:";
for(i=0;i<n;i++)
{
cout<<" "<<numbers[i];
}
getch();
}

Above code shows following output:

Quick Sort using Cpp.

2019-11-11T02:00:00.000+05:30

In this tutorial we learn how to sort data using Quick Sort Technique

In this Sorting technique the algorithm works on divide and conquer technique.Its take a

first element as pivot and then divide the array.The element lesser than pivot element is left side and right side always greater.The Quick sort called itself recursively.

Following code shows the Quick Sort Technique:-

#include<iostream.h>

#include<conio.h>

int partition(int a[],int l,int r)

{

int pivot,i,j,temp;

pivot=a[l];

i=l;

j=r+1;

while(1)

{

++i;

while((a[i]<=pivot) &&i<=r);

--j;

while(a[j]>pivot);

if(i>=j)

break;

temp=a[i];

a[i]=a[j];

a[j]=temp;

}

temp=a[l];

a[l]=a[j];

a[j]=temp;

return j;

}

void quicksort(int a[],int l,int r)

{

int j;

if(l<r)

{

j=partition(a,l,r);

quicksort(a,l,j-1);

quicksort(a,j+1,r);

}

void main()

{

int *numbers,n;

clrscr();

cout<<"\nEnter the size of array";

cin>>n;

numbers=new int[n];

cout<<"\nEnter array element:";

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

{

cin>>numbers[i];

}

quicksort(numbers,0,n-1);

cout<<"\nSorted array";

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

{

cout<<" "<<numbers[i];

}

getch();

}

Above code Shows following output:

Bubble Sort using CPP.

2019-11-10T11:25:00.000+05:30

In this tutorial we learn how to sort the data using Bubble Sort.

A Sorting technique is use to rearrange the data in the ordered manner.The data arrange by Ascending and Descending order.Bubble Sort is he simple Sorting Algorithm Technique it works by repeatedly swapping data.When the data are giving input in wrong order then the Sorting technique is used.

Following code shows the Bubble Sorting technique:-
In this example we take a dynamic array the size will dynamic as given by user.

#include<iostream.h>

#include<conio.h>
void bubblesort(int numbers[],int n)
{
int i,j,temp;
for(i=(n-1);i>=0;i--)
{
for(j=1;j<=i;j++)
{
if(numbers[j-1]>numbers[j])
{
temp=numbers[j-1];
numbers[j-1]=numbers[j];
numbers[j]=temp;
}
}
}
}
void main()
{
int *numbers,n;
clrscr();
cout<<"\nEnter the size of array:";
cin>>n;
numbers=new int[n];
cout<<"\nEnter the array element:";
for(int i=0;i<n;i++)
{
cin>>numbers[i];
}
bubblesort(numbers,n);
cout<<"\nSorted element:";
for(i=0;i<n;i++)
{
cout<<" "<<numbers[i];
}
getch();
}

The above code shows the following output:-

Program for circular queue in cpp

2019-11-10T11:09:00.001+05:30

In this tutorial we learn how to create circular queue in cpp. In the data structure queue is one type of data storage type.We include the data in queue. The queue working first in first out(FIFO).It is a linear data structure.In this we can insert element until queue become full.

following is the simple coding for circular queue:-

#include<iostream.h>
#include<conio.h>
#define SIZE 5
class cqueue
{
int front,rear;
int cq[SIZE];
public:
cqueue()
{
front=rear=-1;
}
void insert(int ele)
{
if(rear==front-1||front==0&&rear==SIZE-1)
{
cout<<"Circular queue is full";
return;
}
else if(front==-1 &&rear==-1)
{
front=rear=0;
cq[rear]=ele;
}
else
{
rear=(rear+1)%SIZE;
cq[rear]=ele;
}
}
int deleted()
{
int x;
if(front==-1&& rear==-1)
{
cout<<"\nCircular queue is empty";
return 0;
}
else
{
if(front==rear)
{
x=cq[rear];
front=rear=-1;
return x;
}
else
{
x=cq[front];
front=(front+1)%SIZE;
return x;
}
}
}
void display()
{
if(front==-1 && rear==-1)
{
cout<<"\nCircular queue is empty";
return;
}
else
{
if(front<=rear)
{
for(int i=front;i<=rear;i++)
{
cout<<" "<<cq[i];
}
}
else
{
for(int i=front;i<SIZE;i++)
{
cout<<" "<<cq[i];
}
if(front>rear)
{
for(int i=0;i<=rear;i++)
{
cout<<" "<<cq[i];
}
}
}
}
}
};
void main()
{
cqueue c;
int ch,ele,m;
clrscr();
do
{
cout<<"\nMenu\n1.Insert\n2.Delete\n3.Display\n4.Exit";
cout<<"\nEnter your choice:";
cin>>ch;
switch(ch)
{
case 1:
cout<<"\nEnter element:";
cin>>ele;
c.insert(ele);
break;
case 2:
m=c.deleted();
cout<<"\nDleted element:"<<m;
break;
case 3:
c.display();
break;
case 4:
cout<<"\nExit";
break;
}
}while(ch!=4);
getch();
}

The above program shows the following output:

program for constructor overloding in cpp

2019-11-09T20:03:00.001+05:30

#include<iostream.h>
#include<conio.h>
#include<string.h>
class student
{
int roll;
char name[20];
public:
student(){};
student(int r,char n[])
{
roll=r;
strcpy(name,n);
}
void show()
{
cout<<"\nRoll number:"<<roll;
cout<<"\nName:"<<name;
}
};
void main()
{
student s,s1(18,"Mayur");
clrscr();
s.show();
s1.show();
getch();
}

code for creating a star using svg in html5

2019-11-09T18:48:00.001+05:30

This is the code for creating a simple logic for display the star shape using a svg element in html5.

Programming for printing rainbow in html using svg

2019-11-09T14:02:00.001+05:30

This is the programs for creating a rainbow shape using svg element in html5.

<html>
<head>

<title>Smile</title>

</head>
<body>
<svg height="140" ">
<circle id = "circle" cx = "150" cy="150" r="150" fill = "violet" />

<circle id = "circle" cx = "150" cy="150" r="130" fill = "orange" />

<circle id = "circle" cx = "150" cy="150" r="110" fill = "yellow" />

<circle id = "circle" cx = "150" cy="150" r="90" fill = "blue" />

<circle id = "circle" cx = "150" cy="150" r="70" fill = "green" />

<circle id = "circle" cx = "150" cy="150" r="50" fill = "white" />

<circle id = "circle" cx = "150" cy="150" r="30" fill = "red" />

</svg>
</body>
</html>