/* */

struct employee st[100];
clrscr();
printf(“Enter number of employee”);
scanf(“%d”,&n);
for(i=0;i<n;i++)
{
clrscr();
printf(“For employee number %d\n”,i+1);
printf(“Enter name “);
scanf(“%s”,&st[i].ns);
printf(“Enter department “);
scanf(“%s”,&st[i].dep);
printf(“Enter basic pay, hra, da “);
scanf(“%d%d%d”,&st[i].bas,&st[i].hra,&st[i].da);
st[i].tot=st[i].bas+st[i].hra+st[i].da;
}
max=st[0].tot;
pos=0;
for(i=0;i<n;i++)
{

if(st[i].tot>max)

{
max=st[i].tot;
pos=i;
}
}

printf(“\nName of the employee getting highest salary: “);
puts(st[pos].ns);
printf(“department: “);
puts(st[pos].dep);
printf(“Total salary: %d”,max);

printf(“\n”);

getch();
return 0;
}

struct student st[100];
clrscr();
printf(“Enter number of students”);
scanf(“%d”,&n);
for(i=0;i<n;i++)
{
clrscr();
printf("For student number %d\n",i+1);
printf("Enter name ");
scanf("%s",&st[i].ns);
printf("Enter roll ");
scanf("%d",&st[i].roll);
printf("Enter marks in phy,chem,maths ");
scanf("%d%d%d",&st[i].phy,&st[i].chem,&st[i].math);
st[i].tot=st[i].phy+st[i].chem+st[i].math;
}
for(i=0;i<n;i++)
{
for(j=0;jst[j+1].tot)
{
temp=st[j+1].tot;
st[j+1].tot=st[j].tot;
st[j].tot=temp;
}
}
}
for(i=0;i<n;i++)
{
printf("Marks: %d\nName: ",st[i].tot);
puts(st[i].ns);
printf("\n");
}
getch();
return 0;
}

int comp(char *a , char *b)
{
int i=0; int chaar=0;
while((a[i]!=”) || (b[i]!=”))
{
if(a[i]!=b[i])
{
if((a[i]-b[i])>0)
return 1;

else

return -1;
chaar=1;

}
i++;
}
if(chaar==0)
{
return 0;
}

}

void concat(char *a,char *b)
{
int i=0,k=0;
while(k>=0)
{

if(a[i++]==”)
{
–i;
while(b[k]!=”)
{
a[i++]=b[k++];
}
a[i]=”;
k=-1;
}
}
printf(“\n\n”);
puts(a);
}

void print(int v[], int size)
{

for(int i=0;i<size;i++)
{
cout<<v[i];
}
cout<<”\n”;
}// end of print

void permute(int v[], int start, int n)
{
if(start == (n-1))
{
print(v,n);
}

else
{
for(int i=start;i<n;i++)
{
int tmp=v[i];
v[i]=v[start];
v[start]=tmp;
permute(v,(start+1),n);
v[start]=v[i];
v[i]=tmp;
}

}
}

CLICK HERE TO DOWNLOAD

include //header files
#include //header files
#include //header fles
#include //header files
struct clss
{ int clas; //structure to store class name
}; //end of structure

struct student
{clss sec; //structure to store name,roll, house of student
char name[50];
int roll;
char house[10];
}; //end of structure

void main()
{cout<>o; //entering the number of students
student stu['o']; //declaring the structure variable
clrscr();
int s=0,in=0,as=0,en=0; //initializing of variables
for(int i=0;i<o;i++)
{cout<<”enter your name::”;
gets(stu[i].name); //entering name
cout<>stu[i].roll; //entering roll number
cout<<”enter your house::”;
gets(stu[i].house); //entering house name
if(strcmp(stu[i].house,”symphony”)==0)
{s++;
} //incrementing the counter if the house is symphony

else
if(strcmp(stu[i].house,”invocation”)==0)
{in++;
} //incrementing the counter if the house is invocation
else
if(strcmp(stu[i].house,”aspiration”)==0′)
{as++; //incrementing the counter if the house is aspiration
}
else
{en++; //incrementing the counter if the house is enterprise
}
cout<>stu[i].sec.clas; //entering the class of student
}
for(int j=0;j<o;j++)
{puts(stu[j].name); //printing the name of student
cout<<stu[j].roll<<endl; //printing the roll of student
puts(stu[j].house); //printing the house of the student
cout<< “class::”<<stu[j].sec.clas<<; //printing the classs of the student
}
cout<<” the number of students belonging to aspiration::”<<as<<endl;
cout<<”the number of students belonging to enterprise::”<<en<<endl; //printing the number of students belonging to each house
cout<<”the number of students belonging to invocation::”<<in<<endl;
cout<<”the number of students belonging to symphony::”<<s;

getch();
} //end of program

CLICK HERE to download them.

It’s in .rar format. So you need win rar to open them.

}
void cirque::pop()
{
if(front==NULL)
{
cout<<”ciccular queue is empty”;
return;
}
node *temp;
temp=front;
cout<<endl<<”deleted item is”<<front->data;
if(count>0)
front=temp->link;
rear->link=front;
count–;
delete temp;
}
void cirque::display()
{
if(front==NULL)
{
cout<<endl<<”queue is empty”;
return;
}
int local = count;
node *temp;
temp=front;
cout<<endl<<”queue elements are “;
while(local)
{
cout<<” “<<temp->data;
temp=temp->link;
local–;
}
}
cirque::~cirque()
{
if(front==NULL)
{
cout<<endl<<”no memory used”;
return;
}
node *temp;
int n=0;
while(front->link!=rear->link)
{
temp=front;
front=front->link;
delete temp;
cout<<endl<<++n<<” “<<”deleted “;
}
}
int main()
{
cirque q;
q.push(1);
q.display();
q.push(2);
q.display();
q.push(3);
q.display();
q.push(4);
q.display();
q.pop();
q.pop();
return 0;
}

/*second program using array*/
#include<iostream>
using namespace std;
#define MAX 7  /*for array size*/
class cirq
{
private:int arr[MAX];
int front,rear,count;  /*count to know the no of ele. Present in array.*/
public:
cirq();
void push(int n);
void pop();
void display();
~cirq();
};
cirq::cirq()
{
front = rear =-1;
count=0;
}
void cirq:: Push(int n)
{
if(count<MAX)
{
if(front ==-1)
{
front=rear=0;
}
else if(rear==MAX-1)  /* if rear is at maximum position then bring it in starting*/
rear=0;
else
rear++;
arr[rear]=n;
count++;
}
else
{
cout<<endl<<”queue is full don’t enter now”;
}
}
void cirq::pop()
{
if(count>0)
{
cout<<endl<<”deleted item is”<<arr[front];
if(front==MAX-1)  /* if front is at maximum position then bring it in starting*/
front=0;
else
front++;
count–;
}
else
cout<<endl<<”circular queue is empty”;
}
void cirq::display()
{
int local = count;
int front1=front;
if(local<0)    /*if there is no element in quque*/
{
cout<<endl<<”circular queue is empty”;
}
else
{
cout<<endl<<”circular queue elements are: “;
while(local)
{
cout<<endl<<arr[front1];
if(front1==MAX-1)   /* if front is at maximum position then bring it in starting*/
front1=0;
else
front1++;
local–;
}
}
}
cirq::~cirq()
{
}
int main()
{
cirq q;
q.push(1);
q.push(2);
q.push(3);
q.push(4);
q.push(5);
q.push(6);
q.push(7);
q.display();
q.pop();
q.display();
q.push(8);
q.display();
q.push(9);
q.display();
return 0;
}