Q1: a) 5 points for an algorithm idea and 5 points for the naive algorithm. (10 pts. total)

b) 5 points for an algorithm idea, 10 points for the recursive algorithm, 5 points for justifying the correctness of your algorithm, and 10 points for proving the runtime by solving the recurrence relation. (30 pts. total)

Q2: a) 5 points for an algorithm idea, 10 points for the algorithm details, 5 points for a proof idea, 10 points for the proof of correctness, and 5 points for proving the runtime. (35 pts. total)

b) Since solving this part means you don’t have to do part a), the 10 points for this part will be distributed as 5 more points for the alg. idea, and 5 more points for the algorithm (in addition to the point distribution for part a). (10 pts. total)

Q3: 3 points each for: algorithm idea, algorithm, proof idea, proof of correctness, and analysis of runtime. (15 pts. total)

### Like this:

Like Loading...

*Related*

## Leave a Reply