Location:Home > Academics > Courses > Course Discreption
Advanced Data Structures and Algorithm Analysis
Edit:cgsoft Date:2012-04-23 10:45

Course Name:
Advanced Data Structures and Algorithm Analysis
Open Quaters:
Winter for sophomores
Simple Description:
This course is based on the fundamentals of data structures. It continues to investigate the definitions, implementations, and functions related to non-numerical data objects. The content of this course consists of analyzing the variations of binary search trees (AVL tree, splay tree, and B-tree), introducing data structures for priority queues that are better for merging (leftist heap, skew heap, and binomial queue), browsing NP-completeness, introducing classical algorithms (greedy, divide and conquer, dynamic programming, backtracking, and randomized algorithms), and amortized analysis. Students are supposed to learn how to organize data, to represent problems in a computer, to select the optimal data structure and algorithm for a specific problem, and hence improve their ability of programming.