• Introduction: why we need clever algorithms and data structures.
• Performance and Big O: how much time and storage is needed as data sizes become large
• Some Lisp: (+ x 3)
• Lists and Recursion; Stacks and Queues
• Trees and Tree Recursion
• Using Library Packages
• Balanced Trees and Maps
• Hashing and randomization; XOR
• Priority Queues and Heaps
• Sorting, Merge
• Graphs
• Map, Reduce, and MapReduce / Hadoop
• Data-intensive and parallel computation

Contents    Prev    Next    Page+10    Index