CS234 Midterm: Midterm Review
29 Aug 2016
School
Department
Course
Professor
Document Summary
Bring watcard most stuff is posted on learn. 5 parts of true or false worth 5 marks. If you need more space you writing too much. Complexity classes; growth rate, nlogn the classes and relationships. If i had n, 2nlogn, lglgn, 2^10000 diff fcn each of them belongs to complexity classes. A question could be sort them in order which one is smallest to largest. Is this the correct sorted list or not. The more you have log the more you"re getting a smaller value. T(n) = o (logn) * o(n) * o (logn) is in (nlog^2n) This might be what you see or a problem. No large disk on top of a smaller disk. Let"s say somehow i don"t have this n-1 disk. Then i only have the last one and i can move that and insert it to c and put it there. In recursive algorithms we wanna find recursive data structures.
