koku's life journal

NPRG062 (Introduction to algorithms) [lecture] - recursion, see also: today's daily message, including the classic example of the fibonacci sequence, how to deal with unnecessary calculation of the same things by using caching or by building from the bottom up and the best way to do it, which uses matrices, you raise the matrix ((0,1),(1,1)) to the nth power and then multiply by the vector (f0,f1), you can use the quick raising to the power by using the binary representation of n, gosh this is a long entry, we also did recursive generation, like how to break up a number into all the sums it can be made of

NPRG030 (Programming 1) [lecture] - int("number") isn't actually a function, it's a constructor! most of the class was focused on working with files, things i know and we did during the tutorial previously.. also the way strings are interpreted in memory (they terminate at a specific char, like c strings) and the walrus operator := which has a silly name methinks

NTVY014 (Physical education I) [swimming] - we did backstroke, legs only, and breaststroke, legs only.. very simple, but rather tiring

NMAI057 (Linear algebra 1) [lecture] - reduced echelon form of a matrix and that for every matrix it is unique, matrix products and rules for them (they associate but don't commute), proofs of the rules, definition of the inverse of a square matrix

NMAI057 (Linear algebra 1) [tutorial] - started with a quiz again, but i absolutely demolished it, as in i made two mistakes but was able to find them in time, after quiz we found every solution of a system of linear equations using parameters a few times, it's kinda good i think