Module Indicative Content |
Algorithm Design
What is an algorithm, properties of an algorithm, debugging algorithms
|
Array manipulation
Insertion, deletion, removal of duplicates, partitioning, merging
|
Algorithm analysis
Big O notation, comparison of algorithms.
|
Searching algorithms
Design and implementation of a selection of searching algorithms (linear search & binary search)
|
Sorting algorithms
Design and implementation of a selection of sorting algorithms (selection sort and bubble sort)
|
Recursion
Recursive design and implementation, when to use recursion, implementing recursive-based algorithms (merge sort, quick sort, revisiting binary search)
|
DKIT reserves the right to alter the nature and timings of assessment
Module Resources
|
Recommended Book Resources |
---|
-
Robert Sedgewick & Kevin Wayne. (2015), Algorithms, 4th. Addison-Wesley Professional, p.984, [ISBN: 978-013438468].
|
Supplementary Book Resources |
---|
-
Robert Sedgewick & Kevin Wayne. (2016), Computer Science: An Interdisciplinary Approach, 1st. Addison-Wesley Professional, p.1168, [ISBN: 978-013407642].
-
George T. Heineman, Gary Pollice & Stanley Selkow. (2015), Algorithms in a Nutshell: A Practical Guide, 2nd. O'Reilly Media, p.425, [ISBN: 978-149194892].
-
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein. (2009), Introduction to Algorithms, 3rd. MIT Press, p.1312, [ISBN: 978-026203384].
|
This module does not have any article/paper resources |
---|
This module does not have any other resources |
---|