Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

CS 340 - Advanced Data Structures and Algorithm Design
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. * Prerequisite: CS 210 * 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Undergraduate Graduate

CS 340 - Advanced Data Structures and Algorithm Design

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. *** Prerequisite: CS 210 ***
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture, Examination

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:
Undergraduate
Graduate

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

UR Self-Service

Detailed Course Information

© 2024 Ellucian Company L.P. and its affiliates.