Slide 1CSE332: Data Abstractions Lecture 14: Beyond Comparison Sorting Dan Grossman Spring 2010 Slide 2 The Big Picture Surprising amount of juicy computer science: 2-3 lectures……

Slide 1 CSE332: Data Abstractions Lecture 10: More B-Trees Tyler Robison Summer 2010 1 Slide 2 B-Tree Review: Another dictionary 2  Overall idea:  Large data sets won’t…

Slide 1 CSE332: Data Abstractions Lecture 9: B Trees Dan Grossman Spring 2010 Slide 2 Our goal Problem: A dictionary with so much data most of it is on disk Desire: A balanced…

Slide 1 CSE332: Data Abstractions Lecture 10: More B Trees; Hashing Dan Grossman Spring 2010 Slide 2 B+ Tree Review M-ary tree with room for L data items at each leaf Order…

Slide 1 CSE332: Data Abstractions Lecture 28: Course Wrap-Up / Victory Lap Dan Grossman Spring 2010 Slide 2 Final Exam As also indicated in class-list email and on the web…

Slide 1 CSE332: Data Abstractions Lecture 11: Hash Tables Dan Grossman Spring 2010 Slide 2 Hash Tables: Review Aim for constant-time (i.e., O(1)) find, insert, and delete…

Slide 1 CSE332: Data Abstractions Lecture 14: Beyond Comparison Sorting Tyler Robison Summer 2010 1 Slide 2 The Big Picture 2 Simple algorithms: O(n 2 ) Fancier algorithms:…

Slide 1 CSE332: Data Abstractions Lecture 16: Topological Sort / Graph Traversals Dan Grossman Spring 2010 Slide 2 Topological Sort Problem: Given a DAG G=(V,E), output all…

Slide 1 CSE332: Data Abstractions Lecture 25: There is no lecture 25 Dan Grossman Spring 2010 Slide 2 Huh? We need most or all of the class to finish up concurrency, using…

Slide 1 CSE332: Data Abstractions Lecture 21: Parallel Prefix and Parallel Sorting Tyler Robison Summer 2010 1 Slide 2 What next? 2 Done:  Simple ways to use parallelism…