CS 461 - Data Structures and Algorithms II - 3 credit hours
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 .
Course allowed for graduate credit to students enrolled in a graduate program.
Home | Colloquia | Research | People
Current Students | Prospective Students | Companies | Visitors
Scholarships | Courses | Degrees | PIBBS
Computer Facilities | Jobs | Links
Contact Info:
(505) 277-3112 (phone)
(505) 277-6927 (fax)
Web site questions:
All other questions:
(505) 277-3112 (phone)
(505) 277-6927 (fax)
Web site questions:
All other questions:
University of New Mexico
Department of Computer Science
Mail stop: MSC01 1130
1 University of New Mexico
Albuquerque, NM 87131-0001
Department of Computer Science
Mail stop: MSC01 1130
1 University of New Mexico
Albuquerque, NM 87131-0001
