Honestly one of the best subjects I've done at UniMelb so far. The content is heavy as you go through asymptotic analysis, sorting algorithms, graph algorithms, dynamic programming, greedy algorithms, and complexity theory (P vs NP territory), but the way it's structured means each week builds logically on the last. If you keep up with the lectures you won't feel lost. The lecturer explains things clearly. The tutorials are where the real learning happens though by actually working through problems on the board cements things in a way that just watching lectures doesn't. Assessment-wise there are assignments that test the application of concepts, and a final exam that's challenging but fair. The assignments took time but were genuinely satisfying to complete. A few things I'd tell anyone starting this subject: Start the assignments early. They look manageable until they don't. Do the tutorial problems yourself before checking solutions since that's where the exam prep actually happens. The textbook is dense but useful as a reference when lecture notes aren't enough. I got H1 and I think anyone willing to put in consistent work can do well. It's not a subject you can cram, it rewards steady effort over the semester. Would strongly recommend to anyone in MIT, especially if you're going into software engineering, AI, or anything systems-related. The problem-solving mindset you build here carries over into everything.

Wonderful subject. Perfect level of challenge and so interesting - the assignments could get really difficult but in a cool way. Toby is an excellent lecturer and my tutor was great as well. This is a very high level subject so you won't be doing any actual programming but it's just as fun.

Pretty interesting subject, although I'm surprised it doesn't have some sort of Calculus prerequisite. There were a few admin hiccups this semester (during Covid-19), but overall a well taught subject

Incredibly useful subject to teach the basics of Algorithms. A solid understanding of Mathematics is crucial to getting a good mark in this subject!

The subject is really handy for your future. But they covered many topics which may be very challenging if you don't have Math or CS background. In our semester (2017-1) mid-semester exam timing was the issue. So I recommend learning not only to solve the problem but also to do it fast. If you are very good at algorithms, you might find it enjoyable subject.

Its a very good subject to have grasp on. You can enter any giants like microsoft , facebook to secure a job based on on this subject. Even google ask a lot of question related to sorting technique which is taught in this subject. It is considered as a core subject to develop fundamentals for programming, research and IT.