Design of Algorithms
COMP20007 is rated by StudentVIP members:
TextbooksSell your textbook for COMP20007
Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
For sale by Adam for $45
NotesView all COMP20007 notes
We don't have any notes for this subject yet.
Why don't you list yours first?Sell your notes for COMP20007
TutorsBecome a tutor for COMP20007
$40 per hour
I recently finished my Bachelor of Science majoring in Mathematics and Statistics with a third year...
$40 per hour
Hey everyone! I am currently doing a Masters of Software Engineering. Before this I did a Bachelors...
$40 per hour
Hey guys, I am currently in my last year of BSc, majoring in Computing and Information Systems. My W...
$50 per hour
Hi, I'm a graduate from Melbourne university, being major in Computing and Software System (Bach...
This is easily the worst 2nd year Computer Science subject. It is unnecessarily hard and poorly taught. The lecturer speaks very slowly and always goes off on a tangent every 10 minutes. The content of the subject includes Big O, Sorting, Quick select, Binary Tree, Graph, Hash table, Dynamic Programming, Information Theory. There are two assignments. For 2018, the first one was basically implementing counting sort and heap sort and the second one was applying hash table. Most of the code was given to you. Everything is pretty easy. As I said above, the subject is very poorly taught. Most of what you learn will be from the tutorial, NOT the lecture. The tutors are extremely nice. The mid-sem was a disaster. The lecturer overestimated the exam and had to give everyone an extra mark. There is nothing that prepares you for it. The final exam is unnecessarily hard. They had to make the exam much harder because too many people 'passed' the subject in the previous year. Again nothing prepares you for it. I managed to get a H1 but with a bad taste in my mouth. Overall, bad and useless subject. Good luck to you.
Anonymous, Semester 1, 2018
Very interesting and engaging subject overall. The content was a bit tricky to understand at times (Graph algorithms, Hash table algorithms etc.) but if you persist on the material presented to you, you will succeed! Assignments were very well structured and of reasonable difficulty. The exam was extremely fair and although a bit tricky, if you have studied all the lecture slides and completed the tutorial exercises (good indicators) you will easily get a H2 and above