Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Program is to create a file student.dat:
Program is to create a file student.dat which contains all name, roll_no,marks(5 sub) and percentage
class student
{
private:
char name[20];
int roll;
int marks[5];
int total;
float perc;
public:
student()
total=0;
}
void input();
void output();
};
void student::input()
clrscr();
cout<<" enter your name ";
gets(name);
cout<<" enter your roll no. ";
cin>>roll;
cout<<" enter the marks of five subjects "<<"\n";
for (int i=0;i<5;i++)
cout<<" enter marks";
cin>>marks[i];
total=total + marks[i];
void student::output()
perc=total/5;
if (perc>=60)
cout<<" the name is "< cout<<" the total marks obtained out of (500) "< cout<<" the percentage "< } else cout<<" the percten tage is less then 60 "; } void main() { clrscr(); student info; fstream file; file.open("student.dat",ios::in|ios::out); int n; cout<<" enter the number for which u want to enter data"; cin>>n; for(int i=1;i<=n;i++) { info.input(); file.write((char *)& info,sizeof(info)); } file.close(); file.open("student.dat",ios::in); while(file) { file.write((char *)& info,sizeof(info)); info.output(); } file.close(); }
cout<<" the total marks obtained out of (500) "< cout<<" the percentage "< } else cout<<" the percten tage is less then 60 "; } void main() { clrscr(); student info; fstream file; file.open("student.dat",ios::in|ios::out); int n; cout<<" enter the number for which u want to enter data"; cin>>n; for(int i=1;i<=n;i++) { info.input(); file.write((char *)& info,sizeof(info)); } file.close(); file.open("student.dat",ios::in); while(file) { file.write((char *)& info,sizeof(info)); info.output(); } file.close(); }
cout<<" the percentage "< } else cout<<" the percten tage is less then 60 "; } void main() { clrscr(); student info; fstream file; file.open("student.dat",ios::in|ios::out); int n; cout<<" enter the number for which u want to enter data"; cin>>n; for(int i=1;i<=n;i++) { info.input(); file.write((char *)& info,sizeof(info)); } file.close(); file.open("student.dat",ios::in); while(file) { file.write((char *)& info,sizeof(info)); info.output(); } file.close(); }
else
cout<<" the percten tage is less then 60 ";
void main()
student info;
fstream file;
file.open("student.dat",ios::in|ios::out);
int n;
cout<<" enter the number for which u want to enter data";
cin>>n;
for(int i=1;i<=n;i++)
info.input();
file.write((char *)& info,sizeof(info));
file.close();
file.open("student.dat",ios::in);
while(file)
info.output();
Call by reference: Arguments to a function can be passed in two way; one by call by value and other by call by reference. Call by value is passed either through a constant
program that decode the sending smuggler string.
Project Description: We want to generate premium numbers for one of our application. What we need is: A program that generate 2, 3, 4, 5, 6, 7, 8 digits premium numbers
Implementation of the Stack class in C++: How to implement stack class in c++. int Stack::push(int elem) { if (top { list[top++] = elem; r
A cl a s s c a n b e d e f i n e d i n s i d e a b l o c k o r f u n c t i o n. T h i s t yp e cla s s i s known
given integer ''n'' and permutation of numbers 1,2,..n-1, c program to print permutation that lexicograghically precedes given input permutation if permutation is least print input
Readers Writers with Processes and Threads Write two programs implementing ``reader pritority readers-writers synchronization'''' on files. One program will use processes, created
A: Name mangling is the rule according to which C++ modify function's name into function signature before passing that function to a linker. It is how the linker differentiates amo
Program is to store marks and name, roll no in a file: class stud { int rno; char name[20]; int m1,m2,m3; public: void acce
The Best fit algorithm: The best fit method occurs the smallest free block whose size is greater than or equivalent to n. An algorithm to get such a block by traversing the whole
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd