1. The objective of the project is to practise the implementation and application of dynamic data structures (eg lists, trees etc) and memory management. Using of dynamic data structures is a sine qua non condition. 2. Application of STL containers (eg vector, list etc) does not fulfil the condition stated in p. 1. 3. Dynamically allocated arrays do not fulfil the condition stated in p. 1. 4. The std::string type can only be used for strings (eg file names). It is not allowed to keep sequences of data (eg numbers) as strings. 5. Adatastructurehastoacceptedbyalaboratoryinstructorbeforeimplementation. 6. Source code has to be split into header (*.h) and source (*.cpp) files. 7. All functions have to be commented in the doxygen style. 8. Any permutation of command line switches has to be handled. Final exam grades are gathered in examination protocols. Each course has its own protocol in the following format: The first line keeps a course name, the second – professor’s name, and then students’ grades (one in each line) as tuples: hnameihsurnameihstudent IDihgradeihdatei Example of a protocol file: Introduction into Modern Genetics Rehor Mendel, PhD DSc Jan Jaworek 14332 3.5 2018-02-29 Bartłomiej Bukowy 14344 4.5 2018-01-30 Karol Krol 12433 3.0 2018-01-28 Number of protocols in not limited. Write a program that elaborated output files for each student separately.Student’sIDisafilename.Thefileholdsstudent’snameandsurnameandfinalgrades.Thecourses are presented as tuples: hprofessor’s nameihcourse nameihgradeihdatei The tuples are sorted by course names. Example output file for student Jan Jaworek: Jan Jaworek ID: 14332
Prof. Nicolaus Copernicus Mechanics of the Solar System 4.5 2018-01-14 Rehor Mendel, PhD DSc Introduction into Modern Genetics 3.5 2018-02-29 This is a command line program with a switch: -i input files with protocols
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here