Data Structures and Algorithms II

Number: 
CMPSC 130B
Level: 
Undergraduate
Units: 
4

Description

Prerequisite: Computer Science 130A.
Design and analysis of computer algorithms. Correctness proofs and solution of recurrance relations. Design techniques; divide and conquer, greedy strategies, dynamic programming, branch and bound, backtracking, and local search. Applications of techniques to problems from several disciplines. NP - completeness.