Skip to Main Content

CMPSC130B

Download as PDF

CMPSC 130B - Data Structures and Algorithms II

Computer Science College of Engineering

Full Course Title

Data Structures and Algorithms II

Instructor Name(s)

Egecioglu

Course Description

Design and analysis of computer algorithms. Correctness proofs and solution of recurrence relations. Design techniques; divide and conquer, greedy strategies, dynamic programming. Applications of techniques to problems from several disciplines. NP - completeness.

Unit Value

4

Maximum number of times course can be repeated for additional credit

0

Maximum Units

4

Prerequisites

Computer Science 130A.

Programs

CMPSC130B is a completion requirement for: