Data Structures and Algorithms

COMP254Rubrics
Correct implementation of the requirements
40 %
Successful testing of the solution
40%
You must have a fully working implementation of the requirements for this section
to be reviewed and marked. Otherwise this section will default to Zero
Video with clear explanation of the solution & testing
20%
Total
100%
If any of the above items are missing you will receive a zero for this assignment.
© 2014 Goodrich, Tamassia, Goldwasser
Arrays
3
COMP254
Academic Integrity
• PLAGIARISM is an Academic Offence
• Doesn’t help you learn the course material
• Giant waste of your time and mine
• Causes mark penalties and transcript annotations
© 2014 Goodrich, Tamassia, Goldwasser
Arrays
4
Exercise 1 – 5 Marks
Give a big-Oh characterization in terms of n, of the running time of the
following code fragments
Marking Schema
❑ 3 Marks for proper proof
❑ 2 Marks for final answer
© 2014 Goodrich, Tamassia, Goldwasser
Arrays
5
Exercise 2 – 5 Marks
Perform an experimental analysis on the two algorithms & Visualize their running
times as a function of the input size with a log-log chart.
1. prefixAverage1
2. prefixAverage2.
Marking Schema
❑ 3 Marks for code that performs the experimental analysis –
Data Gathering
❑ 2 Marks for code that conducts the visualization of the
results.
© 2014 Goodrich, Tamassia, Goldwasser
Arrays
6