<?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>Tue, 10 Mar 2026 19:31:08 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/10035.html</guid>
  <pubDate>Tue, 10 Mar 2026 19:31:08 GMT</pubDate>
  <link>https://kokulife.dreamwidth.org/10035.html</link>
  <description>&lt;p&gt;it happened again.. i didn&apos;t update for a few days and gotten too overwhelmed by the backlog, which is exactly what made me give up last semester.. so this time i&apos;ll avoid it by just skipping days whenever this happens, and fingers crossed it won&apos;t any time soon!!&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI058 (Linear algebra 2) [lecture] - eigenvalues of linear maps and matrices.. what is an eigenvalue anyway, right? linear algebra is already going over my head and the semester started only a month ago..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NTIN060 (Algorithms and Data Structures 1) [lecture] - sharir&apos;s algorithm for finding the strongly connected components of an oriented graph and algorithms for finding the shortest path in an oriented graph, but we only had time for dijkstra&apos;s algorithm, my beloved&lt;/p&gt;&lt;br /&gt;&lt;p&gt;i now have a three hour block of free time again, although this time it&apos;s every week, since I was getting tired of eating fast food and supermarket baguette sandwiches all the time, i went to miyabi, a japanese restaurant near lazarská, got two onigiri and some tsukemono to go, then took the tram to výstaviště, where i ate it, it tasted pretty good&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NTIN107 (Extension seminar Algorithms and Data Structures 1) - i started attending last week, but i didn&apos;t blog about it, this seminar uses algovision.org, a website created by the professor, to visualise the various algorithms and data structures, he goes over it and explains it, we did spanning tree algoritms, which are curious because two of them have been discovered by czechs, later rediscovered by other people, those being the jarník-prim algorithm and the borůvka algorithm, but i like kruskal&apos;s algorithm (who was british) because when the professor introduced the problem that was the algorithm i have come up with on the spot myself!!&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;it is a yukkuri day!&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=10035&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/10035.html</comments>
  <category>ntin060</category>
  <category>shortest path</category>
  <category>graph theory</category>
  <category>strongly connected components</category>
  <category>nmai058</category>
  <category>ntin107</category>
  <category>spanning tree</category>
  <category>dijkstra&apos;s algorithm</category>
  <category>linear map</category>
  <category>matrix</category>
  <category>sharir&apos;s algorithm</category>
  <category>eigenvalue</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/9852.html</guid>
  <pubDate>Thu, 26 Feb 2026 17:43:21 GMT</pubDate>
  <title>Thursday 2026-02-26</title>
  <link>https://kokulife.dreamwidth.org/9852.html</link>
  <description>&lt;p&gt;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&apos;m used to java which doesn&apos;t have them, essentially it&apos;s a built in way of making getters and setters for private/protected data of an object&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI054 (Mathematical analysis 1) [lecture] - neighbourhood and limits of a series and also properties of series, idk what else to add i&apos;m sorry&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NPRG031 (Prgramming 2) [tutorial] - more train sort, next week we&apos;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&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;today&apos;s horoscope...&lt;br /&gt;quick&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=9852&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/9852.html</comments>
  <category>permutations</category>
  <category>neighbourhood</category>
  <category>nprg031</category>
  <category>train sort</category>
  <category>quick sort</category>
  <category>limits</category>
  <category>c#</category>
  <category>nmai054</category>
  <category>properties of series</category>
  <category>virtual methods</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/9632.html</guid>
  <pubDate>Thu, 26 Feb 2026 11:20:14 GMT</pubDate>
  <title>Wednesday 2026-02-25</title>
  <link>https://kokulife.dreamwidth.org/9632.html</link>
  <description>&lt;p&gt;NJAZ072 (English for upper-intermediate students II) - future stuff, as in talking about where we see ourselves and the world at large in 1/10 years, phrases including the word time and a group exercise where there were 4 superpowers with a drawback and everyone in a group got assigned one who had to defend it, i had time travel but you age 2x as fast, my defence was talking about how you could have infinite money via the stock exchange and use that money to buy all those anti-aging product that people talk about on tiktok&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI170 (Computer systems) [lecture] - pointers and references and similar things idk..&lt;/p&gt;&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=9632&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/9632.html</comments>
  <category>reference</category>
  <category>njaz072</category>
  <category>nswi170</category>
  <category>future tenses</category>
  <category>pointer</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/9451.html</guid>
  <pubDate>Tue, 24 Feb 2026 14:27:31 GMT</pubDate>
  <title>Tuesday 2026-02-24</title>
  <link>https://kokulife.dreamwidth.org/9451.html</link>
  <description>&lt;p&gt;NMAI058 (Linear algebra 2) [lecture] - laplace expansion which is used to obtain an adjugate matrix, note that you gain an ith column from using laplace expansion on the ith row, correlation between the adjugate matrix the inverse matrix and the determinant, then cramer&apos;s rule, only taught to better understand what we&apos;ve done before, but not really used in any practical calculation and finished with the geometrical use of a determinant as in it&apos;s the volume of the parallelepiped (what a name!!) created from given vectors&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NTIN060 (Algorithms and Data Structures 1) [lecture] - technical difficulties with recording of the lecture, depth first search of graphs, theta of memory and time of it, classifications of edges in a graph based on the dfs, one application of it being finding all the bridges of a graph&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;today&apos;s lucky item...&lt;br /&gt;an adjugate matrix&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=9451&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/9451.html</comments>
  <category>graph theory</category>
  <category>dfs</category>
  <category>nmai058</category>
  <category>deteminant</category>
  <category>parallelepiped</category>
  <category>inverse matrix</category>
  <category>laplace expansion</category>
  <category>cramer&apos;s rule</category>
  <category>adjugate matrix</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/9190.html</guid>
  <pubDate>Mon, 23 Feb 2026 17:32:03 GMT</pubDate>
  <title>Monday 2026-02-23</title>
  <link>https://kokulife.dreamwidth.org/9190.html</link>
  <description>&lt;p&gt;went to the library to borrow the arduino before class started, no NSWI170 today as it&apos;s only every other week&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI054 (Mathematical analysis 1) [tutorial] - focusing on properties of sets of numbers..like: suprema, maxima, infima and minima of subsets of rationals and reals, which properties (like a set being bounded, being countably infinite etc.) imply other properties and at the end suprema and minima of generalized sets, like supremum/infimum of the union of two sets or a set created by summing every member of each set with the other and such, i got a lot of things correct&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;if you like hot dogs you are gonna love pizza&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=9190&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/9190.html</comments>
  <category>that&apos;s all i suppose</category>
  <category>sets of numbers</category>
  <category>nmai054</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/8825.html</guid>
  <pubDate>Fri, 20 Feb 2026 14:50:21 GMT</pubDate>
  <title>Friday 2026-02-20</title>
  <link>https://kokulife.dreamwidth.org/8825.html</link>
  <description>&lt;p&gt;NTIN060 (Algorithms and data structures 1) [tutorial] - big O notation, mostly just revision of last semester + small o notation, which to my understanding is like the difference between a maximum and a supremum (in a way i suppose..)&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI058 (Linear algebra 2) [tutorial] - determinant of a matrix, we solved a few and then came the &lt;i&gt;determinant olympics,&lt;/i&gt; something the teacher does every year, but only once every four it lands on the time of the winter olympics, one and a half dozen matrices (1/3 3x3 for 1 point each, 1/3 4x4 for 2 points each and the rest 5x5 for 3 points) whoever solved the determinant of a matrix first got the points.. i got 6 points placing me on a nice tied for 2nd place!! so i got a fidorka, which is a czech biscuit.. notable for being the one i got on Friday 2025-10-10 during NSWI120! if i had a nickel for every time...&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI177 (Introduction to Linux) - i am already pretty much introduced to linux as i use it on my main desktop since 2020.. also git, but i also know how to use that..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;went to borrow an arduino for NSWI170, but the library was closed, then the train i was going to take home was cancelled/delayed idk it just said that i can use the following alternative trains instead and there was nothing, so i went to mcdonalds, got a fillet of fish burger, medium fries and an iced tea and ate and drank that at výstaviště and then went back to the train station and wrote this blog post&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;silver medal&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=8825&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/8825.html</comments>
  <category>deteminant</category>
  <category>mcdonalds</category>
  <category>nmai058</category>
  <category>big o</category>
  <category>ntin060</category>
  <category>nswi177</category>
  <category>výstaviště</category>
  <category>matrix</category>
  <category>linux</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<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>infinites</category>
  <category>permutations</category>
  <category>train sort</category>
  <category>nprg031</category>
  <category>functions</category>
  <category>c#</category>
  <category>.dll</category>
  <category>sorting</category>
  <category>queue</category>
  <category>stack</category>
  <category>sets of numbers</category>
  <category>reals</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/8194.html</guid>
  <pubDate>Wed, 18 Feb 2026 19:53:58 GMT</pubDate>
  <title>Wednesday 2026-02-18</title>
  <link>https://kokulife.dreamwidth.org/8194.html</link>
  <description>i wasn&apos;t at school yesterday because i was at the psychiatrist and wouldn&apos;t make it on toime to school&lt;br /&gt;&lt;p&gt;NJAZ072 (English for upper-intermediate students II) - going over grading and other stuff.. something in the textbook regarding employment.. at one point the entire class (8 people) were split into two groups of 4 where one person was assigned ceo (that was me) who had to pick one employee not to get sacked, i struggled to just pick one, in the other group it was easy as two of the people didn&apos;t even wanna work there, in the end i said something along the lines of &quot;i&apos;m a worker person, i don&apos;t wanna fire anyone.. can i lay off myself?&quot; the whole exercise was very funny though!&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI170 (Computer systems) [lecture] - went over the syllabus of the class, the first two weeks are gonna be about c/c++, i learnt a total of one (1) thing, apparently i&apos;ve been writing c style for cycles wrong my whole life!! when you increment the counter it&apos;s common practice to write it as ++i, i&apos;ve been writing it as i++.. so there is that, also the teacher is not nearly as funny as the NSWI120 teacher even though he clearly tries to&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;i live on fish bowlevard&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=8194&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/8194.html</comments>
  <category>for cycles??</category>
  <category>njaz072</category>
  <category>nswi170</category>
  <category>idk what tags to use today</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>functions</category>
  <category>inequalities</category>
  <category>nswi170</category>
  <category>nmai054</category>
  <category>c++</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/7919.html</guid>
  <pubDate>Wed, 19 Nov 2025 16:10:01 GMT</pubDate>
  <title>Wednesday 2025-11-19</title>
  <link>https://kokulife.dreamwidth.org/7919.html</link>
  <description>&lt;p&gt;NTVY014 (Physical education I) [swimming] - practised more of backstroke and breaststroke (i can finally sync up the breathing right!!) started on front crawl, it is difficult..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI057 (Linear algebra 1) [lecture] - mostly stuff i did not comprehend, focusing on subspaces and linear span, will have to look into it more when i have time, also linear independence which i somewhat understand!&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI057 (Linear algebra 1) [tutorial] - didn&apos;t do well on last week&apos;s quiz, but i think i demolished today&apos;s, after we found an inverse of a matrix within a skew field and some other things with skew fields, little bit on vector spaces&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;rest up when you can&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=7919&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/7919.html</comments>
  <category>front crawl</category>
  <category>subspace</category>
  <category>linear independence</category>
  <category>skew field</category>
  <category>nmai057</category>
  <category>vector space</category>
  <category>ntvy014</category>
  <category>linear span</category>
  <category>breaststroke</category>
  <category>backstroke</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/7618.html</guid>
  <pubDate>Tue, 18 Nov 2025 12:03:00 GMT</pubDate>
  <title>Tuesday 2025-11-18</title>
  <link>https://kokulife.dreamwidth.org/7618.html</link>
  <description>&lt;p&gt;NPRG062 (Introduction to algorithms) [lecture] - recursion, see also: today&apos;s daily message, including the classic example of the fibonacci sequence, how to deal with unnecessary calculation of the same things by using caching or by building from the bottom up and the best way to do it, which uses matrices, you raise the matrix ((0,1),(1,1)) to the nth power and then multiply by the vector (f0,f1), you can use the quick raising to the power by using the binary representation of n, gosh this is a long entry, we also did recursive generation, like how to break up a number into all the sums it can be made of&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NPRG030 (Programming 1) [lecture] - int(&quot;number&quot;) isn&apos;t actually a function, it&apos;s a constructor! most of the class was focused on working with files, things i know and we did during the tutorial previously.. also the way strings are interpreted in memory (they terminate at a specific char, like c strings) and the walrus operator := which has a silly name methinks&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;recursion, see also: recursion&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=7618&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/7618.html</comments>
  <category>nprg062</category>
  <category>fibonacci</category>
  <category>file reading</category>
  <category>matrix multiplication</category>
  <category>recursion</category>
  <category>nprg030</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/7294.html</guid>
  <pubDate>Tue, 18 Nov 2025 11:51:58 GMT</pubDate>
  <title>Friday 2025-11-14</title>
  <link>https://kokulife.dreamwidth.org/7294.html</link>
  <description>&lt;p&gt;NSWI141 - (Introduction to networking) [lecture] - css, just stuff i knew, sadly.. i don&apos;t know what else to add..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI120 (Principles of computers) [lecture] - how processors work with memory, the difference between compilers and interpreters, where the term little/big endian comes from (it&apos;s from gulliver&apos;s travels), von neumann&apos;s architecture of a computer (the one with a shared space for data and programs) and some history of processor architectures&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;hanlon&apos;s razor&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=7294&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/7294.html</comments>
  <category>nswi120</category>
  <category>nswi141</category>
  <category>processor architecture</category>
  <category>von neumann</category>
  <category>computer architecture</category>
  <category>css</category>
  <category>endianity</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/7005.html</guid>
  <pubDate>Thu, 13 Nov 2025 19:32:51 GMT</pubDate>
  <title>Thursday 2025-11-13</title>
  <link>https://kokulife.dreamwidth.org/7005.html</link>
  <description>&lt;p&gt;NPRG062 (Introduction to algorithms) [tutorial] - went over homework and then did some things regarding binary heaps and linked lists, i&apos;ve come to the conclusion that i like heaps, what a silly data structure&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&apos;re writing in 3 weeks.. i&apos;m a little afraid of it, as i always am with essays, for what if none of the subjects speak to me.. it&apos;s going to be an argumentative essay, with the little time left we also did some thing from the book..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;no adventure this week because i was feeling really week and also i couldn&apos;t find a place i wanted to adventure in..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;today has been a good day&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=7005&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/7005.html</comments>
  <category>stargazer</category>
  <category>nmsa230</category>
  <category>data frames</category>
  <category>latex</category>
  <category>nprg030</category>
  <category>linked list</category>
  <category>csv</category>
  <category>binary heap</category>
  <category>sorting</category>
  <category>nprg062</category>
  <category>essay</category>
  <category>njaz070</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/6779.html</guid>
  <pubDate>Tue, 11 Nov 2025 12:54:56 GMT</pubDate>
  <title>Tuesday 2025-11-11</title>
  <link>https://kokulife.dreamwidth.org/6779.html</link>
  <description>&lt;p&gt;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)) &lt;i&gt;and&lt;/i&gt; is in-place, dictionary and how to deal with a collision caused by the hashing function not being injective&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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 &quot;if it walks like a duck and it quacks like a duck, then it must be a duck&quot;, 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&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;stirling approximation&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=6779&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/6779.html</comments>
  <category>nprg030</category>
  <category>duck typing</category>
  <category>oop</category>
  <category>sorting</category>
  <category>nprg062</category>
  <category>dictionary</category>
  <category>binary heap</category>
  <category>heap</category>
  <category>linked list</category>
  <category>heapsort</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/6565.html</guid>
  <pubDate>Mon, 10 Nov 2025 18:17:30 GMT</pubDate>
  <title>Monday 2025-11-10</title>
  <link>https://kokulife.dreamwidth.org/6565.html</link>
  <description>&lt;p&gt;NMAI069 (Mathematical skills) - just set theory nothing much of note.. next week we have a quiz&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [lecture] - probability, defined the random variable and expected value of a random variable, trivial proof of linearity of expectation.. then markov&apos;s inequality, only used to prove chebyshev&apos;s inequality we&apos;ll see what use that has sometime else&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [tutorial] - a quiz that i&apos;ve made a small mistake on and also didn&apos;t write out that well, some problems on probability including the classic 20 people who don&apos;t share a birthday problem but also others like electronics with a fixed chance of being broken and sex assigned at birth, all pretty simple things&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;take it easy but take it&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=6565&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/6565.html</comments>
  <category>set theory</category>
  <category>nmai069</category>
  <category>probability</category>
  <category>expected value</category>
  <category>nmai057</category>
  <category>ndmi002</category>
  <category>chebyshev&apos;s inequality</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/6284.html</guid>
  <pubDate>Mon, 10 Nov 2025 14:16:12 GMT</pubDate>
  <title>Friday 2025-11-07</title>
  <link>https://kokulife.dreamwidth.org/6284.html</link>
  <description>&lt;p&gt;NSWI141 - (Introduction to networking) [lecture] - html.. exclusively things i know, but i&apos;ve found out how to get a personal website on the school&apos;s server, so that&apos;s something&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI120 (Principles of computers) [lecture] - ram! it&apos;s volatile, difference between sram and dram (dram has to be refreshed every so often but more data can fit in the same space also definition of kB and KiB (KiB is better and usually just called kB)... the teacher has made a short presentation, that presentation being in 4:3 for some reason.. overall kinda boring still as was the networking class&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;only one earth&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=6284&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/6284.html</comments>
  <category>dram</category>
  <category>html</category>
  <category>sram</category>
  <category>nswi120</category>
  <category>nswi141</category>
  <category>ram</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/6099.html</guid>
  <pubDate>Mon, 10 Nov 2025 14:09:09 GMT</pubDate>
  <title>Thursday 2025-11-06</title>
  <link>https://kokulife.dreamwidth.org/6099.html</link>
  <description>&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;p&gt;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&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;all the change begins with us&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=6099&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/6099.html</comments>
  <category>matplotlib</category>
  <category>permutations</category>
  <category>file reading</category>
  <category>nprg030</category>
  <category>linked list</category>
  <category>data structures</category>
  <category>imperative</category>
  <category>queue</category>
  <category>nprg062</category>
  <category>stack</category>
  <category>njaz070</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/5698.html</guid>
  <pubDate>Mon, 10 Nov 2025 13:56:08 GMT</pubDate>
  <title>Wednesday 2025-11-05</title>
  <link>https://kokulife.dreamwidth.org/5698.html</link>
  <description>&lt;p&gt;NTVY014 (Physical education I) [swimming] - swimming with flippers! just backstroke though, it was a little fun although the top of my left foot hurt a bit after&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI057 (Linear algebra 1) [lecture] - finished skew fields with fields based on modular arithmetic and started vector spaces, including funky things like a vector space of systems of sets with the function of symmetrical difference&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI057 (Linear algebra 1) [tutorial] - continued on with permutations, one person decided to go do a problem on the board in front of the class and he was so bad at it it made the teacher rather mad.. it made me feel really bad but on the good side i comprehended all of what we went over!&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;can&apos;t rain all the time&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=5698&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/5698.html</comments>
  <category>swimming</category>
  <category>backstroke</category>
  <category>symmetrical difference</category>
  <category>ntvy014</category>
  <category>vector space</category>
  <category>skew field</category>
  <category>flippers</category>
  <category>permutations</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/5575.html</guid>
  <pubDate>Tue, 04 Nov 2025 13:30:58 GMT</pubDate>
  <title>Tuesday 2025-11-04</title>
  <link>https://kokulife.dreamwidth.org/5575.html</link>
  <description>&lt;p&gt;NPRG062 (Introduction to algorithms) [lecture] - proof that the best big O of a sorting function is nlog(n) using a binary tree and stirling&apos;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)&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NPRG030 (Programming 1) [lecture] - tuples, dictionaries and objects, apparently big o of a dictionary is O(1) except for when it sometimes isn&apos;t.. and an implementation of linked lists&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;amplification&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=5575&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/5575.html</comments>
  <category>sorting</category>
  <category>python</category>
  <category>stack</category>
  <category>dictionary</category>
  <category>bucketsort</category>
  <category>queue</category>
  <category>nprg062</category>
  <category>linked list</category>
  <category>data structures</category>
  <category>nprg030</category>
  <category>object</category>
  <category>radixsort</category>
  <category>big o</category>
  <category>countsort</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/5138.html</guid>
  <pubDate>Tue, 04 Nov 2025 13:18:50 GMT</pubDate>
  <title>Monday 2025-11-03</title>
  <link>https://kokulife.dreamwidth.org/5138.html</link>
  <description>&lt;p&gt;no NMAI069 today because i was at the psychiatrist in the morning and when i arrived i didn&apos;t want to show up for just the end of the class&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [lecture] - problem of a cloakroom attendant which in other words is the probability of a permutation to have no anchors (elements that permute onto oneself).. as the amount of things permuted nears infinity the probability approaches e^-1, with that we ended combinatorics and started with probability we had an example of a disease test with a specific probability of not working out that lead to the introduction of bayes&apos; theorem&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [tutorial] - had a quiz which i failed... after the quiz we had some examples of using the inclusion exclusion principle including counting the amount of surjective functions from and to a finite set!&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;that&apos;s the way, positivity is the best!&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=5138&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/5138.html</comments>
  <category>properties of functions</category>
  <category>probability</category>
  <category>inclusion exclusion principle</category>
  <category>permutations</category>
  <category>ndmi002</category>
  <category>bayes&apos; theorem</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/5003.html</guid>
  <pubDate>Mon, 03 Nov 2025 10:42:02 GMT</pubDate>
  <title>Friday 2025-10-31</title>
  <link>https://kokulife.dreamwidth.org/5003.html</link>
  <description>&lt;p&gt;NSWI141 - (Introduction to networking) [lecture] - going over www again, we have a homework due the end of the semester, making a static site of three documents in pure html and css, subject can be anything as long as it contains the elements it&apos;s meant to have, the only thing i&apos;ve learnt that i didn&apos;t know prior is the word selenocetric, which was mentioned on a document the teacher showed as an example of a static website, not really having anything to do with websites though&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI120 (Principles of computers) [lecture] - moving from the serial mouse onto buses (not motorbuses) specifically going over I2C which i already knew a lot about from iot classes in high school, but i learned why the idle state is SCL high, it&apos;s because there is a pull up resistor&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;cosh(e)&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=5003&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/5003.html</comments>
  <category>nswi120</category>
  <category>i2c</category>
  <category>nswi141</category>
  <category>www</category>
  <category>css</category>
  <category>html</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/4713.html</guid>
  <pubDate>Thu, 30 Oct 2025 19:30:26 GMT</pubDate>
  <title>Thursday 2025-10-30</title>
  <link>https://kokulife.dreamwidth.org/4713.html</link>
  <description>&lt;p&gt;NPRG062 (Introduction to algorithms) [tutorial] - went over homework regarding big o of various functions and grouping them based on when they share the big o, that was it&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NPRG030 (Programming 1) [tutorial] - i programmed newton method for approximating a function for any polynomial(!) homework is writing a polynomial calculator for addition, multiplication and division&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NJAZ070 (English for Upper-Intermediate Students I) - no english mathematics today, just focusing on exercises from the book, some to do with tenses of the past and some about vocabulary, homework was reading an article about mobile phones from the book and answering some questions, one guy in the class was dressed as mario cause it&apos;s almost halloween and he was going to some hockey game later to day with friends and they were all dressed up for halloween i think&lt;/p&gt;&lt;br /&gt;&lt;p&gt;another three hour block of no classes, went to ikea this time walked around for a bit looking at all the furniture and stuff it was rather interesting, then ate falafel, in the end i ended up buying the funny rat, gosig råtta&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMSA230 (Introduction to R programming) - the entire class was dedicated to probability functions both discrete and continuous and how to work with them, i have no background in any statistics so i&apos;ll have to learn those things on my own time&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;billy the bookcase&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=4713&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/4713.html</comments>
  <category>past tenses</category>
  <category>njaz070</category>
  <category>nprg062</category>
  <category>polynomials</category>
  <category>vocabulary</category>
  <category>probability</category>
  <category>big o</category>
  <category>nmsa230</category>
  <category>newton method</category>
  <category>nprg030</category>
  <category>ikea</category>
  <category>adventure</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/4592.html</guid>
  <pubDate>Thu, 30 Oct 2025 19:23:02 GMT</pubDate>
  <title>Wednesday 2025-10-29</title>
  <link>https://kokulife.dreamwidth.org/4592.html</link>
  <description>no class on tuesday due to the state holiday&lt;br /&gt;&lt;p&gt;NTVY014 (Physical education I) [swimming] - breaststroke arms and breathing.. i struggle with breathing on time.. usually end up breathing in some water&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI057 (Linear algebra 1) [lecture] - symmetrical groups and attributes of permutations like the sign and amount of inversions and the inversion of the permutation (2 different things!!) then we started skew fields, nice stuff&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NMAI057 (Linear algebra 1) [tutorial] - there was a quiz again, i think i demolished and left only one piece of rubble (there was an equation of matrices and the solution only worked on matrices that commute so i wrote out all the possibilities when they commute but forgot about the inverse, after the quiz we inverted some matrices and did some things regarding attributes of permutations&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;thank you for observing the rules of the quiet zone&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=4592&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/4592.html</comments>
  <category>breaststroke</category>
  <category>swimming</category>
  <category>attributes of permutations</category>
  <category>ntvy014</category>
  <category>nmai057</category>
  <category>inverse matrix</category>
  <category>symmetrical groups</category>
  <category>permutations</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/4275.html</guid>
  <pubDate>Thu, 30 Oct 2025 19:11:23 GMT</pubDate>
  <title>Monday 2025-10-27</title>
  <link>https://kokulife.dreamwidth.org/4275.html</link>
  <description>&lt;p&gt;NMAI069 (Mathematical skills) - got 19/20 on the quiz! after we wrote some statements using qualifiers or something..&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [lecture] - proof of the binomial theorem using induction, amount of permutations of poker cards (even without the jokers) is more than the amount of atoms on earth! approximations of factorial its between e(n/e)^n and en(n/e)^n and it&apos;s approximately sqrt(2pi)n(n/e)^n which is head exploding emoji, approximations of binomial coefficients.. inclusion exclusion principle and its proof, application of it by counting the amount of numbers divisible by 2 or 3 or 5 under 120&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NDMI002 (Discrete mathematics) [tutorial] - finished relations and moved unto combinatorics, more specifically solving equations containing combinations by coming up with good use cases of both sides and proving they describe the same reality&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;break glass in case of emergency&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=4275&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/4275.html</comments>
  <category>nmai069</category>
  <category>relations</category>
  <category>factorial</category>
  <category>ndmi002</category>
  <category>combinatorics</category>
  <category>combinations</category>
  <category>inclusion exclusion principle</category>
  <category>binomial theorem</category>
  <category>qualifiers</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
<item>
  <guid isPermaLink='true'>https://kokulife.dreamwidth.org/3992.html</guid>
  <pubDate>Sat, 25 Oct 2025 09:17:48 GMT</pubDate>
  <title>Friday 2025-10-24</title>
  <link>https://kokulife.dreamwidth.org/3992.html</link>
  <description>&lt;p&gt;NSWI141 - (Introduction to networking) [lecture] - ftp!! distributed databases in which we mentioned gopher and then went into detail over www and http, also i&apos;ll mention he calls computer mice rats and that&apos;s silly, for the next three weeks he won&apos;t be here though so we&apos;ll have a different teacher and we&apos;ll do html and stuff i think&lt;/p&gt;&lt;br /&gt;&lt;p&gt;NSWI120 (Principles of computers) [lecture] - boring class again.. we did bit shifts and bit rotation, and finished the serial mouse with signed integers :spiral_eyes: also the teacher was late by ten minutes and i was worried that i wouldn&apos;t make my train in time but i did&lt;/p&gt;&lt;br /&gt;&lt;hr&gt;&lt;br /&gt;koku daily message:&lt;br /&gt;free at last&lt;br /&gt;&lt;br /&gt;&lt;img src=&quot;https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=3992&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/3992.html</comments>
  <category>http</category>
  <category>www</category>
  <category>ftp</category>
  <category>nswi120</category>
  <category>nswi141</category>
  <category>signed int</category>
  <lj:security>public</lj:security>
  <lj:reply-count>0</lj:reply-count>
</item>
</channel>
</rss>
