This course introduces to linear and non-linear data structures and algorithm analysis. Topics include: arrays, linked lists, stacks, queues, trees (search, balanced), heaps, hash tables, graphs, numpy arrays, dataframes, asymptotic analysis including big-Oh notation, and techniques for measuring algorithm complexity. Students who have successfuly completed MIS 190 should not take this course.