Task : Student Score Management System (SSMS) 1. Experimental Description There are n (n>0 and n<=100) students and each

[answerhappygod]

Task Student Score Management System Ssms 1 Experimental Description There Are N N 0 And N 100 Students And Each 1 (181.81 KiB) Viewed 45 times

Task : Student Score Management System (SSMS) 1. Experimental Description There are n (n>0 and n<=100) students and each students includes of such data, student number (types: long or string), name (type: string), mathematical score (type: float or double ), programing score( type: float or double). Design a program/software with below functions: (1) Allocate memory dynamically to store the student information of SSMS. (2) Insert student information into SSMS. (3) Delete student information from SSMS based on some input, such as student name or ID (4) Sort the student information in SSMS based on mathematical score or programing score. 2. Experimental Requirements (1) The SSMS should have the following menu options (Level 1): New (Allocate the memory for n students); Add (Insert or add new student information into software system) Delete; (Delete student information) Sort; (Sorting all student data based on input, such as score) Query;(Find one student information based on input such as ID) Exit. (Exiting from this system) (2) Input the first upper bold character of each option aforementioned, the corresponding function or next menu is activated. For example, if the "A" is input, it means new student information will be inserted; if the “S” is input, it means “Sort” is selected and the level 2 menu option is present, which further includes of such options: Sort student list based on student name (Ascending or Descending);

Sort student list based on the mathematical/ programing score (Ascending or Descending); Sort student list based on the total score (Ascending or Descending); Besides, if the “ Query” is selected, the level 2 menu options should include of such functions, Query one student information using the input student name; Query all students mathematical/programing/total score; Notice, if the function is done successfully, the corresponding information is displayed on the main interface. Otherwise, some tips should be given. 3: Algorithm Specification Description (pseudo-code preferred) of all the algorithms involved for solving the problem, including specifications of main data structures. 4: Results Table of test cases. Each test case usually consists of a brief description of the purpose of this case, the expected result, the actual behavior of your program, the possible cause of a bug if your program does not function as expected, and the current status ("pass”, or "corrected", or "pending"). 5: Discussion and Conclusion Analyze of the founded problems and Comments on further possible improvements. 6: Appendix: Source Code At least 30% of the lines must be commented. Otherwise the code will NOT be evaluated.