Mô tả môn học

This course provides students basic knowledges about data structures and algorithms for the design and development of algorithms to solve computation problems. After the course, students will understand basic data structures likes linked lists, stacks queues, trees, binary search trees, hash tables and will be able to apply these data structures flexibly to different computation problems. Students also understand fundamental algorithmic paradigms such as recursion, greedy, divide-and-conquer, dynamic programming as well as different sorting algorithms and implement these algorithms to solve specific problems. Students will also be able to analyze the efficiency of algorithms in term of big-O notations.