Thursday 2026-02-26

2026-02-26T17:43:21Z

NPRG031 (Programming 2) [lecture] - objects in c#.. virtual methods and the VMT (virtual method table).. i learned something new and that is properties, as i'm used to java which doesn't have them, essentially it's a built in way of making getters and setters for private/protected data of an object

NMAI054 (Mathematical analysis 1) [lecture] - neighbourhood and limits of a series and also properties of series, idk what else to add i'm sorry

NPRG031 (Prgramming 2) [tutorial] - more train sort, next week we'll start typing code, this time we even had a yard that had big O of less than nlogn, i forget which it was though.. also a different one that utilized quicksort

koku daily message:
today's horoscope...
quick

comments

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

koku's life journal

Thursday 2026-02-26

Thursday 2026-02-19