Dear All,
Thank you for taking Comp2521 this term. It has been great teaching this course together with Dr. Xue, our great admin team with Kevin Luxa, Ethan Brown and Ryan Berlee and our awesome tutors. I hope you enjoyed the course and learnt many interesting data structures, did a lot of problem solving, wrote algorithms and did a lot of coding!
The final exams are scheduled on Friday, 29 November 2024. Exam information is here. https://webcms3.cse.unsw.edu.au/COMP2521/24T3/resources/102368
If you are unable to take the final exam, please contact Special Considerations immediately. Supp Exams will be held on Tuesday, 21 January, 2025.
Wish you all the best!
Sushmita
Hello Everyone,
Our Assignment 2 has been released and it will contribute 15% to the final mark.
Best,
Hao
Hello Everyone,
I hope you're enjoying the course so far! 😊
For Week 5, since Monday is a public holiday, we won’t have our usual in-person lecture. Instead, I’ve recorded a lecture on graph traversal, which you can access [ here ].
If you'd like, I’ll also be available on YouTube on Monday from 2 to 3 pm (our usual starting time) to quickly go over the graph traversal methods and answer any questions you may have after watching the recorded lecture.
Enjoy the holiday!
Best regards,
Hao
Dear All,
We are about to start Week 4. Here's a brief recap of what we have learnt so far.
Week 1: We also discussed about recursion. We have seen many examples of recursion in the last three weeks. We have seen these in sorting algorithms (merge sort, quick sort), binary search trees etc. In week 1 we also introduced the concept of time complexity. Time complexity tells the amount of time it takes to execute an algorithm. We introduced the notation O, \Omega, \Theta and discussed how to describe to asymptotic behaviour of algorithms.Time complexity forms the essential part is the analysis of algorithms. In this course we will analyse the time complexity of all algorithms that we learn.
Week 2: We learnt sorting, or arranging items in some order. We discussed three important properties of sorting algorithms, stability, adaptability, in-place property. We learnt a number of number of comparison based sorts and radix sort. It was amazing to see how when you really think you can we come up with our own algorithms. We discussed how to choose techniques and algorithms appropriately. Which algorithm to use and when. This will recur throughout this course and always: how to make good choices of algorithms given a "real" problem.
Week 3: We learnt about abstract data types and some conventions to follow during implementation. We discussed about stacks, queues, sets and explored how these can be implemented using arrays and linked lists. We discussed what data structure to use and when. We also discussed about tree data structure and discussed binary trees and binary search trees. We will continue with balanced trees in week 4.
I hope you are taking your labs and tutorials extremely seriously and coding regularly. Practice, practice, practice and think how you will solve some of the problems around you using step by step approach (think algorithmically).
See you in week 8, I will be around to answer questions if you have any.
Sushmita
Hi everyone,
If you are in one of the following classes, please note that the locations for the lab part of your classes (last 2 hours) on the timetable page are currently incorrect. Here are the correct locations:
Hello Everyone,
Welcome to COMP2521, 24T3!
COMP2521 is Data Structures and Algorithms.
In this course, we're going to be exploring the various ways that computers organise and process data to solve different problems. On top of that, we will be examining how well these different methods
scale.
Computers are extremely fast, so the code you write with your basic knowledge may work well with a small amount of data, but what if there are millions or billions of data items? How feasible will it be then? That's the question we will keep asking throughout this course.
Data structures and algorithms form the foundations of computer science and engineering and no doubt understanding these will help you not only in your program but your professional journey as a programmer/software engineer/computer scientist...
I will be teaching this course together with Dr. Hao Xue. Kevin Luxa and Ethan Brown are our awesome Admins who have been working on this course for many terms. We also have 30+ tutors who are very supportive and dedicated. We are so happy to help you in this course.
Key information:
I look forward to seeing you on Monday!