CPSC 1045 Study Guide - Final Guide: Hash Table, Mmap, Binary Search Tree
Document Summary
Final exam review: know binary search algorithm, know bigo notation (#n times an algorithm is being executed) Sorting: set up a binary search tree {12, 8, 5, 25, 9} left side holds the smallest value. A: objects might have to be casted while with generics you always know what you are dealing with in term of type/properties: making a class and methods generic, something about class cat and dog extending an animal class. List and list and some static method that performs operations on list, then you"ll have problems adding/modifying elements of cat and dog lists suing this method. Map> mmap = new hashmap()); Best data structure if: need fast lookup, fixed amount of data, large memory available. Answer: anything with a hash (index the data), e. g. hash map: fast serach, insertion/deletion not important, unkonwn amount of data, memory fragmented.
