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 store marks and name, roll no in a file:
class stud
{
int rno;
char name[20];
int m1,m2,m3;
public:
void accept()
cout<<"enter the roll no. : ";
cin>>rno;
cout<<"enter the name : ";
gets(name);
cout<<"enter marks of 3 subjects : ";
cin>>m1>>m2>>m3;
}
};
void main()
clrscr();
stud s;
s.accept();
ofstream a ("stud.dat" , ios::binary | ios::app);
a.write ( (char *) &s , sizeof(s) );
a.close();
how to convert a general tree into binary tree with example
Project Description: LOOKING TO DEVELOP A ONLINE POKER Web Application. WEBSITE WILL BE DEVELOPED OVER THE NEXT 6 MONTHS Duration & WILL REQUIRE FULL SOFTWARE CODING OF WEB
Explain The Type Conversion in Expressions in c language? When variables and constants of different types are used in an expression they are all converted to same type. The com
how to write the code for operation research
Write a program that finds the minimum total number of shelv, C/C++ Programming
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with thes
Implement a Algorithm to verify if the link list is in Ascending order? A: template bool linklist::isAscending() const{ nodeptr ptr = head; while (ptr->_next)
write a c++ program, that finds the minimum total number of shelves, including the initial one, required for this loading process.
Create Complex number using constructor: class complex { private:
a program code for superposition of sine waves
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