CMPSC 32 Lecture Notes - Lecture 15: Hash Table, Quicksort, Merge Sort
Document Summary
Fill in the blank / complete a table. Similar to midterm 1 in terms of time (~ one hour to complete), but you have the entire lecture. Will cover everything up to last tuesday (11/12) Midterm 2 will be cumulative, but with a heavy emphasis on post-midterm 1 material. Know the algorithm and how to implement it. Understand main ideas and how the array is manipulated as the algorithm executes. Know the runtime analysis (best / avg / worst) and space requirements. Understand concepts and how it works in various scenarios. How constructors / destructors of base / sub classes work. Understand memory concept of base and sub class attributes / functions on the stack and heap. What is polymorphism and when you may want to use it. How to declare, assign, and call functions via function pointers. Ps, ps -e, ps -a, top, jobs, ~z, ~c, etc.
