CSC 246 Scalable Algorithms & Objects

Prerequisite: CSC 236

Description: Weaving ethics as a theme throughout, this course will teach students to utilize professional software engineering techniques and tools as they deepen their understanding of object-oriented design and implementation and utilize more complicated data structures including sets, red-black trees, heaps, graphs, maps, and hash maps/tables. Students will extend their learning about the scalability of algorithms as they explore important algorithmic techniques such as string matching, subsequence matching, regular expressions, backtracking, divide and conquer, greedy strategies, branch and bound, dynamic, and randomization.

Note: Noncredit for students who completed CSC 386 – Scalable Algorithms and Objects.

Credits

1 Course Credit