Data Structures and Algorithms COMP2521 26T0

Week 2 Summary

Posted by Ethan Brown 💜 Sunday 18 January 2026, 11:39:16 AM.

Hi everyone!

Today marks the end of week two, so here's a summary of the week and things to look out for:

• In lectures, we went over trees (BSTs, balancing, and AVL trees), an intro to graphs (representations), and the assignment. The assignment involves a lot of tree traversal so please make sure you get a handle on that before attempting the assignment. We'll be continuing on with the graphs topic this coming week.
• In tutorials, we went over sorting algorithms, ADTs, and BSTs. It's a lot of content so if you haven't already I suggest going through anything your tutor didn't during the tutorial, or anything you struggled with. Solutions for it are released so you can check your answers!
• In labs, we went over creating functions on binary search trees. Again, something you'll want to get familiar with for the assignment! Lab 1 marks are also available for students without an extension. For those with an extension, we will run the marking next weekend.
• Quiz 1 is still technically able to be submitted, if you haven't already. Quiz 2 is also available, covering BSTs and graph representations, due this coming Wednesday.
• Tutorial 3 and Lab 3 are both available now, with the lab due Monday week 4.
• As a reminder, Thursday the 22nd of January is the last day to drop without penalty.
• Finally, the assignment was released on Tuesday, even with CSE going down! Please be sure to give it a read as soon as possible so you can think about how to approach it as you go about your day. We've finished the trees topic so you should have everything you need to complete the assignment for the most part. Some of the stuff we'll be covering this coming week on graphs may help with stage 3, or more likely stage 4. Also, check the forum! We've had a few questions, and as more students start the assignment you might benefit from reading the related questions. Just to be clear, you do not have to start stage 0, then do stage 1, then do stage 2, etc.. I personally suggest tackling some of the easier parts of stage 1 first, to get the basics working (such as FsTree and FsMkdir) so you can play around with a bit of confidence. For those planning to tackle stage 3, you may want to consider how symbolic links will affect your previous stage function implementations before you start on them, but I suggest getting it working without symbolic links first, and just keeping in mind to design around symbolic links so you can add them in later without too much hassle. Also, implementing error handling might be deceptively tricky - it's not as simple as just exiting the program if something goes wrong for this assignment...

Also, there are several regions in and around Sydney currently flooding. I don't know if these will be fine by tomorrow, but a reminder that the lectures are livestreamed, so if it's not safe to travel, please stay home.

All the best!

Week 1 Summary

Posted by Ethan Brown 💜 Sunday 11 January 2026, 02:11:00 PM.

Hi everyone!

Today marks the end of week one, so here's a summary of the week and things to look out for:

• In lectures, we went over recursion, analysis of algorithms, and sorting algorithms. Please make sure you're comfortable with these, especially recursion as we will be doing the trees topic this coming week, which involves lots of it.
• In tutorials, we went over some revision (in the prelim tute), recursion, and analysis of algorithms. Sorting algorithms will be touched on during tutorials in the coming week.
• In labs, we went over debugging using sanitisers (in the prelim lab), and recursion. If you are interested in practicing your knowledge of analysis of algorithms and sorting algorithms, take a look at the Sort Detective extra lab. Although we don't use valgrind and gdb throughout this course (sanitisers are pretty good), there's also an extra lab on those if you're interested. Please remember to submit your lab by Monday.
• Quiz 0 is still technically able to be submitted, if you missed doing it, going over some admin stuff. As for content, Quiz 1 testing recursion, analysis of algorithms, and sorting is due Wednesday.
• Tutorial 2 and Lab 2 are both available now, with the lab due Monday week 3.
• Help session schedules are drafted for the term. There may be some minor adjustments throughout the term, so please check the schedule to make sure nothing has changed before you plan to attend. These are a great opportunity to get help throughout the week.
• Consults will be held 2-3pm on Tuesdays starting this coming week, in Ainsworth 102 and online. Consult link will be posted on the Lectures page when they're happening.
• Finally, the assignment will be released on Tuesday, and we'll briefly go through the spec in lectures.

Hopefully the first week of the course is going smoothly for you all! The Summer term is very compressed so try to keep on top of things. All the best!

Prelim Tutorial and Week 1 Consultation

Posted by Ethan Brown 💜 Wednesday 07 January 2026, 03:39:16 PM.

Hi everyone!

Upon request, I will be running a "tutorial" for the prelim tute, and a consultation, on Friday. Both will run on zoom, and the link to join will be posted on the lectures page a bit before each session.

The tutorial will be recorded and posted on the prelim tutorial page soon after. This will be running at noon Friday, and should be around an hour.

The consult will not be recorded, and will run at 2pm Friday until 3pm.

Starting week 2, consults will be in-person and via zoom 2-3pm Tuesdays, just after the lecture. A link will be posted on the lectures page prior to the consult, and it will be in Ainsworth 102.