MSCS 532 - Algorithm and Data Structures

Credit(s): 3 hours
This course will cover an in-depth exploration of advanced algorithms and data structures, building on the foundational knowledge acquired in undergraduate computer science courses. The course will cover topics such as advanced sorting and searching algorithms, graph algorithms, dynamic programming, greedy algorithms, and advanced data structures like B-trees, AVL trees, and graph data structures. Students will also learn about algorithmic paradigms, complexity analysis, and NP-completeness.