In this module, the student will learn about the basics of data structures that organize ... randomized quicksort/quickselect algorithms. We will learn open address hashing: a technique that ...

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

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

Development of more sophisticated ideas in data type and structure, with an introduction to the connection between data structures and the algorithms they support. Data abstraction. Controlled access ...

Introduces concepts used in algorithm design and analysis including criteria for selecting data structures to fit their applications. Topics include data and program representations, computer ...

An introduction to the analysis and implementation of algorithms and data structures including linear data structures, trees, graphs, hash tables, searching algorithms, sorting algorithms, ...