Course Topics

• Introduction: why we need clever data structures and algorithms
• Representation: how data, pointers, and structures are represented in the computer
• Performance and Big O: how much time and storage are 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