CS 340 - Advanced Data Structures and Algorithm Design
Description: Fundamental algorithms: depth- and breadth-first traversals, pattern matching, and graph algorithms. Algorithmic strategies: brute-force, greedy, divide-and-conquer, backtracking, branch-and-bound, dynamic programming, and randomized. Algorithm analysis, complexity theory, performance evaluation. Parallelism: fundamentals, algorithms, communication. Prerequisites: CS 210. |
Credit Hours: 3 Class Hrs./Week: 3 Lab Hrs./Week: 0 Hardware: Access to CS Dept. Hercules. Software: C or instructor's choice |