Module Descriptors
ALGORITHMICS
COSE60272
Key Facts
Faculty of Computing, Engineering and Sciences
Level 6
15 credits
Contact
Leader: John Pratt
Email: J.F.Pratt@staffs.ac.uk
Hours of Study
Scheduled Learning and Teaching Activities: 36
Independent Study Hours: 114
Total Learning Hours: 150
Assessment
- ASSIGNMENT weighted at 50%
- EXAMINATION - UNSEEN IN EXAMINATION CONDITIONS weighted at 50%
Module Details
Module Additional Assessment Details
One 50% comparative essay. (Learning outcomes 1-4)
One 50% examination (2 hours) (Learning outcomes 1-4)
One 50% examination (2 hours) (Learning outcomes 1-4)
Module Indicative Content
Pseudo-Code standard. B-trees, hashing techniques, heaps, graph algorithms,
greedy algorithms,
Matroids. Matching.
Measures of performance, big-Oh notation.
Complexity Classes P and NP.
Easy versus Hard NP properties.
Characterisation of good algorithmics.
greedy algorithms,
Matroids. Matching.
Measures of performance, big-Oh notation.
Complexity Classes P and NP.
Easy versus Hard NP properties.
Characterisation of good algorithmics.
Module Learning Strategies
Each week, there will be,2 lectures and 1 tutorial - to sufficiently understand the underpinning mathematical material.
Formative Exercises used to highlight concepts and notions.
Pre-coded algorithms to illustrate concepts and notions.
E-notes + E-exercises to read ahead the pedagogic material.
(1:n)2 (1:20)1
Formative Exercises used to highlight concepts and notions.
Pre-coded algorithms to illustrate concepts and notions.
E-notes + E-exercises to read ahead the pedagogic material.
(1:n)2 (1:20)1
Module Special Admissions Requirements
Prior study of Mathematics and Algorithmics.
Module Resources
E-Notes /E-Formative exercises.
Recommended text *** web site.
Recommended text *** web site.
Module Texts
Data Structures and Algorithms in Java 3rd Edition, M T Goodrich, R Tamassia, WILEY 2004, ISBN: 0471-46983-1
Computer Algorithms Introduction to Design & Analysis, S Baase, A V Gelder, ADDISON, WESLEY 2000, ISBN: 0201612445
Fundamentals of Algorithmics, G Brassard, P Bratley, PRENTICE-HALL 1996, ISBN: 0-13-335068-1
Introduction to Graph Theory 2nd Edition, D B West, PEARSON HIGHER EDUCATION 2000, ISBN: 0-13-0144400-2
Computer Algorithms Introduction to Design & Analysis, S Baase, A V Gelder, ADDISON, WESLEY 2000, ISBN: 0201612445
Fundamentals of Algorithmics, G Brassard, P Bratley, PRENTICE-HALL 1996, ISBN: 0-13-335068-1
Introduction to Graph Theory 2nd Edition, D B West, PEARSON HIGHER EDUCATION 2000, ISBN: 0-13-0144400-2