uni

Thing1's amazing uni repo
Log | Files | Refs | Submodules

commit 28d5c2d96a0293110bc0b693fda40d280f652cd4
parent 5b47a3dbf345e1998be613f5db1caef5827dfa46
Author: thing1 <thing1@seacrossedlovers.xyz>
Date:   Sat,  2 May 2026 10:55:20 +0100

lectures

Diffstat:
ACS10720/TEST | 29+++++++++++++++++++++++++++++
1 file changed, 29 insertions(+), 0 deletions(-)

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