koku's life journal

NTIN060 (Algorithms and data structures 1) [tutorial] - big O notation, mostly just revision of last semester + small o notation, which to my understanding is like the difference between a maximum and a supremum (in a way i suppose..)

NMAI058 (Linear algebra 2) [tutorial] - determinant of a matrix, we solved a few and then came the determinant olympics, something the teacher does every year, but only once every four it lands on the time of the winter olympics, one and a half dozen matrices (1/3 3x3 for 1 point each, 1/3 4x4 for 2 points each and the rest 5x5 for 3 points) whoever solved the determinant of a matrix first got the points.. i got 6 points placing me on a nice tied for 2nd place!! so i got a fidorka, which is a czech biscuit.. notable for being the one i got on Friday 2025-10-10 during NSWI120! if i had a nickel for every time...

NSWI177 (Introduction to Linux) - i am already pretty much introduced to linux as i use it on my main desktop since 2020.. also git, but i also know how to use that..

went to borrow an arduino for NSWI170, but the library was closed, then the train i was going to take home was cancelled/delayed idk it just said that i can use the following alternative trains instead and there was nothing, so i went to mcdonalds, got a fillet of fish burger, medium fries and an iced tea and ate and drank that at výstaviště and then went back to the train station and wrote this blog post

NPRG062 (Introduction to algorithms) [tutorial] - went over homework regarding big o of various functions and grouping them based on when they share the big o, that was it

NPRG030 (Programming 1) [tutorial] - i programmed newton method for approximating a function for any polynomial(!) homework is writing a polynomial calculator for addition, multiplication and division

NJAZ070 (English for Upper-Intermediate Students I) - no english mathematics today, just focusing on exercises from the book, some to do with tenses of the past and some about vocabulary, homework was reading an article about mobile phones from the book and answering some questions, one guy in the class was dressed as mario cause it's almost halloween and he was going to some hockey game later to day with friends and they were all dressed up for halloween i think

another three hour block of no classes, went to ikea this time walked around for a bit looking at all the furniture and stuff it was rather interesting, then ate falafel, in the end i ended up buying the funny rat, gosig råtta

NMSA230 (Introduction to R programming) - the entire class was dedicated to probability functions both discrete and continuous and how to work with them, i have no background in any statistics so i'll have to learn those things on my own time

NPRG062 (Introduction to algorithms) [tutorial] - more big O notation stuff, proofs of various statements like if f(x) has O(g(x)) does g(x) have O(f(x)) and what not, which this specifically i disproved in front of the class, that was rather spiral eyes emoji..

NPRG030 (Programming 1) [tutorial] - two people showed their solution of the homework, the teacher then showed us how to program a select sort and how to use the debugger in vscode, i use vim though.. there was something else but i can't recall what

NJAZ070 (English for Upper-Intermediate Students I) - went over homework and had a listening exercise, there must have been more.. possibly speaking of some form.. idk

this was where it ended last week, but every other week i have one class more, which i will talk about in a bit, but that class starts three and a half hours after english ends.. so to pass the time i went to the airport, which i think was a nice experience

NMSA230 (Introduction to R programming) - the teacher got that aoko aozaki fit, went over some structures like: list, logical, for, character, factor, date and posix time.. some things i thought were curios are you can compare a vector to a value and it compares it component by component and the result is a vector of booleans, you can use apply as a shorthand for a for cycle, factors, in general seem cool, they are for categorical values and working with time is silly

NPRG062 (Introduction to algorithms) [lecture] - big O notation and then some examples of algorithms and their O. digital sum, testing if a number is prime and eratosthenes' sieve, which has O of n*log(log(n)), evaluating a polynomial at a certain point (Horner's method) which has O(n) and is used also for converting a string to an integer.

NPRG030 (Programming 1) [lecture] - we're doing python, which i'm competent at. the only thing i didn't already know is when comparing strings using the keyword is, if they've been initialised with the same string and it's short it returns True, if it's above a certain threshold then it returns False as expected