Associate Lecturer

Course Description

Course information

CM2035 Algorithms and Data Structures II

1. Choose and justify appropriate data structures and algorithms to solve specific problems

2. Express time and space complexities of specific algorithms using big-O notation

3. Implement standard searching, sorting and path finding algorithms

4. Implement trees and hash tables different data structures, and describe the consequences of implementation choices

5. Compare and contrast recursive and iterative expressions of solutions to problems

6. 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 relevant teaching experience at the tertiary level is preferred
• 5 years of relevant work experience will be an added advantage
• Applicant must be available to teach day classes or night classes or both day and night classes

We regret that only shortlisted candidates will be notified.