|
What's New?? Unit Outline Lecture Notes Assignments Tutorials Practicals Resources FAQs |
The objective of this unit is for students to learn about a wider range of algorithms and data structures, and equally importantly to know which one is the most appropriate for a given situation. Students should finish this unit knowing how to write better, more correct programs through understanding rather than trial-and-error. Topics include but are not limited to sorting and hashing; heaps, priority queues, and the data structures of the C++ STL; binary search trees, quadtrees, 2-3 trees, and extensions; graphs; different styles of algorithm, such as divide-and-conquer and dynamic programming; and the complexity of algorithms. All of the unit materials will be made available via this page. We assume that students will regularly check the online information available here, where lecture notes, tutorial and practical questions, assignment descriptions and other related materials can be found.
All assignments are compulsory. If you have not submitted assignment 1 and wish to continue in this unit you must contact Ros or Mark urgently |
|
Please note: You are viewing the unstyled version of this web site. Either your browser does not support CSS (cascading style sheets) or it has been disabled.
