Unit name | Algorithms II |
---|---|
Unit code | COMS20010 |
Credit points | 10 |
Level of study | I/5 |
Teaching block(s) |
Teaching Block 1 (weeks 1 - 12) |
Unit director | Dr. Lapinskas |
Open unit status | Not open |
Pre-requisites |
COMS10017 Object-Oriented Programming and Algorithms I COMS10014 Mathematics for Computer Science A and COMS10013 Mathematics for Computer Science B |
Co-requisites |
None |
School/department | School of Computer Science |
Faculty | Faculty of Engineering |
This unit aims to provide a solid foundation in the theory of computation, algorithms and data structures.
On successful completion of this unit, students will:
Teaching will be delivered through a combination of synchronous and asynchronous sessions, including lectures, practical activities supported by drop-in sessions, problem sheets and self-directed exercises.
10% in-class tests, 90% January timed assessment
Kleinberg, Jon and Tardos, Éva, Algorithm Design (Pearson Education, 2013) ISBN: 978-1292023946
Cormen, Thomas H. et al, Introduction to Algorithms (MIT Press, 2009) ISBN: 978-0262033848
Dasgupta, Sanjoy, Papadimitriou, Christos and Vazirani, Umesh, Algorithms (McGraw-Hill, 2006) ISBN: 978-0077388492