Time flies! By this time next week (Monday morning), you'll be sitting for your final exam.
This week, we'll focus on the importance of measuring and optimizing execution time to develop efficient programs. We'll explore techniques and profiling tools to identify "hot spots" and improve program performance.
Tomorrow (Tuesday), we'll wrap up lectures for the term, review the course, and address any questions you have about the exam. If you need help, online forum support and "Help Sessions" will be available later this week.
Don't forget to submit the assignment before today's deadline.
See you tomorrow!
Cheers
Ashesh
This week, we will continue exploring sorting algorithms , focusing on the lower bounds for comparison-based sorting. Additionally, we’ll discuss a sorting algorithm designed to address some challenges by imposing specific preconditions.
We will also cover three abstract data types - Heaps , Priority Queues , and Hashing - and their potential applications.
We’ll review important details about your final exam , including a sample exam and a few past papers. During our discussions, please feel free to ask any questions you may have regarding the final exam.
See you tomorrow!
Cheers
Ashesh
Last week, we introduced the fundamental concepts of graphs, including terminology, representation methods (adjacency matrix and adjacency list), and basic operations. This week, we will focus on Graph Abstract Data Types (ADTs) and their applications. We will explore depth-first search (DFS) and breadth-first search (BFS) as foundational graph traversal algorithms, accompanied by practical examples implemented in C. After discussing DFS and BFS, we will delve into advanced graph algorithms, examining how they reduce search space to derive solutions efficiently.
The assignment released last week is due Monday, Week 05. We strongly encourage you to begin soon if you haven't already.
If you have any questions or need assistance, please post in the forum or join one of the scheduled help sessions.
Remember to stay on top of the material as the summer term moves quickly!
Cheers,
Ashesh
Welcome to Week 2. This week's lectures will continue addressing Trees and Binary Search Tree (BST) traversal algorithms, with a hands-on demonstration of constructing tree traversal solutions in C from the ground up. In addition, properties and algorithms for building and managing balanced BSTs and B-trees will be covered. Graph ADT will be introduced in the last lecture and will be covered in more detail in Week 3.
The assignment will be released tomorrow during the lectures.
If you have any questions or issues, please let us know by posting in the forum or attending a help session .
Please ensure that you are keeping up with the course material and do not fall behind in any topics during the summer term, as time passes quickly!
Cheers
Ashesh
Welcome to COMP2521 (Data Structures and Algorithms) !
The course outline is now available, please see the link Course Outline in the left panel. Please read it all, and ask questions in the first lecture on anything that's not clear.
COMP2521 does not use Moodle. The course website is at https://webcms3.cse.unsw.edu.au/COMP2521/25T0/ . We recommend that you bookmark the page. The course material will be available on this website.
Tutorials and Labs start in Week-1 . The tutorial and lab for week-01 are now available. See Tutorials, Labs and Quizzes in the left panel on the course website. You need to login using your zId and zPass to access the following course material. The login button is in the top right corner of this page.
The lectures will be delivered in person in the designated lecture theatres. Lecture recordings will be available later on the Lectures, Resources page.
All of the lecture notes as well as previous video lectures are already available. Please read/watch them ahead of time because we need to cover a lot of ground in five weeks! During the in person lectures, we can focus on answering any questions you may have about the content for that week.
Five weeks will go by very quickly, so please do not leave any materials behind. In the first lecture, I will talk more about these and other topics.
Many enthusiastic tutors, Ethan (course administrator), and I are thrilled to meet you all in person! We are all looking forward to the start of the summer term on Tuesday 07 January 2025!
-- Ashesh