koku's life journal

Tuesday 2025-11-04

Tue, 04 Nov 2025 13:30:58 GMT

NPRG062 (Introduction to algorithms) [lecture] - proof that the best big O of a sorting function is nlog(n) using a binary tree and stirling's formula for approximating factorials, after we did count and bucket sort, both having O(n+R) where R is the difference between min and max of input data and radix sort having O(n*logR), after we did data structures, something about lists.. and abstract data structures: stack (fifo) and queue (lifo)

NPRG030 (Programming 1) [lecture] - tuples, dictionaries and objects, apparently big o of a dictionary is O(1) except for when it sometimes isn't.. and an implementation of linked lists

koku daily message:
amplification

comments

Tuesday 2025-10-14

Tue, 14 Oct 2025 11:00:18 GMT

NPRG062 (Introduction to algorithms) [lecture] - we were told about ways of finding if an item exists in an array including binary search (my beloved), but that one only works if the array is sorted.. se we went over some ways to order an array, bubble, selection and insert sorts all having O(n^2) and merge sort, which has O(nlog(n))

NPRG030 (Programming 1) [lecture] - boring class.. there are functions, you can have an f"string" which allows for formatting of sorts.. i don't really care.. at the end he wrote a program which counts all the instances of distinct words in input, he wanted to throw in romeo and juliet but couldn't find a plain text so he copied a whole site that had it, turns out that "Romeo" appeared 119 times, "Juliet" only 65 times and "love" 70 times

next week we don't have classes on tuesday bacuase of immatriculation and the next week we have a state holiday on tuesday..

koku daily message:
something is rotten in the state of denmark

comments

Thursday 2025-10-09

Thu, 09 Oct 2025 14:03:41 GMT

NPRG062 (Introduction to algorithms) [tutorial] - we had some problems and had to design algorithms with the lowest O it's a short class so there wasn't that much

NPRG030 (Programming 1) [tutorial] - we went over some of the things that were taught during the lecture, homework is create a city using some python library for 3D simple shapes, seems like it's gonna take a bit of time to get used to how it works

NJAZ070 (English for Upper-Intermediate Students I) - very easy so far, just some intricacies of the future tenses, where to use will, going to or -ing, i didn't actually know that officially you are to use the -ing form only for arrangements, i.e. agreement between two or more parties, using -ing for any other form future is informal (for example: i am having salmon for dinner tonight)

when waiting for my train home i met a former classmate from high school there (who i'll tag as z cause that's his first initial), he studies in brno and only has seminars until wednesday, hence why i met him on thursday, he was surprised to learn that i take the bus/train to and from prague everyday, as we both live in pilsen (on the same street actually but that's beside the point)

koku daily message:
science is not finished until it's communicated

comments

Tuesday 2025-10-07

Tue, 07 Oct 2025 11:46:39 GMT

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

koku daily message:
despite everything, I'm still here

comments