Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

1) Write validation for student names that reject strings with odd chars like % or @ You may use c_str, isalpha(), and ispace() functions from

image text in transcribed image text in transcribed image text in transcribed image text in transcribed image text in transcribed

1) Write validation for student names that reject strings with odd chars like % or @ You may use c_str, isalpha(), and ispace() functions from c-string and string classes/libraries 2) Write a function to validate grade data (boolean?) #include ID = ID; this - score-score; // Score to grade conversion if(score=93) "A" if (score-92 && score-90) this -grade "A-" if (scorex-87 && score grade B" if (score>-80 && score=77 && score-70 && score grade = "D+"; if (score>-60 && score-66) this -grade "D" if (score-0 && scorei; : coutname; cout>ID; : coutmark; :// A new student is created and added to the vector s.setstudent (name, ID, mark); list.push_back(s); :I/To display the data if (i--2) :int id; : cout>id; int j-e; for(j-0; j>id; :int j-o; :for (j-0; jlist.size(O; j+) if(list[j].ID--id)f :Student s string name; // Finds the location of the student in the roster using student ID :int ID; i int score; cout>name; :;cout>ID; :; cout>id; : ID to delete:"; :11 1. Traverse until you find the student :// 2. Stack all the students after the required student's location :I/ 3. Pop the student to be deleted :// 4. Put back the stacked students for(int ja; j

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Pro Oracle Fusion Applications Installation And Administration

Authors: Tushar Thakker

1st Edition

1484209834, 9781484209837

More Books

Students also viewed these Databases questions

Question

Complexity of linear search is O ( n ) . Your answer: True False

Answered: 1 week ago