Posted by: jeff | November 16, 2009

HW 9 Grading Rubric

Q1) a) 5 pts each for algorithm ideas and a naive algorithm
b) 10 pts for algorithm ideas, 10 pts for a detailed Divide & Conquer algorithm, 5 pts for a proof sketch, 5 pts for justifying O(log n) run time.
Q2) 8 pts each for: algorithm ideas, algorithm, proof ideas, proof of correctness, and analysis of the number of queries.
Q3) 4 pts each for: algorithm ideas, algorithm, proof ideas, proof of correctness, and analysis of the number of invocations of the tester.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: