*This is a standalone credit-bearing course from NTU Undergraduate Degree Programmes.
By the end of this course, the student would be able to:
1. Select appropriate data structures such as arrays, linked lists, stacks, queues and trees and implement algorithms to solve real world problems using these data structures in C.
2. Conduct complexity analysis of simple algorithms.
3. Select and implement appropriate search algorithm (sequential search, binary search, search using hash tables) as part of a problem solution in C. Compare the efficiencies of these search algorithms.
4. Select and implement appropriate graph traversal algorithm (DFS, BFS) as part of a problem solution in C. Analyse the complexities of these graph traversal algorithms.
- Dynamic memory allocation
- Linked Lists
- Abstract Data Types and Their Implementation
- Tree Structures
- Introduction and Analysis of algorithms
- Graph Representations and Searching
Standard Course Fee: S$3,113.70
|Course fee payable after SSG funding, if eligible under various schemes|
|Cat-A SSG Funded Courses||N.A.|
|Enhanced Training Support for SMEs (ETSS)||N.A.|
|Mid-Career Enhanced Subsidy (MCES)||N.A.|