Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...

I have a 2D graph that I'm trying to lay out cleanly. Does anyone know of an algorithm that, given the x, y position of every node and the graph's edges will tell me how many edges cross.

Design algorithms and analyze their complexity in terms of running time and space usage; Create applications that are supported by highly efficient algorithms and data structures for the task at hand; ...

Cross-listed with DTSA 5503. Course Type: Pathway | Breadth Specialization: Foundations of Data Structures and Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior ...