CM2035 Algorithms and Data Structures II

• Choose and justify appropriate data structures and algorithms to solve specific problems
• Express time and space complexities of specific algorithms using big‑O notation
• Implement standard searching, sorting and path‑finding algorithms
• Implement trees and hash tables and describe the consequences of implementation choices
• Compare and contrast recursive and iterative expressions of solutions to problems
• Describe the abstraction of collections, relate this abstraction to linear collections, and recall the basic operations that each abstraction supports

• A Ph.D. or Master's Degree in a related discipline from a reputable university
• At least 2 years of relevant teaching experience at the tertiary level (preferred)
• 5 years of relevant work experience (advantageous)
• Applicant...