Evaluate the run-time and memory of data structures that could be used to address the requirements. In a previous assignment, you created pseudocode to do the following:
Define how the program opens the file, reads the data from the file, parses each line, and checks for formatting errors.
Show how to create course objects, so that one course object holds data from a single line from the input file.
Using this pseudocode written for the previous assignments, analyze the worst-case running time of each, reading the file and creating course objects, which will be the Big O value. This should not include the pseudocode written for the menu or the sample schedule above. To do this, do the following:
Specify the cost per line of code and the number of times the line will execute. Assume there are n courses stored in the data structure.
Assume the cost for a line to execute is 1 unless it is calling a function, in which case the cost will be the running time of that function.
Based on the advisor’s requirements, analyze each data structure (vector, hash table, and tree). Explain the advantages and disadvantages of each structure in your evaluation.
Now that you have analyzed all three data structures, make a recommendation for which data structure you will plan to use in your code. Provide justification for your recommendation, based on the Big O analysis results and your analysis of the three data structures.Evaluate the run-time and memory of data structures that could be used to address the requirements. In a previous assignment, you created pseudocode to do the following:
Define how the program opens the file, reads the data from the file, parses each line, and checks for formatting errors.
Show how to create course objects, so that one course object holds data from a single line from the input file.
Using this pseudocode written for the previous assignments, analyze the worst-case running time of each, reading the file and creating course objects, which will be the Big O value. This should not include the pseudocode written for the menu or the sample schedule above. To do this, do the following:
Specify the cost per line of code and the number of times the line will execute. Assume there are n courses stored in the data structure.
Assume the cost for a line to execute is 1 unless it is calling a function, in which case the cost will be the running time of that function.
Based on the advisor’s requirements, analyze each data structure (vector, hash table, and tree). Explain the advantages and disadvantages of each structure in your evaluation.
Now that you have analyzed all three data structures, make a recommendation for which data structure you will plan to use in your code. Provide justification for your recommendation, based on the Big O analysis results and your analysis of the three data structures.
Last Completed Projects
| topic title | academic level | Writer | delivered |
|---|