TEST (992B)
1 3 questions, each with 3 parts 2 3 Numbers and Matrices 4 - all representation's of binary ints, ONLY converting between them 5 - page 42 - 50 6 - floating point, no conversions, ONLY comparison 7 - page 50 - 61 8 - matrix multiplication (don't compute the values, just write 5 x 3 + ...) 9 - page 61 - 66 10 11 This is easy 12 13 Turing machines, computational problems, computability and reductions 14 - halting problem, you will be given a proposed definition, say whats wrong 15 - page 89 - 97, problem 2 on practical 7 16 - computational problems, class of problems, special cases 17 - page 85 - 89 18 - reduction, describe what reducing a to b means 19 - page 90 - 93 20 21 Doesn't look too hard 22 23 Algorithms and runtime analysis 24 - insertion sort, heap sort, quick sort, quick select, runtime of these (especially insertion sort) 25 - page 118 - 165 26 - asymptotic notation (all 5 of them) 27 - page 99 - 118, 15 - 28, problem 3 on practical 9 28 - use algorithms that we know, to do something new 29 - page 99 - 168