koku's life journal

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

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

NMAI069 (Mathematical skills) - we did propositional logic, nothing that i didn't already know

NDMI002 (Discrete mathematics) [lecture] - binary relations, their compositions, how they all relate to functions and composite functions. then we did properties of functions (injective, surjective and bijective) if they are the same size and finite then being injective proves it's surjective and vice versa. properties of binary relations, which are reflexive, symmetrical, anti-symmetrical and transitive

NDMI002 (Discrete mathematics) [tutorial] - we went over types of proofs (direct, indirect, by contradiction and by induction) and then had exercises where we had to prove various statements using those methods