Course Code: ICT235
Synopsis
ICT235 will provide a comprehensive overview of fundamental data structures and algorithms essential for ICT and software engineering. It is designed to deepen understanding of data organisation, storage, and retrieval, alongside efficient algorithm design and analysis. The course is structured to build from basic concepts to more complex structures and algorithms using Python, ensuring a solid foundation for further study and practical application.
Level: 2
Credit Units: 5
Presentation Pattern: EVERY JAN
Topics
- Algorithm Analysis
- Recursion
- Array-based Sequences
- Stacks and Queues
- Linked List and Positional List
- Tree and Tree Traversal Algorithms
- Priority Queues
- Maps
- Hash
- Skip Lists
- Sorting
- Selection
Learning Outcome
- Describe the concept of algorithm analysis, including time and space complexity, and the significance of Big-O notation.
- Explain the fundamentals of recursion and understand its use cases
- Demonstrate a clear understanding of various data structures and algorithms.
- Identify the advantages and disadvantages of basic data structures.
- Analyse and compare the efficiency and complexity of different algorithms.
- Apply appropriate data structures and algorithms to solve complex problems