'Worst case time performance' presentation slideshows

Review for Finals 2011

733 views • 67 slides

Exam 3 Review

Exam 3 Review. Data structures covered: Hashing and Extensible hashing Priority queues and binary heaps Skip lists B-Tree Disjoint sets For each of these data structures Basic idea of data structure and operations Be able to work out small example problems Prove related theorems

123 views • 9 slides

Exam 3 Review

Exam 3 Review. Data structures covered: Priority queues and binary heaps Hashing Skip lists Disjoint sets Graphs For each of these data structures Basic idea of data structure and operations Be able to work out small example problems Prove related theorems Advantages and limitations

109 views • 8 slides

Review Exam 3

Review Exam 3. Data structures covered: Hashing Priority queues and binary heaps Skip lists Disjoint sets Graphs For each of these data structures Basic idea of data structure and operations Be able to work out small example problems Prove related theorems Advantages and limitations

88 views • 7 slides

Review for Final Exam

Review for Final Exam. Non-cumulative, covers material since exam 2 Data structures covered: Treaps Hashing Disjoint sets Graphs For each of these data structures Basic idea of data structure and operations Be able to work out small example problems Prove related theorems

105 views • 5 slides