<?xml version='1.0' encoding='utf-8' ?>

<rss version='2.0' xmlns:lj='http://www.livejournal.org/rss/lj/1.0/' xmlns:atom10='http://www.w3.org/2005/Atom'>
<channel>
  <title>koku&apos;s life journal</title>
  <link>https://kokulife.dreamwidth.org/</link>
  <description>koku&apos;s life journal - Dreamwidth Studios</description>
  <lastBuildDate>Thu, 19 Feb 2026 17:53:25 GMT</lastBuildDate>
  <generator>LiveJournal / Dreamwidth Studios</generator>
  <lj:journal>kokulife</lj:journal>
  <lj:journaltype>personal</lj:journaltype>
  <image>
    <url>https://v2.dreamwidth.org/18093858/4245574</url>
    <title>koku&apos;s life journal</title>
    <link>https://kokulife.dreamwidth.org/</link>
    <width>100</width>
    <height>100</height>
  </image>

<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/8481.html</guid>
  <pubDate>Thu, 19 Feb 2026 17:53:25 GMT</pubDate>
  <title>Thursday 2026-02-19</title>
  <link>https://kokulife.dreamwidth.org/8481.html</link>
  <description>&lt;p&gt;NPRG031 (Programming 2) [lecture] - c#, not too dissimilar from the lecture for NSWI170 from yesterday, just with c# instead of c++, i&apos;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&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI054 (Mathematical analysis 1) [lecture] - we haven&apos;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 &lt;/p&gt;&lt;br /&gt;&lt;p&gt;NPRG031 (Prgramming 2) [tutorial] - no programming just yet, as we don&apos;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&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;even a computer scientist is a mathematician&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=8481&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://kokulife.dreamwidth.org/8481.html</comments>
  <category>sorting</category>
  <category>queue</category>
  <category>stack</category>
  <category>sets of numbers</category>
  <category>reals</category>
  <category>infinites</category>
  <category>permutations</category>
  <category>train sort</category>
  <category>nprg031</category>
  <category>functions</category>
  <category>c#</category>
  <category>.dll</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/8139.html</guid>
  <pubDate>Mon, 16 Feb 2026 18:54:57 GMT</pubDate>
  <title>Monday 2026-02-16</title>
  <link>https://kokulife.dreamwidth.org/8139.html</link>
  <description>&lt;p&gt;I&apos;m sorry for having given up blogging, i&apos;m gonna start again, as the second semester has started today&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI170 (Computer systems) [tutorial] - this is a sort of continuation of NSWI120 from last semester, except more hands on, we&apos;ll be programming in C/C++ and also programming arduinos, so more low level than what we&apos;ve done prior, we told some administrative things about the class, like how homework works and what we have to do to be allowed to the exam, then we did very simple programming things in C++ (printing and working with arrays)&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI054 (Mathematical analysis 1) [tutorial] - calculus!!! because we haven&apos;t had the lecture yet we only did revision of high school things we should already know, like inequalities in the reals of functions with abs, logs or fractions and drawing specific functions.. in high school we did a lot of calculus so i hope i won&apos;t struggle in this class...&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;the world is so beautiful&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=8139&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://kokulife.dreamwidth.org/8139.html</comments>
  <category>nmai054</category>
  <category>c++</category>
  <category>functions</category>
  <category>inequalities</category>
  <category>nswi170</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/3666.html</guid>
  <pubDate>Thu, 23 Oct 2025 13:53:27 GMT</pubDate>
  <title>Thursday 2025-10-23</title>
  <link>https://kokulife.dreamwidth.org/3666.html</link>
  <description>&lt;p&gt;NPRG062 (Introduction to algorithms) [tutorial] - we didn&apos;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&apos;t done it yet, instead we did some sorts and big O notation...&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;goof for good&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=3666&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://kokulife.dreamwidth.org/3666.html</comments>
  <category>njaz070</category>
  <category>nprg062</category>
  <category>sorting</category>
  <category>ambiguity</category>
  <category>nprg030</category>
  <category>čapek</category>
  <category>big o</category>
  <category>functions</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/2949.html</guid>
  <pubDate>Thu, 23 Oct 2025 13:16:09 GMT</pubDate>
  <title>Monday 2025-10-20</title>
  <link>https://kokulife.dreamwidth.org/2949.html</link>
  <description>alright, i&apos;ve put off writing blog posts for a bit, but i&apos;m back!! gonna write all of monday to thursday right now on the train&lt;br /&gt;&lt;p&gt;NMAI069 (Mathematical skills) - had a quiz on propositional logic, was simple, after that we went over something or other..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [lecture] - finished binary relations with the theorem &quot;about the long and broad&quot; proving that the product of the width and the length of a partially ordered is greater than or equal to the its size, then we started with combinatorial counting, permutation is bijection of X -&amp;gt; X, then something about power sets&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [tutorial] - a quiz, i felt rather confident with my solutions, but then the teacher wrote the best solution and they were much more elegant than mine.. after we did some exercises on functions and equivalence relations and didn&apos;t have time to get to the partially ordered sets&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;time is fuel&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=2949&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://kokulife.dreamwidth.org/2949.html</comments>
  <category>propositinal logic</category>
  <category>permutations</category>
  <category>functions</category>
  <category>equivalence relations</category>
  <category>power set</category>
  <category>combinatorics</category>
  <category>ndmi002</category>
  <category>nmai069</category>
  <category>binary relations</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/446.html</guid>
  <pubDate>Mon, 06 Oct 2025 16:47:52 GMT</pubDate>
  <title>Monday 2025-10-06</title>
  <link>https://kokulife.dreamwidth.org/446.html</link>
  <description>&lt;p&gt;NMAI069 (Mathematical skills) - we did propositional logic, nothing that i didn&apos;t already know&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&apos;s surjective and vice versa. properties of binary relations, which are reflexive, symmetrical, anti-symmetrical and transitive&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;tautology&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=446&quot; width=&quot;30&quot; height=&quot;12&quot; alt=&quot;comment count unavailable&quot; style=&quot;vertical-align: middle;&quot;/&gt; comments</description>
  <comments>https://kokulife.dreamwidth.org/446.html</comments>
  <category>mathematical proofs</category>
  <category>propositinal logic</category>
  <category>functions</category>
  <category>properties of relations</category>
  <category>ndmi002</category>
  <category>binary relations</category>
  <category>properties of functions</category>
  <category>nmai069</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
</channel>
</rss>
