GACS-7101 (Advanced Data Structures and Algorithms)

Course Objectives

In this course, students will study methods for designing efficient data structures and algorithms such as binary search trees, red-black trees, priority queues, minimum spanning trees, strongly connected components, maximum flows, string matching and tree matching, as well as bipartite graphs. Through the study of these data structures and algorithms, students will develop skills to solve hard problems in specialized databases such as Web and Document, DNA and Deductive Databases.