Review for Final Exam Non-cumulative, covers material since
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
Advantages and limitations Asymptotic time performance Comparison Review questions are available on the web. Treaps Definition It is both a BST and a binary min heap (heap is not a CBT) Each node has a key/priority pair (priority is a random number) It obeys BST order according to key value It obeys heap order according to priority value Treap operations
find: same as BST (no change) insert: first insert as in BST, then rotate until heap order is restored remove: first find the item, then rotate it down until it becomes leaf Why rorate? What to do if item is not there or if it is a duplicate Performance analysis Height is almost always O(log n) Why? Comparison to BST, RBT, Splay tree Hashing Hash table Table size (primes) Trading space for time Hashing functions Properties making a good hashing function Examples of division and multiplication hashing functions Operations (insert/remove/find/) Collision management
Separate chaining Open addressing (different probing techniques, clustering problem) Worst case time performance: O(1) for find/insert/delete if is small and hashing function is good Limitations Hard to answer order based queries (successor, min/max, etc.) Disjoint Sets Equivalence relation and equivalence class definitions and examples Disjoint sets and up-tree representation representative of each set direction of pointers Union-find operations basic union and find operation path compression (for find) and union by weight heuristics time performance when the two heuristics are used: O(m lg* n) for m operations (what does lg* n mean) O(1) amortized time for each operation
Graphs Graph definitions G = (V, E), directed and undirected graphs, DAG path, path length (with/without weights), cycle, simple path connectivity, connected component, connected graph, complete graph, strongly and weakly connectedness. Adjacency and representation adjacency matrix and adjacency lists, when to use which time performance with each Graph traversal: DF and BF Single source shortest path Breadth first (with unweighted edges) Dijkstras algorithm (with weighted edges) Topological order (for DAG) What is a topological order (definitions of predecessor, successor, partial order) Algorithm for topological sort
Def. of s. Polygon Sum Thm. ... A square is a quadrilateral with four right angles and four congruent sides. In the exercises, you will show that a square is a parallelogram, a rectangle, and a rhombus. So a square...
Alliteration, Consonance, and Assonance L.8.5 Demonstrate understanding of figurative language, word relationships, and nuances in word meanings. Alliteration Repetition of the same consonant sounds, usually at the beginning of the words Example: - Should the glee-glaze- - In Death's-stiff-stare.
Activités des associations En % Action humanitaire 3,7 Action sociale, santé 11,3 Défense des droits, causes 15,5 Education, formation, insertion 4,1 Sports, culture et loisirs 60,5 Economie, développement local 3,7 Autres 1,2 Notions à découvrir: -entreprise production marchande et non...
Usage Scenarios for a Community Cloud in Education and Research Paul Heinzlreiter, Wolfgang Hennerbichler, Michael Krieger The Location Johannes Kepler University Linz founded in 1966 3 faculties social sciences & business and economics, law, engineering & natural sciences about 15.000...
Union of egg + sperm. External Fertilization: Eggs shed by the female . Fertilized by sperm in the external environment. Moist habitat is always required for external fertilization . Allows sperm to swim to the egg . Prevents the gametes...
Port HRS to Banner HR - Now! HRS offline with close of FY 2016 business, June 23 ... EPAF - Self-service Banner. Epaf - options. Epaf - approver summary. ... OSU Fiscal and Administrative Officers Meeting Last modified by:
Ready to download the document? Go ahead and hit continue!