| Course Code | COMP3121 |
| Course Title | Algorithms and Programming Techniques |
| Convenor | Raveen de Silva |
| Admin | Anahita Namvar |
| Classes | Tuesday 14:00 - 16:00 and Thursday 14:00 - 16:00 |
| Consultations |
Wednesday 12:00 - 13:00 and Friday 12:00 - 13:00
|
| Units of Credit | 6 |
| Course Website | http://cgi.cse.unsw.edu.au/~cs3121/ |
| Handbook Entry | http://www.handbook.unsw.edu.au/undergraduate/courses/current/COMP3121.html |
Offered
The courses COMP3121/9101 are about problem solving. Before you can start programming, you must first solve the problem at hand. Thus, we will not just go over a cookbook of some well-known algorithms to be memorised and implemented. Instead, we will learn how to design “from scratch” new algorithms for solving new problems, using various design techniques (greedy, dynamic programming, divide and conquer, etc), and study the applications of these techniques, such as in graph algorithms and string matching algorithms. We will also learn how to argue the correctness and efficiency of algorithms.
| Role | Name | Office | |
| Lecturer | Raveen de Silva | r.desilva@unsw.edu.au | K17 202 |
| Course Admin | Anahita Namvar | cs3121@cse.unsw.edu.au | K17 501-04 |
The Student Code of Conduct ( Information , Policy ) sets out what the University expects from students as members of the UNSW community. As well as the learning, teaching and research environment, the University aims to provide an environment that enables students to achieve their full potential and to provide an experience consistent with the University's values and guiding principles. A condition of enrolment is that students inform themselves of the University's rules and policies affecting them, and conduct themselves accordingly.
In particular, students have the responsibility to observe standards of equity and respect in dealing with every member of the University community. This applies to all activities on UNSW premises and all external activities related to study and research. This includes behaviour in person as well as behaviour on social media, for example Facebook groups set up for the purpose of discussing UNSW courses or course work. Behaviour that is considered in breach of the Student Code Policy as discriminatory, sexually inappropriate, bullying, harassing, invading another's privacy or causing any person to fear for their personal safety is serious misconduct and can lead to severe penalties, including suspension or exclusion from UNSW.
If you have any concerns, you may raise them with your lecturer, or approach the School Ethics Officer , Grievance Officer , or one of the student representatives.
Plagiarism is defined as using the words or ideas of others and presenting them as your own. UNSW and CSE treat plagiarism as academic misconduct, which means that it carries penalties as severe as being excluded from further study at UNSW. There are several on-line sources to help you understand what plagiarism is and how it is dealt with at UNSW:
Make sure that you read and understand these. Ignorance is not accepted as an excuse for plagiarism. In particular, you are also responsible that your assignment files are not accessible by anyone but you by setting the correct permissions in your CSE directory and code repository, if using. Note also that plagiarism includes paying or asking another person to do a piece of work for you and then submitting it as your own work.
UNSW has an ongoing commitment to fostering a culture of learning informed by academic integrity. All UNSW staff and students have a responsibility to adhere to this principle of academic integrity. Plagiarism undermines academic integrity and is not tolerated at UNSW. Plagiarism at UNSW is defined as using the words or ideas of others and passing them off as your own.
If you haven't done so yet, please take the time to read the full text of
The pages below describe the policies and procedures in more detail:
You should also read the following page which describes your rights and responsibilities in the CSE context:
You will have four assignments (no coding involved), approx bi-weekly and each worth 15% of your grade, plus an online final exam worth 40%.
Here are the weights:
| Homework | 60% |
| Final Exam | 40% |
Bonus points will be added for forum participation (no more than 5%). Please refer to the welcome announcement for more details.
| Time | Lecturer | Link |
|---|---|---|
| Tuesday 14:00 - 16:00 | Raveen |
https://youtube.com/playlist?list=PLVly8g0-6d_dPkcNowqzscfbHhp4FjU9A
|
| Thursday 14:00 - 16:00 | Raveen |
https://youtube.com/playlist?list=PLVly8g0-6d_dPkcNowqzscfbHhp4FjU9A
|
| Time | Consultant | Link |
|---|---|---|
| Wednesday 12:00 - 13:00 | Raveen |
https://unsw.zoom.us/j/84869304383
|
| Friday 12:00 - 13:00 | Raveen |
https://unsw.zoom.us/j/84869304383
|
| Time | Tutor | Link |
|---|---|---|
| Monday 11:00 - 12:00 | Rudy | https://unsw.zoom.us/j/81463936975 |
| Monday 17:00 - 18:00 | Frank | https://unsw.zoom.us/j/81463936975 |
| Tuesday 11:00 - 12:00 | Kaiqi | https://unsw.zoom.us/j/81463936975 |
| Tuesday 17:00 - 18:00 | Rudy | https://unsw.zoom.us/j/81463936975 |
| Wednesday 11:00 - 12:00 | Gerald | https://unsw.zoom.us/j/81463936975 |
| Wednesday 17:00 - 18:00 | Frank | https://unsw.zoom.us/j/81463936975 |
| Thursday 11:00 - 12:00 | Kaiqi | https://unsw.zoom.us/j/81463936975 |
| Thursday 17:00 - 18:00 | Even | https://unsw.zoom.us/j/81463936975 |
| Friday 11:00 - 12:00 | Gerald | https://unsw.zoom.us/j/81463936975 |
| Friday 17:00 - 18:00 | Even | https://unsw.zoom.us/j/81463936975 |
Recordings of the lectures and consultations will be published on the UNSW Algorithm Design YouTube channel, in the same
playlist
.
You can post questions at the Ed forum (join here ) regarding all the material covered in lectures or ask for clarifications on the tutorial problems. In addition to the peer tutorials, you will be provided written tutorial exercises with detailed solutions and you can ask for clarifications during office hours which will also be delivered via Zoom.
Some of the topics to be covered in COMP3121/9101 include:
Introduction:
Algorithm Analysis:
Divide-And-Conquer Method:
The Greedy Method:
Dynamic Programming Method:
Network Flow Algorithms:
String Matching Algorithms:
Linear Programming:
Intractable Problems and Approximation Algorithms:
Practicing problem-solving while having fun:
The final exam will be held online using INSPERA. It will be a three hour exam consisting of eight multiple choice questions and four algorithm design problems. More details will be announced later.
This course is evaluated each session using the myExperience system.
In the previous offering of this course, students felt that the assignments were too much work for too little weight.
Based on their comments, we will be reducing the assignments from five questions to four, and increasing the weight of each assignment from 10% to 15%.
Resource created Thursday 03 February 2022, 02:03:00 PM, last modified Monday 14 February 2022, 09:18:42 PM.