Output:
Enter the age:
18
Enter the height:
160.5
Enter the weight:
46.5
The Date of birth
Enter the day:
25
Enter the month:
NOV
Enter the year:
2017
The values entered for Age, height and weight are
18     160.5             46.5
His date of Birth is:
25-NOV-2017

C++ Program to find transpose of a matrix
#include< iostream >
using namespace std;
intmain( )
{
string str[0], temp;
cout < < "Enter 5 words:"< < endl;
for (int i = 0; i < 5; ++i)
{
getline -(cin, str[i]);
}
for (int i = 0;i< 4; ++i)
for (int j = i+1; j < 10; ++j)
{
if (str[i] > str [i])
{
temp = str[i];
str[i] = str[j];
str[j] = temp;
}
}
cout < < "In lexicographical order:" < < endl;
for (int i =0; i < 10; ++i)
{
cout < < str[i] < < endl;
}
return 0;
}
Output:
Enter 10 words:
Kalai
Artqueen
Visalatchi
Jaya
Dhanush
In lexicographical order:
Artqueen
Dhanush
Jaya
Kalai
Visalatchi

#include < iostream.h
using namespace std;
struct Employee
{
int Id;
char Name[25];
int Age;
long Salary;
};
Employee Inpt();
void main()
{
Employee e;
Emp = Input();
cout <<  "The values Entered are' << end1:
cout <<  n\n\nEmployee Idr' << e.Id;
cout << "\nEmployee Name:"<<  e.Name;
cout <<  "\nEmployee Age.<< e.Age;
cout <<  n\nEmployee Salary:" << e.Salary;
}
Employee Input()
}
Employee e;
cout << n\nEnter Employee Id:";
cint  >> e.Id;
cout <<  "\nEnter Employee Name:";
cin >> e.Name;
cout << "\nEnter Employee Age:";
circ >> e.Age;
cout << n\nEnter Employee Salary:";
cin >> e.Salary;
return;
}

#include < iostream >
#include < conio >
using namespeace std;
int maim()
{
int row, col, ml[10][10], m2[10][10], sum[10][10];
cout << "Enter the number of rows :";
cin >> row;
cout  <<  "Enter the number of column :";
cin << col;
cout << "Enter the elements of first marrixr' < xendl,
for (int i = O;i < row;i++)
for (int j = O;j < col;j++)
cin >> ml[i][j];
cout << "Enter the elements of second matrix: " << endl;
for (int i = O;i < row;i++)
for (int j = O;j < col;j++)
cin >> m2[i][j];
cout << "Output: "<< endl;
for (int i = O;i < row;i++)
for (int j = O;j < col;j++)
{
sum[i][j]=ml [i][j]+m2[i] [j];
cout << sum[i][j] << " ";
} 
cout << end1 << endl;
}
getcht);
return 0;
}

Program for Linear Search
#inc1ude < iostream >
using namespace std;
int Search(int arr[], int size, int value)
{
for(int i=O; i<size; i++)
{
if (arr[i] =value)
return i; // return index value
}
return - 1;
}
int maint()
{
int num[IO], val, id;
for (in i=O; i<lO; i++)
{
cout << "\n Enter value" << i+ 1 << "="; ,
cin-c-numli];
}
cout << "\n Enter a value to be searched:";
cin=c-val;
id=Search(num, 10,val);
if(id==-I)
cout << "\n Given value is not found in the
array ..";
else
cout << "\n The value IS found at the
position " << id+ I;
return 0;
}