<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Teaching on CuriousCoding</title><link>https://curiouscoding.nl/teaching/</link><description>Recent content in Teaching on CuriousCoding</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 20 Apr 2026 14:00:00 +0200</lastBuildDate><atom:link href="https://curiouscoding.nl/teaching/index.xml" rel="self" type="application/rss+xml"/><item><title>Advanced Data Structures</title><link>https://curiouscoding.nl/teaching/advanced-data-structures/</link><pubDate>Mon, 20 Apr 2026 14:00:00 +0200</pubDate><guid>https://curiouscoding.nl/teaching/advanced-data-structures/</guid><description>&lt;script src="https://curiouscoding.nl/livereload.js?mindelay=10&amp;amp;v=2&amp;amp;port=1313&amp;amp;path=livereload" data-no-instant defer&gt;&lt;/script&gt;
&lt;h2 id="organizational-matters"&gt;
 Organizational matters
 &lt;a class="heading-link" href="#organizational-matters"&gt;
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;
 &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;
 &lt;/a&gt;
&lt;/h2&gt;
&lt;p&gt;Lectures:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;In English&lt;/li&gt;
&lt;li&gt;Monday 14:00 - 15:30&lt;/li&gt;
&lt;li&gt;Building 50.34, room 236&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Grade:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;80% oral exam, 20 minutes&lt;/li&gt;
&lt;li&gt;20% programming project
&lt;ul&gt;
&lt;li&gt;Details coming a few weeks&lt;/li&gt;
&lt;li&gt;&lt;strong&gt;Requires registration&lt;/strong&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;h2 id="materials"&gt;
 Materials
 &lt;a class="heading-link" href="#materials"&gt;
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;
 &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;
 &lt;/a&gt;
&lt;/h2&gt;
&lt;p&gt;This year&amp;rsquo;s materials:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;The course page: &lt;a href="https://ae.iti.kit.edu/english/5028.php" class="external-link" target="_blank" rel="noopener"&gt;ae.iti.kit.edu/english/5028.php&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;Ragnar&amp;rsquo;s blog: &lt;a href="https://curiouscoding.nl/teaching" class="external-link" target="_blank" rel="noopener"&gt;curiouscoding.nl/teaching&lt;/a&gt;
&lt;ul&gt;
&lt;li&gt;Lecture notes and/or slides available shortly before the lecture&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Previously taught by &lt;a href="https://ae.iti.kit.edu/kurpicz.php" class="external-link" target="_blank" rel="noopener"&gt;Florian Kurpicz&lt;/a&gt;:&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://ae.iti.kit.edu/4719.php" class="external-link" target="_blank" rel="noopener"&gt;SS 2024 course materials &amp;amp; slides&lt;/a&gt; (in English)&lt;/li&gt;
&lt;li&gt;Recorded lectures on YouTube (&lt;a href="https://www.youtube.com/@kurpicz" class="external-link" target="_blank" rel="noopener"&gt;@kurpicz&lt;/a&gt;, in German):
&lt;ul&gt;
&lt;li&gt;&lt;a href="https://www.youtube.com/playlist?list=PL_0LCUdz-bRdL0FzPTfck5DUxuhUHjST0" class="external-link" target="_blank" rel="noopener"&gt;SS 2022&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.youtube.com/playlist?list=PL_0LCUdz-bResNuQNZNoouawcPQx6UUBa" class="external-link" target="_blank" rel="noopener"&gt;SS 2023&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;
&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;Related MIT Advanced Data Structures course by Erik Demaine:&lt;/p&gt;</description></item><item><title>Models of computation</title><link>https://curiouscoding.nl/teaching/models-of-computation/</link><pubDate>Mon, 20 Apr 2026 14:00:00 +0200</pubDate><guid>https://curiouscoding.nl/teaching/models-of-computation/</guid><description>&lt;script src="https://curiouscoding.nl/livereload.js?mindelay=10&amp;amp;v=2&amp;amp;port=1313&amp;amp;path=livereload" data-no-instant defer&gt;&lt;/script&gt;
&lt;h2 id="big-o-notation"&gt;
 Big-O notation
 &lt;a class="heading-link" href="#big-o-notation"&gt;
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;
 &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;
 &lt;/a&gt;
&lt;/h2&gt;
&lt;p&gt;Big-\(O\), or \(\mathcal O\) notation relates the asymptotic growth of two functions
to each other.&lt;/p&gt;
&lt;div id="dfn:" class="special-block definition"&gt;&lt;span class="special-block-title"&gt;&lt;span class="special-block-number"&gt;Definition 1&lt;/span&gt; &lt;span class="special-block-name"&gt;Big-O&lt;/span&gt;.&lt;/span&gt;
&lt;p&gt;Given two functions \(f, g: \mathbb R \to \mathbb R^{\geq 0}\), we say that
\[f(x) = O(g(x)), \text{ or } f(x)\in O(g(x))\]
when there exists a constant \(M\in \mathbb R\) such that
\[ |f(x)| \leq M\cdot g(x) \quad \forall x\in \mathbb R. \]&lt;/p&gt;</description></item><item><title>Elias-Fano</title><link>https://curiouscoding.nl/teaching/elias-fano/</link><pubDate>Sun, 25 Jan 2026 00:00:00 +0100</pubDate><guid>https://curiouscoding.nl/teaching/elias-fano/</guid><description>&lt;h2 id="references"&gt;
 References
 &lt;a class="heading-link" href="#references"&gt;
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;
 &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;
 &lt;/a&gt;
&lt;/h2&gt;
&lt;style&gt;.csl-entry{text-indent: -1.5em; margin-left: 1.5em;}&lt;/style&gt;&lt;div class="csl-bib-body"&gt;
&lt;/div&gt;</description></item><item><title>Range-minimum queries</title><link>https://curiouscoding.nl/teaching/rmq/</link><pubDate>Sun, 25 Jan 2026 00:00:00 +0100</pubDate><guid>https://curiouscoding.nl/teaching/rmq/</guid><description>&lt;h2 id="references"&gt;
 References
 &lt;a class="heading-link" href="#references"&gt;
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;
 &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;
 &lt;/a&gt;
&lt;/h2&gt;
&lt;style&gt;.csl-entry{text-indent: -1.5em; margin-left: 1.5em;}&lt;/style&gt;&lt;div class="csl-bib-body"&gt;
&lt;/div&gt;</description></item><item><title>Rank</title><link>https://curiouscoding.nl/teaching/rank/</link><pubDate>Sun, 25 Jan 2026 00:00:00 +0100</pubDate><guid>https://curiouscoding.nl/teaching/rank/</guid><description>&lt;h2 id="references"&gt;
 References
 &lt;a class="heading-link" href="#references"&gt;
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;
 &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;
 &lt;/a&gt;
&lt;/h2&gt;
&lt;style&gt;.csl-entry{text-indent: -1.5em; margin-left: 1.5em;}&lt;/style&gt;&lt;div class="csl-bib-body"&gt;
&lt;/div&gt;</description></item><item><title>Select</title><link>https://curiouscoding.nl/teaching/select/</link><pubDate>Sun, 25 Jan 2026 00:00:00 +0100</pubDate><guid>https://curiouscoding.nl/teaching/select/</guid><description>&lt;h2 id="references"&gt;
 References
 &lt;a class="heading-link" href="#references"&gt;
 &lt;i class="fa-solid fa-link" aria-hidden="true" title="Link to heading"&gt;&lt;/i&gt;
 &lt;span class="sr-only"&gt;Link to heading&lt;/span&gt;
 &lt;/a&gt;
&lt;/h2&gt;
&lt;style&gt;.csl-entry{text-indent: -1.5em; margin-left: 1.5em;}&lt;/style&gt;&lt;div class="csl-bib-body"&gt;
&lt;/div&gt;</description></item></channel></rss>