The University of New Mexico

Data Structures and Algorithms II

CS 362 (3)

A continuation of 361L with an emphasis on design of algorithms. Topics include: amortized analysis and self-adjusting data structures for trees and priority queues; union-find; minimum spanning tree, shortest path and other graph algorithms; elementary computational geometry; greedy and divide-and-conquer paradigms.

Prerequisite: 361L


Prerequisites / Corequisites

Data Structures and Algorithms - CS 361L


Course Search:




Keyword Search:

Office of the Registrar

MSC 11 6325
1 University of New Mexico
Albuquerque, NM 87131

Phone: (505) 277-8900
 Fax: (505) 277-6809