provides a comprehensive introduction to data structures and algorithms,
including their design, analysis, and implementation. It covers object-oriented
design, algorithm analysis, stacks, queues, lists, trees, graphs, sorting
algorithms and more.
above assignment schedule may change slightly during the course. All
assignments are due at the beginning of class.
assignments may be handed in, but there will be a penalty of 20% of the
mark for assignments turned in less than one day late, and an additional
penalty of 10% for each day thereafter.
Policy -- Cheating will not be tolerated in this course. Students are
encouraged discuss things related to courses and assignments but the
materials handed in must be his/her own. The maximum penalty for the first
offense is for the assignment in question. For subsequent offenses may
result in an automatic failure of the course and possibly other academic
strongly encouraged to attend all lectures and to participate in discussions
during lectures. 5% of the final mark is assigned for full attendance and
active class participation.
Reading the BBS:
There is a BBS
in POVIS for this course. In this BBS you will find changes to the lecture
schedule, clarifications to the assignments, etc. You can also post questions
to the TA or to the whole class. It is your responsibility to read this BBS
on a regular basis. There is likely to be little information at the
beginning, but more as the course progresses.
The following is a tentative
list of lecture topics for the course.