STUDENT MARK DETAILS USING C++


/*STUDENT MARK DETAILS USING FUNCTION TYPES */

PROGRAM:

#include<iostream.h>
#include<conio.h>
int sum(int,int,int);
void grade(int);
class stu
{
private:
 int rno,m1,m2,m3,tot,avg;
 char name[50];
public:
 void getdata();
 void putdata();
};
void main()
{
 class stu s[50];
 int i,n;
 clrscr();
 cout<<"\n\t STUDENT MARK DETAILS USING FUNCTION TYPES";
 cout<<"\n\t ************************************************";
 cout<<"\n Enter the no of students:";
 cin>>n;
 for(i=1;i<=n;i++)
 s[i].getdata();
 cout<<"\n\t ANNA UNIVERSITY COIMBATORE ";
 cout<<"\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~";
 cout<<"\n RNO \t NAME \t MARK1 \t MARK2 \t MARK3 \t TOTAL \t AVG \t GRADE \n ";
 for(i=1;i<=n;i++)
 s[i].putdata();
 cout<<"\n~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~";
 getch();
}
void stu::getdata()
{
 cout<<"\n Enter Rno:";
 cin>>rno;
 cout<<"\n Enter Name:";
 cin>>name;
 cout<<"\n Enter three subject marks:";
 cin>>m1>>m2>>m3;
 tot=sum(m1,m2,m3);
 avg=tot/3;
}
void stu::putdata()
{
 cout<<"\n"<<rno<<"\t"<<name<<"\t"<<m1<<"\t"<<m2<<"\t"<<m3<<"\t"<<tot<<"\t"<<avg;
 grade(avg);
}
int sum(int a,int b,int c)
{
 int tot;
 tot=a+b+c;
 return(tot);
}
void grade(int a)
{
 if(a<50)
 cout<<"\t FAIL";
 else if(a>=50&&a<60)
 cout<<"\t B GRADE";
 else
 cout<<"\t A GRADE";
}




















OUTPUT:

         STUDENT MARK DETAILS USING FUNCTION TYPES
         ************************************************
 Enter the no of students:2

 Enter Rno:101

 Enter Name:VIVEK

 Enter three subject marks:
70
75
78

 Enter Rno:102

 Enter Name:VINOTH

 Enter three subject marks:
54
34
55

ANNA UNIVERSITY COIMBATORE
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 RNO     NAME    MARK1   MARK2   MARK3     TOTAL           AVG     GRADE

101     VIVEK            70           75            78                 223                74       A GRADE
102     VINOTH         54           34            55                 143                47       FAIL
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Comments

Post a Comment

Popular posts from this blog

TRAVELING SALESMAN USING BRANCH AND BOUND TECHNIQUE

Image
The Traveling Salesman Problem (TSP) is a classic problem in computer science and optimization theory. The problem is defined as follows: given a set of cities and the distances between them, find the shortest possible path that visits each city exactly once and returns to the starting city. The Branch and Bound technique is an algorithmic paradigm for solving combinatorial optimization problems. The basic idea is to explore the search space by dividing it into smaller subproblems, and then pruning branches of the search tree that can be shown to lead to suboptimal solutions. The branch and bound algorithm for the TSP works by starting with an initial lower bound on the length of the optimal tour, and then exploring the search space by systematically building up partial tours and computing lower bounds on their completion. Sample C code for solving the Traveling Salesman Problem(TSP) using the branch and bound technique: #include <stdio.h> #include <stdlib.h> #include ...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - FIRST FIT, BEST FIT, WORST FIT ALGORITHM

FIRST FIT, BEST FIT, WORST FIT ALGORITHM PROGRAM: #include<stdio.h> int mem[20],proc[20],bp[20],bm[20],cm[20],cp[20],ms,ps,i,j,ch,y; main() {             printf(“\nEnter the number of memory segments”);             scanf(“%d”,&ms);             printf(“\nEnter the memory segment”);             for(i=0;i<ms;i++)             {                         scanf(“%d”,&mem[i]);                         bm[...
Read more

OPERATING SYSTM’s ALGORITHM (In LINUX OS) - BANKERS ALGORITHM

BANKERS ALGORITHM – SINGLE RESOURCES PROGRAM: #include<stdio.h> main() { int j=0,cmp=0,i,tot,avail,need[20],n,tr,max[20],hold[20]; printf("Enter the number of process"); scanf("%d",&n); printf("Enter the number of resources"); scanf("%d",&tr); printf("Enter the max,need,hold for each process"); for(i=0;i<n;i++) { printf("p%d",i); scanf("%d",&max[i]); scanf("%d",&hold[i]); } tot=0; for(i=0;i<n;i++) { tot=tot+hold[i]; need[i]=max[i]-hold[i]; } avail=tr-tot; while(j!=tr) { for(i=0;i<n;i++) { if(need[i]!=0&&need[i]<=avail) { avail=avail+hold[i]; need[i]=0; printf("%d\t%d\n",i,avail); cmp++; } } j++; } if(avail==tr) printf("safe state"); else printf("unsafe state"); }
Read more