koku's life journal

Thursday 2026-02-19

2026-02-19T17:53:25Z

NPRG031 (Programming 2) [lecture] - c#, not too dissimilar from the lecture for NSWI170 from yesterday, just with c# instead of c++, i've found out how .dlls happen and about the LI, which is analogous to the java virtual machine.. also how to pass a variable as a reference instead of a value to a function

NMAI054 (Mathematical analysis 1) [lecture] - we haven't begun calculus just yet, just did things about infinite sets of numbers, like the natural, integers, rationals, reals and complexes (complices?), proof that rationals and below are countable infinities, and proof that the reals form an uncountable infinity, attributes of subsets of the reals, like minimum/maximum, infimum/supremum and similar

NPRG031 (Prgramming 2) [tutorial] - no programming just yet, as we don't really know much about the syntax of c#, so we had an exercise in what the teacher called train sort.. we were given a series of marshalling yard shapes and we had to decide whether it could be used to sort any arbitrary array of n trains, essentially trying to prove whether a combination of LIFOs, FIFOs and connections between them could be used to permute any word of length n, so more to do with permutations than sorting, also we among other things used an approximation of n! to prove that if you have any constant amount of stacks where you can only move in to the first stack, from the nth stack to the (n+1)th stack, and from the last stack out, you cannot sort a sufficiently large amount of trains gosh i have a lot to say

koku daily message:
even a computer scientist is a mathematician

comments

Thursday 2025-11-13

2025-11-13T19:32:51Z

NPRG062 (Introduction to algorithms) [tutorial] - went over homework and then did some things regarding binary heaps and linked lists, i've come to the conclusion that i like heaps, what a silly data structure

NPRG030 (Programming 1) [tutorial] - linked lists, specifically working towards the homework we have where we are given a series of natural numbers and we have to, using a linked list, sort it in a way that first are the sorted evens then sorted odds

NJAZ070 (English for Upper-Intermediate Students I) - i did pretty well on the test! 26/30 with the best score in the class being 27/30, after going over the test answers and the homework we were told about how to structure the essay we're writing in 3 weeks.. i'm a little afraid of it, as i always am with essays, for what if none of the subjects speak to me.. it's going to be an argumentative essay, with the little time left we also did some thing from the book..

no adventure this week because i was feeling really week and also i couldn't find a place i wanted to adventure in..

NMSA230 (Introduction to R programming) - data frames! good way to structure data and work with it it seems, how to merge multiple data frames together, how to make subsets, how to analyse them and the library stargazer, which creates a TeX table from a data frame, around the end we also found out how to extract data from a csv/excel

koku daily message:
today has been a good day

comments

Tuesday 2025-11-11

2025-11-11T12:54:56Z

NPRG062 (Introduction to algorithms) [lecture] - the (binary) heap! how to implement it using a list, indexing it from 1 is better because then the index of the parent node is n/2 rounded down and the index of its children is 2n and 2n+1, heap sort as example of a sort that has O(nlog(n)) and is in-place, dictionary and how to deal with a collision caused by the hashing function not being injective

NPRG030 (Programming 1) [lecture] - defined a class that uses a linked list to create a double sided queue and shows how to use assert, then some oop theory, which i know.. python has duck typing, meaning that "if it walks like a duck and it quacks like a duck, then it must be a duck", the teacher gave an example from his life where he got on a filming van during the filming of the movie amadeus and he did what he was told to, so he has a small role in the movie, despite not being cast in it

koku daily message:
stirling approximation

comments

Tuesday 2025-11-04

2025-11-04T13:30:58Z

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

Thursday 2025-10-23

2025-10-23T13:53:27Z

NPRG062 (Introduction to algorithms) [tutorial] - we didn't go over the coursework as the teacher has accidentally set it to 9:50 pm instead of am so a lot of people haven't done it yet, instead we did some sorts and big O notation...

NPRG030 (Programming 1) [tutorial] - went over the coursework and then using a real example of a hangman game to introduce the concept of cutting a problem into smaller parts using functions

NJAZ070 (English for Upper-Intermediate Students I) - for the mathematics part we learned how to avoid ambiguity when reading a mathematical statement out loud, then read an article about how birth order affects children, and i mentioned the čapek play matka as an example of parents being protective of their last born children

koku daily message:
goof for good

comments

Tuesday 2025-10-14

2025-10-14T11:00:18Z

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