week 3 Quantititave Reasoning

login student portal

I will give you all the informtaion

THIS IS FOR OUTLINE ONLY

In this module you will continue to build a foundation for your Final Recommendation Report by building an outline. Remember that you must write your outline in complete sentences. You may use this template, or you may type your own. You do not have to answer each of these questions right now, but you must be able to give a full response to what you will be including. Be sure to post your response in the discussion board. You may copy and paste or upload an attachment.

1. Introduction
   • How will you set up your report?
   • What kind of background or historical information will you provide regarding your company, plan, etc.?
2. Problem Statement
   • What is the problem you are addressing?
   • Why is this a problem?
   • For whom is this a problem?
3. Purpose Statement
   • What is your reason for writing this report?
   • What do you hope to accomplish?
4. Scope
   • What will be included in your report?
   • What information will not be included in your report?
5. Discussion Section
   • What is the problem (if one exists)?
   • Why do you care?
   • Why should your reader care?
   • What kind of data have you collected to show that a problem/issue exists or that a change is needed?
   • How have your interviews/surveys helped to back up your specific claims?
   • Describe any research you have found relating to this issue.
   • What are several ways to change the situation?
   • What do experts say is the best way to change the situation?
   • What do you think will be best? Why?
   • What kind of budget will be needed?
   • What kind of timeline should be followed?
6. Conclusions and Recommendations
   • What have you learned from this research?
   • What do you hope others will learn from your report?
   • What are your final recommendations?
   • How you will measure the success of these recommendations if implemented?
7. Appendix and References
   • What kind of additional data will you need to provide in an appendix?
   • What kind of sources will you incorporate into your report?
8. Other Information
   • What are you most unsure of?
   • What are you most excited about?
   • Where do you think you need the most support or feedback?

Problem: Illegal Immigration

PLEASE LOOK AT DOCUMENTS ATTACHED

Darby and others,

Basaltic magma is classified as mafic; it is considered by scientists to represent the average composition of oceanic crust. Continental crust, meanwhile, approximates the chemistry of granite, a felsic rock. What do the terms mafic and felsic mean, and where do those names actually come from?

More importantly, how did the two different chemical compositions of crust develop in the first place, billions of years ago? That question is a tough one. If you want to take a crack at it, here is an article: https://www.scientificamerican.com/article/the-evolution-of-continental-crust-2005-07/ (Links to an external site.) and here is a hint: Different minerals have different melting/freezing points. Olivine forms from magma at a very high temperature, while quartz forms from magma at a much lower temperature.

The Research project needs to be completed by December 2,2019 at 3:00pm. The instructions are all listed in the class portal which you have logged in to

the code below is how I did selection sort, but now I need to do it with Tree Sort algorithm, I need to use that struct and vector. please do not use pointer, node, or class because I haven’t learn it. So the key is to code a Tree Sort algorithm for this project.

“

#include<iostream>
#include <fstream>
#include <vector>
#include <string>
#include <ctime> // clock(); CLOCKS_PER_SEC, clock_t

using namespace std;

//Create a new data type Student
struct Student {
string name;
double score;

};
/* Function Declaration*/
void FillVector(string fileName, vector<Student> & studentsList);
void DisplayStudent(vector<Student> & studentsList);
void StudentSort(vector<Student> & studentsList);
double getMilliSeconds(clock_t c);
void outputStudentsSort(vector<Student> & studentsList);

int main()
{
unsigned int t1, t2;
string fileName;
vector<Student> studentsList;

cout << “Enter name of the file: “;
getline(cin, fileName);

FillVector(fileName, studentsList);

cout << “nData of students Found in the text file:” << endl;
DisplayStudent(studentsList);

t1 = clock();
StudentSort(studentsList);
t2 = clock();
cout << ” nTime = ” << getMilliSeconds(t2 – t1) << “milliseconds” << endl;

cout << “nData of students sort by scored :” << endl;
DisplayStudent(studentsList);
outputStudentsSort( studentsList);

system(“pause”);
return 0;
}
//Function Definition
void FillVector(string fileName, vector<Student> & studentsList) {

ifstream inFS;
string name;
double score;
Student newStudent;

//open file
inFS.open(fileName);

if (!inFS.is_open())
{
cout << ” Could not open the file ” << fileName << endl;
cout << “Press any key …..” << endl;
cin.get();
exit(0);
}

//get information of the file
while (!inFS.eof())
{
inFS >> name >> score;
newStudent.name = name;
newStudent.score = score;
studentsList.push_back(newStudent);
}

//close file
inFS.close();
}
void DisplayStudent(vector<Student> & studentsList) {

for (int index = 0; index < studentsList.size(); index++)
{
cout << studentsList[index].name << “t” << studentsList[index].score << endl;
}
}
// Selection Sort by score
void StudentSort(vector<Student> & studentsList) {

int minIndex;
double tempScore;
string tempName;
// One by one move boundary of usorted subarray
for (int i = 0; i < studentsList.size() – 1; i++) {

minIndex = i; // minimal element index

for (int j = i + 1; j < studentsList.size(); j++) {

if (studentsList[j].score < studentsList[minIndex].score) {
minIndex = j;
}
}

// Swap the found minimum element with the first element
tempScore = studentsList[i].score;
studentsList[i].score = studentsList[minIndex].score;
studentsList[minIndex].score = tempScore;

tempName = studentsList[i].name;
studentsList[i].name = studentsList[minIndex].name;
studentsList[minIndex].name = tempName;
}

}
void outputStudentsSort(vector<Student> & studentsList) {
ofstream OutFS;
OutFS.open(“SelectionSortStudents.txt”);

for (int index = 0; index < studentsList.size(); index++)
{
OutFS << studentsList[index].name << “t” << studentsList[index].score << endl;
}
OutFS.close();
}
double getMilliSeconds(clock_t c) {
double time;
time = (double(c) / CLOCKS_PER_SEC) * 10000;
return time;
}