Session 1, 2009
In the first
session of 2009 courses COMP9101 and COMP3121 are taught together with
similar syllabi. COMP3821 /COMP9801 involve an
additional lecture; see here.
COMP3120 is NOT offered in Session 1. Note that there are NO
tutorials for 3121/3821/9101/9801 classes. Instead, you will have regular
consultations with our tutors.
CLASS
ANNOUNCEMENTS:
WELCOME TO ALGORITHMS!
·
EXTRA OFFICE HOURS: Every week day
18 to 24 of June 12 -1 in 504 of K-17 (Aleks’ office).
· The final will cover some of the
following topics:
1. greedy
2. dynamic programming
3. maximal flow and bipartite matching
4. string matching
5. basic NP completeness and basic
approximation algorithms
·
March 09. Assignment for the extended classes and the first set of
problems for the programming competition practice added to the Assignments
page. Please visit http://www.programming-challenges.com
and create an account for yourself.
·
Programming Competition practice: Wednesdays 4-7PM
in Oud lab, ground floor CSE. Pizza for participants at 6PM. We start week 1!
·
Soundtracks of all of the amazing lectures can be obtained at http://lectopia.elearning.unsw.edu.au/ilectures/ilectures.lasso?ut=1179
. Use them with the lecture notes!
·
Please submit your assignments by emailing them
from your
CSE
or UNSW account to cs3121@cse.unsw.edu.au. Do not email them to
Aleks or use your private email account such as gmail. You should send only
.pdf or Word 2003 files, and you must print clearly your name and student
number on every page of your submission. Use the following convention for the
file name : z324788_Aleks_Ignjatovic_CS3121_Assignment1.
·
Midterm will be held WEEK 7 during the regular
lecture time.
·
Assignment 2 released, due April 14 (sorry it was a
typo before).
·
Extra consultations: Friday 1-2, Monday 11-1
·
Assignment 3 released, due date
May 26th
·
Old finals and Final Practice Problems can
now be found on the assignments page!!!
CRICOS Provider 00098G