OOP Assignment 2

 #include <iostream>

#include <fstream>
using namespace std;

struct student {
char regno[9];
float gpa;
char name[10];
};

int main (){
ifstream datastream("studentsdata.txt");
if (!datastream) {
cerr<<"Error opening file"<<endl;
exit(-1);
}

int num = 0;
datastream >> num;

// allocate memory for num student objects
student * p = new student[num];
if (p==NULL) {
cerr<<"Error allocating memory"<<endl;
exit(-1);
}

for (int i=0; i<num; i++){
datastream >> p[i].regno >> p[i].gpa >> p[i].name;
}

int beststudent = 0;
float bestgpa = 0.0;
for (int i=0; i<num; i++){
if (p[i].gpa > bestgpa){
bestgpa = p[i].gpa;
beststudent = i;
}
}

cout << "The best student of class is:"<<endl;
cout << "Name: "<< p[beststudent].name << endl;
cout << "Regno: "<< p[beststudent].regno << endl;
cout << "gpa : "<< p[beststudent].gpa << endl;

return 0;
}
// from now onward its the second question

#include<iostream>
#include<cmath>
#include<fstream>
using namespace std;
struct point{
float x;
float y;
};
float disatace_cal(float a , float b , float c , float d){
return sqrt(pow((b - a), 2) + pow((d - c), 2));
};
int main(){
ifstream datastream("C:\\Users\\Administrator\\Downloads\\pointsdata.txt", ios::in);
if(!datastream){
cerr<<"fail to open file!"<<endl;
exit(-1);
}
int looper = 0;
datastream>>looper;
point *ptr = new point[looper];
if(!ptr){
cerr<<"fail to allocate dynamic memory!"<<endl;
exit(-1);
}
for(int i = 0; i < looper ; i++){
datastream>>ptr[i].x>>ptr[i].y;
}
float distances[5];
for(int i = 0 ; i < looper/2 ; i++){
distances[i] = disatace_cal(ptr[i+1].x , ptr[i].x , ptr[i+1].y , ptr[i].y);
}
for(int i=0; i <looper/2 ; i++){
cout<<distances[i]<<endl;
}
float result[3];
result[0] = distances[1] - distances[0];
for(int i = 0 ; i < 2 ; i++){
result[i+1] = distances[i+2] - distances[i+1];
}
float max =0;
for(int i =0 ; i < 2 ; i++){
if(max < result[i]){
max = result[i];
}
}
cout<<"The maximum difference is "<<max;
}

Comments

Post a Comment

Popular posts from this blog

OOP Assignment 3 helping materials

 Following is the code that will help you in the assignment for the addition of the arrays using operator overloading and returning an object. #include<iostream> using namespace std; int num; struct add {     int ar[20]; }; add operator+(add &a1,add &a2) {     add a3;     for(int i=0;i<num;i++)         a3.ar[i]=a2.ar[i]+a1.ar[i];     return a3; } int main() {     add a1,a2,a3;     cout<<"How many elements to be stored (max 20) : ";     cin>>num;     cout<<"Enter elements of array a1 : ";     for(int i=0;i<num;i++)         cin>>a1.ar[i];     cout<<"Enter elements of array a2 : ";     for(int i=0;i<num;i++)         cin>>a2.ar[i];     a3=a1+a2;     cout<<"Addition of two arrays : ";     for(int i=0;i<num;i++)   ...
Read more

Square root Algorithm in C++

 Here is the way you can find the square root of any number by writing your own code in c++.  #include<iostream> using namespace std; double sqrt(double num){ double stop_condition = 0.00000001; double guess = num/2; while((guess-num/guess) > stop_condition){ guess = (guess+num/2)/2; } return guess; } int main(){ double num = 4; cout<<"The result is: "<<sqrt(num)<<endl; return 0; }
Read more

OOP lab 7 task solution

  #include <iostream> using namespace std ; class position { public: int x ; int y ; position (){ x = 0 ; y = 0 ; } position operator + ( position & p_any ){ position p1 ; p1 . x = this -> x + p_any . x ; p1 . y = this -> y + p_any . y ; return p1 ; } }; int main (){ position p1 ; cout<< "Enter the intial values of x and y cordinates: " ; cin>> p1 . x >> p1 . y ; position p2 ; cout<< "Enter the new values for x and y to be shifted: " ; cin>> p2 . x >> p2 . y ; position p3 ; p3 = p1 + p2 ; cout<< "The initial values were: " << p1 . x << " " << p1 . y <<endl; cout<< "The new values are: " << p3 . x << " " << p3 . y <<endl; } // from now onward this is the second task #in...
Read more