2017/2018, Semester 1
School of Computing (Computer Science)
Modular Credits: 4
This module is aimed at graduate students who are doing or intend to do advanced research in algorithms design and analysis in all areas of computer science. The module covers advanced material on combinatorial algorithms, with emphasis on efficient algorithms, and explores their use in a variety of application areas. Topics covered include, but are not restricted to, linear programming, graph matching and network congestion, approximation algorithms, randomized algorithms, online algorithms, and learning algorithms. The module will be a seminar-based module that will expose students to current research in these areas.
By the end of the course students will be able to:
1. Independently explore and understand advanced topics in algorithms.
2. Understand and write formal mathematical proofs.
3. Employ fundamental concepts from theoretical computer science in their own research.
Students are encouraged to take CS5234 as a prerequisite. If a student has not taken CS5234 but still wishes to attend the course, please email Prof. Yair Zick.
Students will be assessed on their group presentation (two presentations during the course), and based on ongoing classroom activity.
Presentation 1 20%
Presentation 2 30%
Class activities 50%
Each group will be given 40 minutes (+15 minutes Q&A) to present their topic. You are encouraged to send me a copy of your slides and discuss any potential issues ahead of time.
Please send me a copy of the presentation (in ppt/pdf format) before class.
are clear and easy to follow
state the key elements of the topic
present at least one fundamental concept in depth.
are well-designed, and have no spelling/grammar issues
are clear and articulate
are able to answer questions knowledgeably and confidently
manage their time well (neither over nor under the time limit).
present well: maintain eye contact, maintain interest, and engage the audience
The second half of each class will be devoted to solving an assignment. Students will be given the assignment a week in advance, so that they have time to sit with their grou/p and discuss it.
We will have a o
ne hour classroom activity on the assignment.
At the end of each presentation, each group will be asked to write their solution to a randomly assigned problem from the assignment (you’ll be given
minutes to do so).
After this – a student from each group will be randomly selected to present the solution (or by written solution if no student is selected to present).
Final grade to all members is determined by
presentation quality, or whiteboard solution quality if group did not present
If the student presenting does not know the answer, another may come to replace them but suffer a grade deduction.
Students will present in class on course topics, and will conduct in-class activities to facilitate understanding of course material. The course has no midterm or final examination.
Workload Components : A-B-C-D-E
A: no. of lecture hours per week
B: no. of tutorial hours per week
C: no. of lab hours per week
D: no. of hours for projects, assignments, fieldwork etc per week
E: no. of hours for preparatory work by a student per week