logo Use CA10RAM to get 10%* Discount.
Order Nowlogo

examination question class hierarchy was fully implemented in a menu-driven program an exam class was developed to load the exam from a file and display each question to the screen.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Part 1: Begin with the running program from your Phase 4 Individual Project where the examination question class hierarchy was fully implemented in a menu-driven program. An exam class was developed to load the exam from a file and display each question to the screen.

 Part 2: Modify the program from part 1 to change the menu to the following: Load an exam Take an exam Show exam results Quit Choice 1: No functionality change. Load the exam based upon the user's prompt for an exam file.

Choice 2: The program should display a single question at a time and prompt the user for an answer. Based upon the answer, it should track the score based upon a successful answer. Once a user answers the question, it should also display the correct answer with an appropriate message (e.g., "Good job" or "Better luck next time") Upon completion of the exam, the program should return the user to the menu.

Choice 3: The program should display the total points available and the total points scored during that exam. A percentage score should also be displayed. (Optional: if you choose to track which problems were missed, you could display that information for the user.) Choice 4: No change to this functionality from the Phase 4 IP. You should consider creating an additional class Student that will track student's score through methods such as addPointsPossible, addPointsScored, getPointsPossible, and getPointsScored. You should also enhance your Exam class to include methods getPointValue and getAnswer. You may also want to add a method to only display one question at a time, such as displayQuestion.

This is what i have from my last assignment: #include #include #include #include using namespace std; class exam { private: string examfile; public: exam(string examFileName) { examfile = examFileName; } bool loadExam() { ifstream file(examfile.c_str()); if (!file) { cout << "\nFile not found."; return false; } file.close(); return true; } void displayFile() { ifstream file(examfile.c_str()); string line; while (!file.eof()) { getline(file, line); cout << endl << line; } file.close(); } }; int main() { string examFileName; bool correctFileCheck; char ch = 'y'; while (ch == 'y' || ch == 'y') { int choice = 0; cout << "EXAM MENU\n\n"; cout << "1. Load an exam." << endl; cout << "2. Display the exam." << endl; cout << "3. Quit." << endl; cout << "\nEnter your choice : "; cin >> choice; if (choice == 1) { cout << "Enter the file name: : "; cin >> examFileName; exam t(examFileName); correctFileCheck = t.loadExam(); if (correctFileCheck) { cout << "\nLoaded successfully"; } } else if (choice == 2) { cout << "Enter the file name : "; cin >> examFileName; exam t(examFileName); correctFileCheck = t.loadExam(); if (correctFileCheck) { cout << "\nThe content of the file is" << " as follows:" << endl; t.displayFile(); } } cout << "\nEnter your choice : "; cin >> choice; if (choice == 1) { cout << "Enter the file name: : "; cin >> examFileName; exam t(examFileName); correctFileCheck = t.loadExam(); if (correctFileCheck) { cout << "\nLoaded successfully."; } } else if (choice == 3) { break; } else { cout << "\nWrong input: please enter" << " the correct input."; } cout << "\nDo you want to enter the choice " << "again? (y/n) : "; cin >> ch; } cout << "\nIts done! Thank you! Have a nice day!" << endl << endl; system("pause"); return 0; }

 

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

936 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

746 Answers

Hire Me
expert
Husnain SaeedComputer science

766 Answers

Hire Me
expert
Atharva PatilComputer science

652 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30