<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dw="https://www.dreamwidth.org">
  <id>tag:dreamwidth.org,2025-10-04:4245574</id>
  <title>koku's life journal</title>
  <subtitle>studying notes and such</subtitle>
  <author>
    <name>Koku!</name>
  </author>
  <link rel="alternate" type="text/html" href="https://kokulife.dreamwidth.org/"/>
  <link rel="self" type="text/xml" href="https://kokulife.dreamwidth.org/data/atom"/>
  <updated>2026-03-10T19:37:44Z</updated>
  <dw:journal username="kokulife" type="personal"/>
  <entry>
    <id>tag:dreamwidth.org,2025-10-04:4245574:10035</id>
    <link rel="alternate" type="text/html" href="https://kokulife.dreamwidth.org/10035.html"/>
    <link rel="self" type="text/xml" href="https://kokulife.dreamwidth.org/data/atom/?itemid=10035"/>
    <title>kokulife @ 2026-03-10T20:11:00</title>
    <published>2026-03-10T19:31:08Z</published>
    <updated>2026-03-10T19:37:44Z</updated>
    <category term="ntin060"/>
    <category term="dijkstra's algorithm"/>
    <category term="linear map"/>
    <category term="eigenvalue"/>
    <category term="nmai058"/>
    <category term="spanning tree"/>
    <category term="graph theory"/>
    <category term="shortest path"/>
    <category term="matrix"/>
    <category term="strongly connected components"/>
    <category term="sharir's algorithm"/>
    <category term="ntin107"/>
    <dw:security>public</dw:security>
    <dw:reply-count>0</dw:reply-count>
    <content type="html">&lt;p&gt;it happened again.. i didn'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'll avoid it by just skipping days whenever this happens, and fingers crossed it won'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'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'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'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'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'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="https://www.dreamwidth.org/tools/commentcount?user=kokulife&amp;ditemid=10035" width="30" height="12" alt="comment count unavailable" style="vertical-align: middle;"/&gt; comments</content>
  </entry>
</feed>
