University of Minnesota, Twin Cities campus
 
CSCI 4041 - Algorithms and Data Structures
Credits: 4.0 [max 4.0]
Course Equivalencies: 02015
Typically offered: Every Fall & Spring
Rigorous analysis of algorithms/implementation. Algorithm analysis, sorting algorithms, binary trees, heaps, priority queues, heapsort, balanced binary search trees, AVL trees, hash tables and hashing, graphs, graph traversal, single source shortest path, minimum cost spanning trees. prereq: [(1913 or 1933) and 2011] or instr consent; cannot be taken for grad CSci cr