Question

Can someone please post solution files
to problem sets 9, 10 and 11?

Answer 1

Which course, 2011 or 2008?

Answer 2

The 2011 course. You will help me a lot!!

Answer 3

PS9 - I actually did this in the 2008 course but it is the same: I have some xtra stuff in the file. I also have solutions from other people. - http://dpaste.com/1426275/

I haven't done ps10 - but I have figured out parts of it and understand the problem. I could help if you want to post yours and discuss it.

PS11 I did in the edX course - I've included both graph.py as well as the ps.py because I added some stuff to graph.py. I also have solutions from a couple of other people. http://dpaste.com/1426296/

Answer 4

Thank you very much for your help!! I'm working on problem set 10 and 11 now (ps11 is also slightly different in the 2011 course). When I'm done with that, I will post it.

At the end of problem set 9 they ask for the algorithmic complexity of the greedyAdvisor and bruteForceAdvisor in terms of the number of subjects.

Do you know what these complexities are?

Answer 5

@Janhenk - Are you asking if I know the answer or if i know what they are talking about when the say *complexities*?

Answer 6

I know what complexities in general are and I do understand the complexity of some simple programs that were showed during the lectures. But I'm not sure what it is for bigger programs like the one of the brute force algorithm of ps9..

Answer 7

You have to ask (yourself) questions like
- does it do a linear number of things ?
- does it do a linear number of things a linear number of times?
... how would you describe greedy and bruteForce?