koku's life journal

Thursday 2026-02-19

Thu, 19 Feb 2026 17:53:25 GMT

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-06

Mon, 10 Nov 2025 14:09:09 GMT

NPRG062 (Introduction to algorithms) [tutorial] - went over what we did on the lectures, mostly focusing on the data structures of lifo fifo and the linked list, i also realised on my own that if you go through a list using the stack over and over you can leave with any permutation you want because you can a transposition by taking right after every put except for the first of the two you want to swap and after the second one you want to swap you take two.. and you can reach any permutation using a series of transpositions

NPRG030 (Programming 1) [tutorial] - reading from a file and making graphs using matplotlib! homework is to parse a csv of the weather in prague since 1775 and make some graphs of it

NJAZ070 (English for Upper-Intermediate Students I) - test.. i did all of it except for forgetting a synonym for compliment s/o.. i hope i did well though.. also went over homework about imperatives in maths (prove, define, take etc.) after that we started the next chapter of the book

koku daily message:
all the change begins with us

comments

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